MCA from Delhi University Delhi

Would you provide me the information bout MCA from Delhi University Delhi?

The Department started the three years Master of Computer Applications (MCA) programme in the year 1982, with the objective of imparting quality education in the field of Computer Science.

Eligibility
You must have passed bachelor’s degree with minimum 60% marks (55% for reserved category students) with Mathematics

Selection process
The selection will be based on the written exam & interviews

DU MCA Exam Details
DU MCA 2013 Exam Date : 7th July, 2013.

DU MSc 2013 Exam Date : 6th July, 2013.

DU 2013 MCA Syllabus

Mathematics :
Mathematics at the level of B.Sc. program of the University of Delhi.

Computer Science :
Introduction to Computer organization including data representation, Boolean circuits and their simplification, basics of combinational circuits; C – programming : Data types including user defined data types, constants and variables, operators and expressions, control structures, modularity : use of functions, scope, arrays.

Logical ability & English Comprehension :
Problem – solving using basic concepts of arithmetic, algebra, geometry and data analysis. Correct usage of English Language and Reading comprehension.

Contact details
University Of Delhi
Cavalry lane,
Near Vishwavidhyalaya Metro Staion,
New Delhi,
DL 110007 ‎
011 2700 6900

Map

__________________
https://t.me/pump_upp

How many total seats available for MCA Program at University of Delhi? Please provide details about admission requirement for MCA Program?

The University of Delhi was established in 1922.

It is approved by UGC and accredited to NAAC.

Details of MCA Program

Seat Matrix
Gen. 24, SC-7, ST-3, OBC-12, Supernumery seats: 7(PWD-1, CW-2, FS-2, Sports/ECA-2)

Category Entrance Merit
Test Basis
GEN 12 12
SC 3 3
ST 2 2
OBC 6 6
PWD 1 1
CW 1 1
Sport/ECA 1 1

Admission Criteria
Have Bachelor Degree from any recognised University with minimum 60% marks

Admission will be done through Admission Test

Duration: 3 Years

Course Structure
SEM I
Object Oriented Programming
Systems Programming
Statistical Techniques
Computer Systems Architecture and Lab.
One elective out of the following
i) MCA 105 (a) -Economics
ii) MCA 105 (b) -Organizational Behavior
iii) Outside Department Elective (preferably Department of Mathematics, Statistics and Operational Research)
Technical Communication

SEM II
Data Structures and File Processing
Discrete Mathematics
Computer Graphics
Data Communication and Computer Networks One elective out of the following
i) MCA 205 – Fundamentals of Accounting and Finance
ii) Outside Department Elective (preferably Department of Mathematics, Statistics and Operational Research)

University of Delhi MCA Course Structure
Part I Semester I
MCA 101: OBJECT ORIENTED PROGRAMMING
Programming Concepts: Algorithm and its characteristics, pseudo code / flowchart, program,
identifiers, variables, constants, primitive data types, expressions, structured data types, arrays,
compilers & interpreters
Statements: Assignment statement, if then else statements, switch statement, looping
statements- while, do while, for, break, continue, input/output statements, functions/procedures
Object Oriented Concepts: Abstraction, encapsulation, objects, classes, methods,
constructors, inheritance, polymorphism, static and dynamic binding, overloading,
Program Development: Object oriented analysis, design, unit testing & debugging, system
testing & integration, maintenance.
Readings
1. Cay Horstmann, Computing Concepts with Java Essentials (5th ed.), John Wiley &
Sons, 2006
2. Bruce Eckel, Thinking in Java, Pearson Education, 2006.
3. H. Schildt, Java 2: The Complete Reference (5th ed.), Tata McGraw Hill, 2002
4. Richard Johnson, An Introduction to Java Programming and Object-Oriented
Application Development, Thomson Learning, 2006
5. Cay S. Horstmann & Gary Cornell, Core Java Volume I (7th ed.), Sun Microsystems
Press Java Series, 2006
6. H.M. Deitel and P.J. Deitel, Java-How to Program (7th ed.), Prentice Hall, 2006
7. Daniel Liang, Introduction to Java Programming (5th ed.), Prentice Hall, 2005
8. J.A. Slack, Programming and Problem Solving with Java, Thomson Learning, 1999
9. B.Stroupstrup : C++ Programming, The C++ Programming Language, Addison Wesley, 2004.
MCA 102: SYSTEMS PROGRAMMING
Assembly Language Programming: Data representation, Instruction formats, addressing
techniques, Flow control, Segments – Data Segment, Code Segment, Stack Segment,
Procedures, Input/ Output, Interrupts and Program development in 8086.
Assembler: macro processor, macros, calls, parameters, expansion, design of two-pass
assembler.
Loaders and Linkers: Loading schemes, design of absolute and direct linking loaders.
Readings
1. Yu-Cheng Gibson and Glenn A. Liu, Microcomputer Systems: The 8086-8088 Family,
Architecture, Programming, and Design, Prentice-Hall Inc., NJ, 2000
2. Barry B. Brey, The Intel Microprocessors: 8086/8088, 80186, 80286, 80386, 80486,
Pentium, Pentium Pro, and Pentium II, Pentium III, Pentium 4 (7th ed.), Prentice-
Hall, 2005
3. Peter Abel, IBM PC Assembly Language and Programming (5th ed.), Pearson
Education, 2001
4. J.R. Levine, Linkers and Loaders, The Morgan Kaufmann Series in Software
Engineering and Programming, 1999
5. S. Chattopadhyay, System Software, Prentice-Hall of India, 2007
MCA 103: STATISTICAL TECHNIQUES
Probability: Basic concepts & definitions (Classical & Axiomatic definition), random
variable, probability density function, probability mass function, distribution function and their
properties, mathematical expectation, conditional expectation, moment generating function,
Characteristic Function, Chebyshev’s inequality.
Various discrete and continuous probability distributions: Uniform (continuous and
discrete), Binomial, Negative Binomial, Poisson, Exponential, Erlang, Gamma, Normal, 2 , tdistribution
and F-distribution, Bivariate normal distribution (Marginal and Conditional
distributions), weak Law of Large Numbers, Central Limit Theorem. Simple random sampling
with and without replacement, Random number generation using inverse transformation
technique (exponential distribution, gamma distribution)
Statistical Testing and Estimation Techniques: Properties of good estimator- unbiasedness,
consistency, sufficiency, completeness, efficiency; Minimum variance unbiased estimators,
Cramer Rao Inequality, Method of Maximum likelihood, method of Moments, Confidence
Intervals for mean, variance and proportions. Large sample tests for mean and proportion, 2 
test for goodness of fit, Tests based on t and F-distributions.
Correlation and Regression: Least square method for curve fitting, multiple regression (three
variables only), Partial and multiple Correlation (for three variables only).
Readings
1. V.K Rohtagi and A.K. Saleh, An Introduction to Probability and Statistics (2nd ed.),
John Wiley & Sons, 2005
2. A.M. Goon, M.K. Gupta and T.S. Dasgupta, Fundamentals of Statistics (7th ed.), Vol. I,
The World Press Pvt. Ltd., 2000
3. R.V. Hogg and A.T. Craig, Introduction to Mathematical Statistics, Macmillan
Publishing Co. Inc., 1978
4. Neil A. Weiss, Introductory Statistics (7th ed.), Pearson Education, 2007
5. A.M. Goon, M.K. Gupta and T.S. Dasgupta, An Outline of Statistical Theory (2nd ed.),
Vol. II, The World Press Pvt. Ltd., 2000
MCA 104 COMPUTER SYSTEMS ARCHITECTURE and LAB
Basic Building Blocks: Boolean logic and Boolean algebra, tri-state logic; flip-flops, counters,
shift registers, adders, substractor, encoders, decoders, multiplexors, demultiplexors
Register Transfer and Micro Operations: Bus and memory transfers, arithmetic, logic shift
micro operations; basic computer organization: common bus system, instruction formats,
instruction cycle, interrupt cycle, input/output configuration, CPU organization, register
organization, stack organization, micro programmed control unit RISC architecture;
microprocessor architecture.
Memory Unit: Primary memory, secondary memory, associative memory, sequential access,
direct access storage devices.
Input-Output Architecture: Input/Output devices; data transfer schemes - programmed I/O
and DMA transfer; data transfer schemes for microprocessors.
Readings
1. M. Morris Mano, Computer System Architecture (3rd ed.), Prentice –Hall of India,
2007.
2. W. Stallings, Computer Organization and Architecture: Designing for Performance
(7th ed.), Pearson Education, 2006
3. A.S. Tanenbaum, Structured Computer Organization (4th ed.), Prentice–Hall of India,
1999.
4. J.P. Hayes, Computer Architecture and Organization (2nd ed.), McGraw-Hill Book
Company, 1988.
MCA 105 (a) PRINCIPLES OF ECONOMICS
Demand and Supply: Concept of demand, determinants of individual and market demand
functions, elasticity of demand – price, income and cross elasticities, concept of supply,
determinants of individual and market supply functions, elasticity of supply, Equilibrium price.
Production: Production function in short run – law of variable proportion, production function
in the long run – isoquants, isocosts, ridge lines, returns to scale; producer’s equilibrium -
optimum combination of inputs to (i) maximize output - given cost and (ii) minimize cost -
given output (least - cost combination of inputs).
Cost function – short run costs, long run average cost, long run marginal cost. Reasons of ‘U’
shape of short and long run cost curves, economies and diseconomies of scale.
Market Structure: Price and output determination under perfect competition and monopoly.
Comparison between perfect competition and monopoly with respect to Efficiency.
Factor Pricing - Demand and supply of factors of production, pricing of a single variable
factor under perfect competition and monopoly; modern theory of rent, quasi-rent.
Macroeconomics: Meaning of macroeconomics, Keynesian theory of determination of income
and employment in the three sector economy, multiplier analysis, IS-LM model of equilibrium
income and interest rate. Meaning and objectives of fiscal and monetary policies.
Readings
1. Case, Karl. E. and Fair, Principles of Economics (6th ed.), Pearson Education, 2002.
2. Lipsey and Chrystal, Economics (10th ed.), Oxford University Press, Delhi, 2004.
3. Pindyck, Rubinfeld and Mehta, Microeconomics (1st Indian reprint), Pearson Education, 2005.
4. R.Dornbush, S.Fisher and R. Startz, Macroeconomics, (9th edition), McGraw-Hill, 2003.
5. A.Koutsoyiannis – Modern Microeconomics, (2nd Edition) Aditya Books, 1979.
MCA 105 (b) ORGANIZATIONAL BEHAVIOUR
Organization Behavior: Introduction to Organization Behavior: Historical roots of
Organizational Behavior, Fundamental concepts, Nature, Emerging trends in the organizational
behavior, Limitation of Organization Behavior, Challenges & Opportunities for Organization
Behavior
Motivation: Importance of motivation at work, approaches to motivation, content theories,
process theories, motivation and its effects, McGreoger theory X and Y, Maslow’s need
hierarchy, Herzberg’s two factor theory, Vroom expectancy theory, OB modification.
Power and Politics: Definition and nature of Power, Types of Power, Contingencies of Power,
Organizational Politics, Where does it occur, Types of political activity, Political strategies for
power acquisition in modern organization, Coping with organizational politics. Empowerment.
Organizational politics and its effects, Organizational politics and ethics.
Conflicts and negotiation: What is conflict? Historical perspective behind conflict or
approaches to conflict, Nature and type of conflict, Conflict Processes, Interpersonal Conflict
Management Styles, Levels of conflict, Perceptual Errors Responsible For conflict,
Consequences of conflict, coping strategies, Negotiation, strategies, processes, issues on
negotiation.
Communication and feedback: Transactional analysis, Johari window, job analysis and job
design: issues, techniques and methodology.
Stress: Nature of stress, causes, and consequences, Individual differences in resistance to
stress, techniques of managing stress.
Leadership: Concept and style, Fiedler’s contingency mode, path-goal theory, leadership
effectiveness.
Readings
1. Narender. K. Chadha, Perspectives in Organizational Behavior, Galgotia Publications Pvt.
Ltd., New Delhi, 2007
2. F. Luthans, Organizatonal Behavior (9th ed.), McGraw-Hill companies Inc., 2002
3. J. Greenberg, R.A. Baron, Behavior in Organizations (8th ed.), Pearson Education Inc.,
2005
4. Steven L. McShane, Mary Ann VanGlinow, Organizational Behavior, Tata McGraw Hill
Company Ltd., 2001
MCA 106 TECHNICAL COMMUNICATION
Language and communication: speech and writing, functions and features of linguistic
communication
Interpersonal and business communication: message structure and message rewriting,
effective textual strategies - clarity, conciseness, consistency and coherence.
Format and content: style and persuasion; argumentation; document summarization.
Technical writing: scientific and technical writing; formal and informal writing; report,
handbook, manual, letter, memorandum, notice, agenda, and minutes.
Report writing: topic, assumptions, hypothesis, overview, analysis and discussion, conclusion,
appendices, references.
Readings
1. Victoria Fromkin, Robert Rodman and Nina Hyams, An Introduction to Language (7th
ed.), Thomson Learning, 2002
2. Leech Thomas, How to prepare, stage, and deliver winning presentations (3rd ed.),
American Management Association, 2004
3. Carol M. Lehman, Deborah Daniel Dufrene and Debbie D. Dufrene, Business
Communication (14th ed.), South-Western Educational Pub, 2004
4. H.A. Murphy, H.W. Hildebrandt and J.P. Thomas, Effective Business Communication
(7th ed.), McGraw-Hill, New York, 1997
5. J. Anderson and M.E. Poole, Assignment and Thesis Writing (4th ed.), John Wiley and
Sons, 2001
Part I Semester II
MCA 201: DATA STRUCTURES AND FILE PROCESSING
Basic Data Structures: Abstract data structures- stacks, queues, linked lists and binary trees.
Sets: Dictionary implementation, use of priority queues, hashing, binary trees, balanced trees,
sets with merge-find operations.
Searching: Internal and external searching, use of hashing and balancing techniques.
Memory Management: Garbage collection algorithms for equal sized blocks, storage
allocation for objects with mixed size, buddy systems.
Physical Devices: Characteristics of storage devices such as disks and tapes, I/O buffering.
Basic File System Operations: Create, open, close, extend, delete, read-block, write-block,
protection mechanisms.
File Organizations: Sequential, indexed sequential, direct, inverted, multi-list, directory
systems, Indexing using B-tree, B+tree and their variants, hashing – hash function, collision
handling methods, extendible hashing.
Readings
1. M.T. Goodrich, R. Tamassia and D. Mount, Data Structures and Algorithms in C++,
John Wiley & Sons, Inc., 2004
2. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms (2nd
ed.), Prentice-Hall of India, 2006
3. M.J. Folk, B. Zoellick and G. Riccardi, File Structures: An Object Oriented Approach
With C++ (3rd ed.), Addison- Wesley, 1997.
4. Robert L. Kruse and A.J. Ryba, Data structures and program design in C++, Prentice-
Hall, Inc., NJ, 1998
5. B.Stroupstrup, The C++ Programming Language, Addison Wesley, 2004
6. D.E.Knuth, Fundamental Algorithms, Vol. I, Addison Wesley, 1997
MCA 202: DISCRETE MATHEMATICS
Overview: Counting, pegion-hole principle, generating functions, recurrence relations, linear
recurrence relations with constant coefficients, homogenous solutions, particular solutions,
total solutions, solution by the method of generating functions.
Growth of Functions: Asymptotic notations, monotonicity, comparison of standard functions
- floors and ceilings, polynomials, exponentials, logarithms and factorials, summations:
summation formulas and properties, bounding summations, approximation by integrals.
Graph Theory: Basic terminology, multigraphs and weighted graphs, paths and circuits,
searching techniques: BFS, DFS and their applications, shortest paths in weighted graphs,
Eulerian paths and circuits, Hamiltonian paths and circuits, Traveling Salesperson problem,
planar graphs, trees and rooted trees, prefix codes, minimal spanning trees, cut sets, directed
graphs.
Mathematical Logic: Propositions, connectives, conditionals and biconditionals, well formed
formulas, tautologies, equivalence of formulas, duality law, normal forms, inference theory for
propositional calculus; predicate calculus: predicates, free and bound variables, inference
theory of predicate calculus.
Introduction to algebraic structures groups, lattices and boolean algebra.
Readings
1. C.L. Liu, Elements of Discrete Mathematics, McGraw-Hill Pub. Co., 1977
2. D.E. Knuth, The Art of Computer Programming (3rd ed.), Vol. 1, Addison Wesley,
1997
3. R.L. Graham, D.E. Knuth, O. Patashnik, Concrete Mathematics (2nd ed.), Addison-
Wesley, 1994.
MCA 203: COMPUTER GRAPHICS
Development of computer Graphics: Raster Scan and Random Scan graphics storages,
displays processors and character generators, colour display techniques, interactive
input/output devices.
Points, lines and curves: Scan conversion, line-drawing algorithms, circle and ellipse
generation,conic-section generation, polygon filling anti aliasing.
Two-dimensional viewing: Co-ordinate systems, linear transformations, line and polygon
clipping algorithms.
Fractals: Generation, Classification and Dimension. Some basic fractal images- Koch curve,
Spearpinski triangle, Mandelbort and Julia sets. Applications.
Three-dimensional concepts: 3-D representations, transformations, perspective and parallel
projections, spline curves and surfaces, Quadtree and Octree data structures. Hidden Surface
and hidden - line removal algorithms, Shading modelsand colour models for solid objects.
Readings
1. D. Hearn and M.P. Baker, Computer Graphics (2nd ed.), Prentice–Hall of India, 2004
2. J.D. Foley, A van Dam, S.K. Feiner and J.F.Hughes, Computer Graphics: Principals
and Practices (2nd ed.), Addison-Wesley, MA, 1990
3. D.F. Rogers, Procedural Elements in Computer Graphics (2nd ed.), McGraw Hill Book
Company, 2001
4. D.F. Rogers and A.J. Admas, Mathematical Elements in Computer Graphics (2nd ed.),
McGraw Hill Book Company, 1990
MCA 204 DATA COMMUNICATION AND COMPUTER NETWORKS
Data Communication: Theoretical basis of data communication; analog and digital signals;
asynchronous and synchronous transmission; data encoding and modulation, techniques,
broadband and baseband transmission; pulse code modulation, bandwidth, channel, baud rate
of transmission; multiplexing; transmission medium; transmission errors - error handling
mechanisms.
Network Classification and Data Communication Services: Local Area Networks, Wide
Area Network, wireless network, internetworking;
Network Reference Models: Layered architectures, protocol hierarchies, interface and
services: ISO-OSI reference model, TCP/IP reference model; internet protocol stacks.
Datalink Layer Functions and Protocols: Framing, error-control, flow -control; sliding
window protocol; HDLC; Data link layer of internet.
Medium Access Sublayer: CSMA/CD protocol, switched and fast Ethernet, IEEE standards
for LAN.
Network functions and protocols: Switching mechanism: Circuit switching, message
switching, packet switching, routing and congestion control, TCP/IP protocol architecture.
Network Applications: File transfer protocol, electronic mail, World Wide Web.
Readings
1. A.S. Tanenbaum, Computer Networks (4th ed.), Prentice-Hall of India, 2003
2. Behrouz Forouzan and S.C. Fegan, Data Communications and Networking, McGraw
Hill, 2006
3. W. Tomasi, Introduction to Data Communications and Networking, Pearson
Education, 2007.
4. S. Haykin, Digital Communications, John Wiley & Sons, Inc., 2005
5. P.C. Gupta, Data Communications and Computer Networks, Prentice-Hall of India,
2006
6. L. L. Peterson and B. S. Davie, Computer Networks: A Systems Approach (3rd ed.),
Morgan Kaufmann, 2003
7. William Stallings, Data and Computer Communications (8th ed.), Pearson Education,
2007

Contact Details
Department of Computer Science
(Faculty of Mathematical Sciences)
1st Floor, New Academic BlocK
University of Delhi
Delhi - 110007
INDIA.
Ph: +91-11-27667591,
Ph: +91-11-27667059,
Ph: +91-11-27667725 (Ext. 1336)
Fax: +91-11-27662553

more detail attached a pdf file;

Attached Files Available for Download

University of Delhi MCA Course Structure.pdf (202.2 KB, 13 views)

__________________
Answered By StudyChaCha Member