r/CMI

Guys please share, I dont know how much i will score. How was the paper according to you....Lets discuss in comments

Hi everyone, just wanted to share some insider stats and updates for those who recently took the MSc DS entrance exam:

• Application Numbers: Approximately 850 students applied specifically for the MSc Data Science program.
• Cross-Applications: Around 170 additional students applied for DS through other programs like MSc Math or MSc CS.
• Attendance: About 640 students actually appeared for the MSc DS exam.
• Selection: There are 60 offers made exclusively through the MSc DS exam. This puts the selection rate at roughly 1 in 10 (60 out of 640).
• Waitlist Note: Be aware that there is usually no waitlist. Last year, a student with 73 marks (where the cutoff was 62) still didn't secure a spot because the seats were filled.
• Answer Key: The official answer key will release this week.

I don't think I am getting in unless the cutoff goes down the drain... 😭

Edit: I am talking about Bsc

There was a problem in part A of Probability. I barely remember the problem but it included two fair dice and one random variable. Can anyone recall the exact problem? Some expectation we had to calculate. One option was 1/36.

I personally feel it was on a tougher side compared to last year. Any thoughts?

can anyone tell expecting cutoff of this year and also my selection rate ___ i did two solid correct question in part B and 9 out of 15 in part A and i'm sc category girl , can i expect my selection ???

FOR BSC PROGRAM !!!!!!

Same.

Bhai gand mar gaya

Please give your inputs on what you have heard from your friends and from your own experience. Tell us how many you attempted and what you expect your marks and the ultimate cutoff to be.

Creating a poll would be meaningless as it is always destroyed by people who are not serious.

Saw somebody asking for it, thought I'd make a post for better visibility. Feel free to add to it if you remember any

Questions I remember incase someone wants:
Part A:
Q1: Let n = 1. If at any point you can either replace n by 2n, or 2n+1 which of the following numbers can be, reached? (I dont remember the exact numbers but all are correct since all positive integers are reachable)
Q2: Dont remember the exact wording. But it was a simple derangement problem. Answer is D5 = 44.
Q3: Which of these are true at all points where they are defined? |sinx|<|x|, |tanx|>|x|, and some other options i dont remember
Q4: Consider a function from {1234}->{123}. A] Find number of functions with exactly 2 images, B] number of onto functions, C] If f(1) = 1 and f(2) = 2, find number of onto functions, and some more things i dont remember.
Q5: A jar has 3 red balls and 2 blue balls. Two balls are picked without replacement. Let B be event that first ball is red. A be event that both balls are red. Find P(A), P(B), P(A/B), P(B'/A')
Q6: Consider a switchboard with all switches off. For numbers i running from 1 through 10, toggle kth switch if the i divides the k. Find which switches will be turned on after going through all 10 numbers (I think answer was 1,4,9)
Q7-9: Psuedocode Enigma. I remember but too lazy to write the whole problem out

Part B:
Q1: Given f(x+y) = f(x) × f(y). Prove that if f(0) = 1 then f(r) = f(1)^r for any rational number r.
Q2: If a prime number p, divides n^2+n+1, find (n^3) % p.
Q3: If a prime number p, divides n^2+n+1 and p > 3, show that 1, n and n^2 all have distinct remainders when divided by p.
Q4. Sum of first 100 numbers which are not multiples of 3 or 7.
Q5: Given A^2 = A for some 2x2 matrix A, Find Trace(A).
Q6: T = max{x1, x2, x3) where xi follows Uniform(0, theta). Find pdf, cdf, mean and variance of T.
Q7: Consider a sequence of n natural numbers {1, 2, .... , n}. Suppose they are randomly permuted. A position "i" is considered maxima if it is greater than all numbers to left of it. Eg: 1,3,5,2. Here 1,3,5 are all maximas. Find the probability that in a sequence of length n, the ith position will be a maxima.
Q8: Find the expected number of maxima in a sequence of length n.
Q9: The faulty llm model question. I dont remember the exact statements.
Q10: Find the conditions under which the sum of first n natural numbers will divide the sum of squares of first n natural numbers.
Q11: Pseudocode. Function Steps(whille n>1, if n is odd n = n-1 and count=count+1, if n is even n = n/2count=count+1, return count). Find steps(16) or some other number i dont remember
Q12: Pseudocode. Function Steps(whille n>1, if n is odd n = n-1 and count=count+1, if n is even n = n/2count=count+1). For a number which is k digits long in binary find the max value steps() can return

This course is specifically designed for students seeking to bridge the gap between computational calculus and the formal proof-based thinking required for higher mathematics and research.

Course Overview The curriculum is primarily modeled after the first volume of

the definitive classic by Vladimir A. Zorich. The course emphasizes a synthesis

of formal rigor and geometric intuition, exploring the interplay between

classical analysis and the natural sciences (physics, mechanics, and biology).

Academic Modules The course is structured into eight comprehensive modules:

- I. Foundations: Mathematical Logic, Set Theory, and Functions.

- II. The Real Number System: Axiomatics, Completeness, and Cardinality.

- III. Theory of Limits: Sequences, Series, and the Cauchy Criterion.

- IV. Continuity: Global properties, Discontinuities, and Inverse Functions.

- V. Single-Variable Differentiation: Differentials and Taylor’s Formula.

- VI. Integration: The Riemann Integral and the Newton-Leibniz Formula.

- VII. Multivariable Calculus (I): Limits and Continuity in \mathbb{R}^m.

- VIII. Multivariable Calculus (II): Jacobians, Implicit Functions, and

Constrained Extrema.

Scientific Applications Beyond abstract theory, the course explores the

mathematical modeling of reality, including:

- Relativistic Mechanics: Galilean and Lorentz transformations.

- Physics: Radioactive decay, rocket motion, and atmospheric pressure.

- Oscillations: Simple harmonic and damped motion.

Pedagogical Structure (Weekly) To ensure academic excellence, the course follows

a three-tiered weekly schedule:

1. Theory Session: Formal lectures focusing on proofs and conceptual

development.

2. Problem Solving: Rigorous training in non-standard problems from competitive

examinations.

3. Reading Session: Guided reading to cultivate the habit of interpreting

primary mathematical literature.

Instructors

- Ryan Hota (Chennai Mathematical Institute)

- Abhinandan Saha (Chennai Mathematical Institute)

Course Logistics

- Tuition Fee: ₹3,000 per month.

- Certification: An official Proof of Completion will be awarded upon

successful fulfillment of the course requirements, suitable for inclusion in

academic CVs and resumes.

Any idea whether the cutoff would be lower or higher than past year?

I m a tier 2 college student studying btech computer science and i really want to do a phd and have a career as a researcher in theoretical computer science will it give good phd university like Purdue, U pen ,stonny , uni of Austin Texas or other European program at inria , ens , Edinburgh? Will I get a fair shot at this program after masters from cmi because i can't afford masters abroad

How was the paper guys, how much you are expecting?

View Poll

So for context I've been a part of ioitc and have a silver in INOI, thus were wondering can I bypass the admission exam?

Also even though I qualified inoi, can I choose maths and physics as my major?

And lastly does CMI have an interview for those who get in via olympiads?

And will I be eligible for the shriram scholarship (or whatever it's called) ?

Tmrw is the exam. Hope everyone prepared well.