The Department of Computer Science University of Delhi conducts
threeyear Postgraduate degree course of MCA. This course is duly
sponsored by University Grants Commission and Department of Electronics,
Government of India.
Age:
No person shall be eligible for admission to the MCA course in the
University unless he/she is 20 years of age before the 1st October
of the year he/she seeks admission. However, the age limit can be
relaxed by the ViceChancellor upto one year on individual merit
after a written request is made by the candidate.
Syllabus:
Various universities in India hold an entrance test for admission
to the Master 'of Computer Applications course and frame their own
syllabus.
M.C.A.
The subjects of written test (Objective Type) maximum marks and
time allotted to each subtest are as follows:
Sl
No.

Test

No.of
Questions Allotted

Duration

1.

Quantitative
and Mathematical
Ability Test 
50

75
min

2.

Deductive
and Logical Ability 
50

60
min

Note:
· Each question carries 4 marks.
· On the basis of candidate's performance a number of 150 candidates
are called for personal interview. A Merit List
is drawn on the basis of performance in the Admission Test (80%)
and Personal Interview (20%).
DETAILED SYLLABUS
SubTest I:
Quantitative and Mathematical Ability Test Algebra:
Sets, groups, fields, vector spaces; Complex numbers; Demoivre's
theorem and its simple applications; Matrices, determinants; Relation
between roots and coefficients of an equation: Scalar and vector
products, triple products.
Calculus:
Real Number System; Continuity and limits; Differentiation; Integration;
Definite Integral; evaluation of lengths and area of curves; curvature;
asymptotes; tracing of curves; Partial differentiation; Differential
equations of first order and their solutions; Linear differential
equations with constant coefficients; Homogeneous Linear differential
equations.
Geometry:
2dimensions; straight lines, circles, parabola, hyperbola and ellipse;
Classification of curves of second degree.
3dimensions; spheres, quadratic cones and cylinders.
Real Analysis:
Sequences: sequences of real numbers; Convergent sequences; Cauchy
sequences; Monotonic sequences; bounds; Infinite series and their
different tests of convergence; Absolute convergence; Uniform convergence.
Properties of continuous functions; Rolle's theorem, mean value
theorem; Taylor's and Maclaurin's series; Maxima and Minima; Indeterminate
forms.
Statistics and Programming:
Frequency distributions and measures of dispersion, skewness and
kurtosis; permutations and combinations; Probability; Random variables
and distribution functions; mathematical expectation and generating
functions; Binomial, Poisson, Normal distribution. Curve fitting
and principle of least squares; Correlation and regression; Sampling
and large sample tests; Tests of significance based on t, x2 and
F distributions.
Formulation of simple linear programming problems; basic concepts
of graphical and simplex methods.
SubTest II:
Deductive and Logical Ability Test Interpretation of data, problem
solving, flowcharts and algorithms, number systemsbinary, octal,
hexadecimal.
Truthvalues, logical operations, logic functions and their evaluation.