The Master of Computer Applications (MCA) programme, introduced in the year 1982, has been formulated to provide a unique environment for mastering the various disciplines of computer science and is an attempt to produce complete professionals for the IT industry. The MCA programme is a 3-year full-time course consisting of 6 semesters. The last semester is devoted to a professional training project in the industry. The curriculum enables mastering the fundamentals of computing and gives an opportunity to gain an in-depth knowledge of a broad range of topics. The emphasis is on the understanding and ability to apply the principles of computing which make the students well equipped for future work environment. Hands-on approach is taken to help students develop expertise under the guidance of erudite teaching staff. Guest lectures, case studies and presentations are organised from time to time to give an insight into the latest development and happenings in the industry.To check seats for MCA Click here
Course Requirements | Marks Requirements |
Any bachelor degree from the University of Delhi or any other University whose examination is recognized as equivalent to that of University of Delhi with at least one paper in Mathematical Sciences (Mathematics, Computer Science, Statistics, Operational Research) under annual mode/at least two papers in Mathematical Sciences (Mathematics, Computer Science, Statistics, Operational Research) in semester mode. | 60% marks in aggregate or equivalent of CGPA as per University norms wherever it is applicable. |
Note:
1. The candidates who are appearing in the final year examinations of the degree on the basis of which admission is sought are also eligible to apply (Relaxation will be given to the candidates belonging to SC, ST and OBC category as per the University rules).
Eligibility: As per the Bulletin of Information
Events | Dates 2022 |
Starting of application form for University Of Delhi | 6th April 2022 |
Last date for submission | 15th May 2022 |
Admit card | Last week of May 2022 |
Exam date | 1st week of June 2022 |
Declaration of result | June/ July 2022 |
Group discussion/ interview | July 2022 |
1st allotment list release date | July 2022 |
Document verification | Last week of July 2022 |
Commencement of classes | In month of September 2022 |
The syllabus for the MCA Entrance Test would be as follows:
Mathematics: Calculus
Limit and continuity of a function: (ε-δ and sequential approach). Properties of continuous functions including intermediate value theorem, Differentiability, Rolle’s theorem, Lagrange’s mean value theorem, Cauchy mean value theorem with geometrical interpretations. Uniform continuity. Definitions and techniques for finding asymptotes singular points, Tracing of standard curves. Integration of irrational functions. Reduction formulae. Rectification. Quadrature. Volumes Sequences to be introduced through the examples arising in Science beginning with finite sequences, followed by concepts of recursion and difference equations. For instance, the sequence arising from Tower of Hanoi game, the Fibonacci sequence arising from branching habit of trees and breeding habit of rabbits. Convergence of a sequence and algebra of convergent sequences. Illustration of proof of convergence of some simple sequences such as (–1)n /n, I/n2 , (1+1/n)n , sin n/n, xn with 0 < x < 1. Graphs of simple concrete functions such as polynomial, trigonometric, inverse trigonometric, exponential, logarithmic and hyperbolic functions arising in problems or chemical reaction, simple pendulum, radioactive decay, temperature cooling/heating problem and biological rhythms. Successive differentiation. Leibnitz theorem. Recursion formulae for higher derivative. Functions of two variables. Graphs and Level Curves of functions of two variables. Partial differentiation upto second order. Computation of Taylor’s Maclaurin’s series of functions such as ex , log(1 + x), sin (2x), cos x. Their use in polynomial approximation and error estimation. Formation and solution of Differential equations arising in population growth, radioactive decay, administration of medicine and cell division.
Geometry and Vector Calculus:
Techniques for sketching parabola, ellipse and hyperbola. Reflection properties of parabola, ellipse and hyperbola. Classification of quadratic equations representing lines, parabola, ellipse and hyperbola. Differentiation of vector valued functions, gradient, divergence, curl and their geometrical interpretation. Spheres, Cylindrical surfaces. Illustrations of graphing standard quadric surfaces like cone, ellipsoid.
ALGEBRA
Complex Numbers: Geometrical representation of addition, subtraction, multiplication and division of complex numbers. Lines half planes, circles, discs in terms of complex variables. Statement of the Fundamental Theorem of Algebra and its consequences, De Moivre’s theorem for rational indices and its simple applications.
Matrices: R, R2 , R3 as vector spaces over R. Standard basis for each of them. Concept of Linear Independence and examples of different bases. Subspaces of R2 , R3 . Translation, Dilation, Rotation, Reflection in a point, line and plane. Matrix form of basic geometric transformations. Interpretation of eigenvalues and eigenvectors for such transformations and eigenspaces as invariant subspaces. Matrices in diagonal form. Reduction to diagonal form upto matrices of order 3. Computation of matrix inverses using elementary row operations. Rank of matrix. Solutions of a system of linear equations using matrices.
Groups: Definition and examples of groups, examples of abelian and nonabelian groups: the group Zn of integers under addition modulo n and the group U (n) of units under multiplication modulo n. Cyclic groups from number systems, complex roots of unity, circle group, the general linear group GL (n,R), groups of symmetries of (i) an isosceles triangle, (ii) an equilateral triangle, (iii) a rectangle, and (iv) a square, the permutation group Sym (n), Group of quaternions, Subgroups, cyclic subgroups, the concept of a subgroup generated by a subset and the commutator subgroup of group, examples of subgroups including the center of a group. Cosets, Index of subgroup, Lagrange’s theorem, order of an element, Normal subgroups: their definition, examples, and characterizations, Quotient groups.
Rings: Definition an examples of rings, examples of commutative and noncommutative rings, rings from number systems, Zn the ring of integers modulo n, ring of real quaternions, rings of matrices, polynomial rings, and rings of continuous functions. Subrings and ideals, Integral domains and fields, examples of fields: Zp , Q, R, and C. Field of rational functions.
Vector spaces: Definition and examples of vector spaces. Subspaces and its properties Linear independence, basis, invariance of basis size, dimension of a vector space. Linear Transformations on real and complex vector spaces: definition, examples, kernel, range, rank, nullity, isomorphism theorems.
Real Analysis
Real Sequences: Finite and infinite sets, examples of countable and uncountable sets. Real line, bounded sets, suprema and infima, statement of order completeness property of R, Archimedean property of R, intervals. Concept of cluster points and statement of Bolzano Weierstrass’ theorem. Cauchy convergence criterion for sequences. Cauchy’s theorem on limits, order preservation and squeeze theorem, monotone sequences and their convergence.
Infinite Series: Infinite series. Cauchy convergence criterion for series, positive term series, geometric series, comparison test, convergence of p-series, Root test, Ratio test, alternating series, Leibnitz’s test. Definition and examples of absolute and conditional convergence. Sequences and series of functions, Pointwise and uniform convergence. M-test, change or order of limits. Power Series: radius of convergence, Definition in terms of Power series and their properties of exp (x), sin (x), cos (x).
Riemann Integration: Riemann integral, integrability of continuous and monotonic functions.
Computer Science: Data representation, Boolean circuits and their simplification, C-programming: Data types, constants and variables, operators and expressions, control structures, use of functions, scope, arrays.
Logical ability & English Comprehension: Problem-solving using basic concepts of arithmetic, algebra, geometry and data analysis. Reading comprehension and correct usage of English language.
SC, ST, PwBD Rs. 300/-
UR, OBC and EWS Rs. 750/-
The candidates are advised to fill their forms carefully. No correction after the submission of the form will be allowed. Social Category, Gender, and details of the Bank Account once selected/entered at the time of Registration will not be changed in any circumstance. Registration Fee once deposited will not be refunded / adjusted in any circumstances.
Mode of Examination CBT (Computer Based Test)
Duration 2 Hours
Type of Questions Multiple Choice Question
Number of Questions 50
Marks per question 4 (four) for each correct response
Scoring -1 negative marking for incorrect response
Medium of Paper English
MCA entrance examination shall consist of 50 objective type questions to be solved in 02 hours. The approximate distribution of questions will be as given below:
English | 10 |
Mathematics | 30 |
Computer Science | 04 |
Logical Ability | 06 |
Admission Criteria | Total | GEN | SC | ST | OBC | EWS | PWD (3%)* | CW (5%)* | Sports (Upto 5%) * |
---|---|---|---|---|---|---|---|---|---|
Entrance | 58 | 23 | 09 | 04 | 16 | 06 | 02 | 03 | 03 |
Merit | 00 | 00 | 00 | 00 | 00 | 00 | 00 | 00 | 00 |
Foreign National (5%) | 03 | – | – | – | – | – | – | – | – |
University Of Delhi MCA selection process 2022
The selection of the candidates for the MCA program at Delhi University is generally based on the marks obtained on the Delhi university entrance test. Students would be allocated colleges based on the Delhi University entrance test exam marks.
It is ideally a 2-hour examination with 50 MCQs. The exam is conducted online on a specific portal provided by the NTA. The candidate is rewarded with 4 marks for any correct answer and penalized with one mark for a wrong answer. No marks are deducted if a candidate does not attempt any question.
Note:
Supernumerary Seats (PWD, CW, Sports, Foreign National) are over and above the total number of seats. (As per the University rules)