Many students begin preparing for the CMI Entrance Exam without knowing which topics apply to their chosen program. Since the syllabus differs for BSc, MSc, Data Science, Computer Science, and PhD courses, studying the wrong subjects can waste valuable preparation time.
Here, the given details explain the complete CMI Entrance Exam Syllabus 2026, including course-wise topics, exam pattern. It helps you understand what to study for your chosen program and plan your preparation in the right direction.
CMI holds one entrance exam for each of its programs. Students who wish to join BSc, MSc, or PhD courses must sit for the exam that matches their chosen subject. The exam checks problem-solving skills more than rote learning, so a clear CMI entrance exam pattern and syllabus understanding helps a lot before practice begins.
|
Program |
Subject Focus |
|
BSc (Hons) Mathematics and Computer Science |
School-level Mathematics |
|
MSc/PhD Computer Science |
Discrete Math, Programming, Algorithms |
|
MSc/PhD Mathematics |
Algebra, Analysis, Topology |
|
MSc Data Science |
Math, Statistics, Programming Logic |
|
PhD Physics |
Classical & Quantum Physics, Electrodynamics |
The CMI BSc Mathematics syllabus is based mostly on topics taught up to Class 12. The exam wants students who can think in new ways, not just apply formulas from memory. It tests three major areas: calculus, algebra, and geometry, along with combinatorics, number theory, and logical puzzles.
Students should know:
All Class 10 and Class 12 NCERT math topics, including relations and functions, algebra, calculus, coordinate geometry, vectors, matrices, counting, and probability.
Class 10 topics such as Euclidean geometry and basic number theory.
Standard functions like polynomials, exponential, logarithmic, and trigonometric functions, along with their graphs.
Number theory basics such as prime factorization, GCD through Euclid's algorithm, and modular arithmetic.
Complex numbers in both rectangular and polar form, roots of unity, and the fundamental theorem of algebra.
Since CMI's undergraduate program combines Mathematics and Computer Science into a single BS (Hons) degree, the CMI BSc Computer Science syllabus for entrance follows the exact same math-based paper as above. There is no separate computer science entrance test at the BSc level.
The CMI MSc Mathematics entrance syllabus is meant for both MSc and PhD applicants, so it includes some topics normally taught only at the postgraduate level. The main areas are:
|
Topic |
Key Concepts |
|
Algebra |
Groups, rings, fields, matrices, vector spaces, eigenvalues, orthogonal matrices |
|
Complex Analysis |
Holomorphic functions, Cauchy formulas, residues, conformal maps |
|
Calculus and Real Analysis |
Limits, Riemann integration, sequences, series, multivariable calculus, metric spaces |
|
Topology |
Topological spaces, connectedness, compactness, Hausdorff spaces |
Good reference books for this paper include Topics in Algebra by Herstein, Principles of Mathematical Analysis by Rudin, and Topology by James Munkres.
The MSc/PhD Computer Science paper has three parts, so knowing the CMI entrance exam pattern and syllabus for this course helps students manage time well.
Paper Pattern:
|
Part |
Marks |
Question Type |
|
Part A |
30 |
10 multiple-choice questions |
|
Part B |
30 |
3 long-answer questions |
|
Part C |
40 |
8 long-answer questions (attempt any 4) |
Main Topics Covered:
Discrete Mathematics: combinatorics, induction, pigeonhole principle, sets, functions, and relations.
Logic: Boolean logic, truth tables, and logic gates.
Graphs: trees, bipartite graphs, BFS, DFS, and shortest paths.
Formal Languages and Automata Theory: regular expressions, finite automata, context-free grammars.
Algorithms: Big-O notation, sorting, searching, recurrence relations.
Data Structures: lists, stacks, queues, binary search trees, and heaps.
Probability Theory: Bayes' theorem, distributions, expectation, and variance.
Calculus and Linear Algebra: limits, derivatives, vector spaces, and eigenvalues.
The MSc Data Science course checks a student's mathematical reasoning along with the ability to read data logically. The CMI maths syllabus for this program includes:
School Level Mathematics: progressions, polynomials, matrices, determinants, linear equations, prime numbers, logarithms, and basic calculus.
Discrete Mathematics: sets, permutations, combinations, pigeonhole principle, binomial theorem, and boolean logic.
Probability Theory: conditional probability, random variables, standard distributions, expectation, and variance.
Programming Logic: reading and understanding simple pseudocode with variables, loops, and conditionals.
A smart CMI preparation strategy can help students of any program score better without wasting time on the wrong topics.
Read the syllabus of your chosen course first and mark the topics you already know well.
Solve old question papers, since CMI shares past papers openly on its website.
Practice one topic at a time and move to harder problems only after the easy ones feel comfortable.
Write full solutions, not just final answers, since CMI checks how clearly a student explains their reasoning.
Keep a small notebook of new problem-solving ideas so you can revise them quickly before the exam.
Study with a friend or a group, since explaining a problem to someone else helps you understand it better.
Take timed mock tests close to the exam date to build speed and confidence.
Students can download the official CMI syllabus PDF for each course directly from the CMI website, along with sample question papers from past years. These official documents list the exact topics and suggested books for BSc, MSc, and PhD programs, so students should always check the latest PDF before starting preparation, since small updates can happen from year to year.
PW provides Olympiad exam content, including Olympiad Exams Updates, sample papers, mock tests, guidance sessions, and more. Also, enroll today in the Olympiad Online Batches for preparation.
