AI Master's Prerequisites Checklist (2026): Math & CS You Actually Need

Program websites list prerequisites vaguely: "calculus and programming required." This checklist maps the specific topics within each subject that appear in core AI master's courses, identifies the best resources to fill gaps, and tells you which programs actually enforce each requirement β€” so you arrive prepared, not surprised.

Prerequisites at a Glance

6 subjects
Core prerequisite domains for AI/ML master's programs
Source: AI Graduate analysis
Linear algebra
Single most predictive prerequisite for success in core ML courses
Source: MSCS faculty surveys
40–60 hrs
Time to complete a rigorous free online linear algebra course (MIT 18.06)
Source: Course estimates
6–9 months
Realistic prep time for non-CS undergrads with basic calculus
Source: AI Graduate estimate
NumPy
Practical skill that synthesizes LA + calculus + Python in one diagnostic
Source: AI Graduate

How should you use this prerequisites checklist before you apply?

Treat it like a gap analysis: close anything β€œmission-critical” before day one, document what you finished, and do not rely on vague self-assessments.

Bottom line: Programs may admit optimistic applicantsβ€”but your grades and sanity pay the price if you skip the prerequisites.

Work through each subject section. For each topic cluster within a subject, honestly rate yourself: (1) Can solve representative problems reliably, (2) Familiar but needs review, or (3) Not covered. Any subject with multiple "not covered" topic clusters is a gap worth closing before your first semester. The resources listed for each subject are AI Graduate's editorial picks for efficient, self-directed preparation β€” prioritizing free, high-quality materials over paid courses when a strong free option exists.

Data reviewed: May 2026. Prerequisite requirements confirmed against publicly posted program prerequisites for CMU MSML, Stanford MSCS, MIT EECS, Berkeley EECS, Georgia Tech OMSCS, UT Austin MSAI, Columbia MSCS, and UCSD CSE MS.

Linear Algebra

Essential

Matrix operations underlie every ML algorithm: weight matrices in neural networks, PCA, attention mechanisms, SVD for matrix factorization. Without linear algebra, you cannot follow the derivations in any core ML course.

Topics to master

  • Matrix multiplication, transpose, inverse, rank
  • Eigenvalues, eigenvectors, diagonalization
  • Singular Value Decomposition (SVD)
  • Vector spaces, basis, orthogonality
  • Vector norms (L1, L2), dot products, cosine similarity

Recommended resources

Who requires it: CMU MSML, Stanford MSCS, MIT EECS, Berkeley EECS, Columbia MSCS β€” all explicitly require; OMSCS recommends strongly

Probability & Statistics

Essential

ML loss functions, model evaluation, Bayesian methods, and uncertainty quantification all require rigorous probability. Most graduate ML courses open with probability theory before any algorithm.

Topics to master

  • Random variables, PMF, PDF, CDF
  • Common distributions: Gaussian, Bernoulli, Poisson, Exponential
  • Expectation, variance, covariance, correlation
  • Bayes' theorem, conditional probability
  • Maximum Likelihood Estimation (MLE), MAP estimation
  • Hypothesis testing, p-values, confidence intervals

Recommended resources

Who requires it: All quantitative MS programs: required. CMU 10-601 explicitly lists probability as a prerequisite.

Multivariable Calculus

Essential

Gradient descent β€” the optimization engine of almost all deep learning β€” is multivariable calculus. Partial derivatives, chain rule, and gradients are not optional.

Topics to master

  • Derivatives and rules (product, chain, log)
  • Partial derivatives and gradients
  • Jacobian matrices and Hessians
  • The chain rule in the context of backpropagation
  • Basic optimization: stationary points, convexity

Recommended resources

Who requires it: Universal prerequisite β€” all AI/ML/CS programs. Calculus III or equivalent required at Georgia Tech, UT Austin, CMU, Stanford.

Algorithms & Data Structures

Required for MSCS programs

CS-department programs (MSCS, MCSAI) gate advanced coursework on graduate algorithms. Time/space complexity analysis is used in every ML systems paper and production ML engineering interview.

Topics to master

  • Big-O, Big-Theta, Big-Omega notation
  • Sorting, searching, hashing
  • Graph algorithms (BFS, DFS, Dijkstra)
  • Dynamic programming and memoization
  • Trees (BST, heaps, tries), balanced trees
  • Amortized analysis

Recommended resources

Who requires it: All MSCS programs. Algorithms is often the gateway exam for non-CS undergrads (e.g., GT OMSCS 'Knowledge-Based Artificial Intelligence' requires data structures proficiency).

Python Programming

Universal

Python is the lingua franca of ML engineering. Every major framework (PyTorch, TensorFlow, JAX, scikit-learn) is Python-first. All practical ML coursework assumes Python fluency.

Topics to master

  • Python syntax and idioms: list comprehensions, generators, decorators
  • OOP: classes, inheritance, dunder methods
  • NumPy: arrays, broadcasting, vectorized operations
  • Pandas: DataFrames, groupby, merge, handling missing data
  • Matplotlib / Seaborn: visualization basics
  • Scikit-learn: estimator API, pipelines, cross-validation

Recommended resources

Who requires it: Universal β€” every AI/ML program. GT OMSCS explicitly lists Python; CMU 10-601 is Python-based; UT Austin MSAI assumes Python fluency.

Discrete Mathematics

Required for theoretical CS work

Proofs, logic, combinatorics, and graph theory appear in ML theory courses, algorithm analysis, and any program with a theory-of-computation component.

Topics to master

  • Mathematical proofs (induction, contradiction, direct proof)
  • Set theory, functions, relations
  • Propositional and predicate logic
  • Combinatorics (permutations, combinations, pigeonhole)
  • Graph theory basics (paths, cycles, trees)
  • Modular arithmetic and basic number theory

Recommended resources

Who requires it: MSCS programs with theory or algorithms core. Less critical for professional MSAI programs focused on applied ML.

Program-by-program prerequisite summary

Different programs weight prerequisites differently. Here is a comparison of formally stated or strongly recommended prerequisites across major AI/ML programs, based on public admissions pages.

ProgramLin. Alg.Calc.Prob/StatsAlgosPythonNotes
CMU MSML / 10-601RequiredRequiredRequiredRequiredRequiredOne of the strictest; deficiencies noted in decision
Stanford MSCS (AI focus)RequiredRequiredRequiredRequiredAssumedStrong math background assumed; GRE previously required
Georgia Tech OMSCSStrongly rec.RequiredStrongly rec.RequiredStrongly rec.Background assessment published; no hard gatekeeping
UT Austin MSAI (online)Strongly rec.RequiredStrongly rec.Strongly rec.RequiredNo hard gatekeeping but core courses assume these
Columbia MSCSRequiredRequiredRequiredRequiredAssumedFormal prerequisite verification common
Northeastern Align MSCSCovered in bridgeCovered in bridgeCovered in bridgeCovered in bridgeTaughtBridge semester builds all foundations; adds ~1 semester
Penn MCITTaught in programTaught in programVaries by trackTaught in programTaughtCareer-switcher program; math built into first year
UIUC MCS (online)RequiredRequiredRequiredRequiredRequiredStrict; same standards as on-campus

Source: AI Graduate review of publicly posted program prerequisites and admissions FAQs, May 2026. Requirements change β€” verify directly with each program's admissions office before applying.

Gap-filling strategies by applicant background

Different starting points call for different preparation strategies. Here is an efficient path for the most common applicant profiles:

BS in Biology, Psychology, or Social Science (some calculus, no CS or linear algebra)

6–9 months preparation: (1) Linear algebra: MIT 18.06 full course, 8 weeks. (2) Probability: MIT 6.041 or Blitzstein Stats 110, 8 weeks. (3) Python + NumPy: Python Data Science Handbook, 8–10 weeks. (4) Algorithms basics: MIT 6.006 first 8 lectures, 4 weeks. (5) Mini-project: implement linear regression and logistic regression from scratch in NumPy. This puts you at the baseline competency for GT OMSCS or UT Austin MSAI online programs. For on-campus programs like CMU or Columbia, also take a community college algorithms course for a formal transcript.

BS in Mathematics or Physics (strong calculus and linear algebra, no CS or programming)

3–4 months: You have the hardest-to-build foundations already. Focus: (1) Python to production fluency: spend 8–12 weeks writing real code daily, completing Python Data Science Handbook, then implementing 5 ML algorithms from scratch. (2) Data structures and algorithms: MIT 6.006, 4–6 weeks. (3) Algorithms course or community college Python course for transcript evidence if applying to strictly gatekept programs. Your math background will be an asset in core courses β€” the programming investment is all that stands between you and readiness.

BS in CS with weak statistics and linear algebra (strong programmer, shaky math)

4–6 weeks targeted math review: You have the programming foundation. Targeted gaps: (1) Linear algebra: 3Blue1Brown Essence of LA (16 videos, fast) plus MIT 18.06 problem sets for sections 1–4 (eigenvalues, SVD). (2) Probability: Blitzstein Stats 110 lectures 1–12 covering distributions, expectation, Bayes. (3) Verification exercise: implement PCA from scratch using eigendecomposition (not sklearn) and explain each step. If you can do this fluently, your math is ready. This is the fastest path to readiness among all profiles.

BS in Engineering (EE, ME, ChemE) with strong calculus and programming, mixed statistics

4–6 weeks: Engineering programs produce strong calculus and programming foundations but sometimes thin probability. (1) Probability: Blitzstein Stats 110 or MIT 6.041, 6–8 weeks covering distributions and Bayesian reasoning. (2) Python ML-specific: if your engineering background used MATLAB, spend 3–4 weeks adapting to Python/NumPy idioms. (3) Verify with the NumPy gradient descent implementation diagnostic. Most EE/ME graduates can be ready in a summer with targeted work.

The NumPy gradient descent diagnostic

Before you apply or enroll, complete this single exercise. It is the most efficient integration test for AI master's readiness:

The Diagnostic: Implement Linear Regression with Gradient Descent in NumPy Only

  1. Generate a synthetic dataset: 100 data points (x, y) where y = 3x + 2 + Gaussian noise.
  2. Implement a linear model: y_hat = X @ w + b where X is the (100 Γ— 1) feature matrix, w is the weight, b is the bias.
  3. Compute mean squared error loss: L = (1/n) * sum((y_hat βˆ’ y)Β²).
  4. Derive and implement the gradients: βˆ‚L/βˆ‚w and βˆ‚L/βˆ‚b analytically (do not use PyTorch autograd).
  5. Run 1,000 gradient descent steps with learning rate 0.01. Print loss every 100 steps.
  6. Plot the loss curve and the fitted line over the data.
  7. Verify w converges near 3 and b near 2.

If you complete this cleanly and can explain why βˆ‚L/βˆ‚w = (2/n) * Xα΅€(y_hat βˆ’ y), you have the prerequisite foundation for most AI master's core courses.

People also ask (on this site)

Frequently Asked Questions

Do I need to have taken linear algebra in college to apply to an AI master's program?

Linear algebra is the closest thing to a universal hard requirement for AI and ML programs. Nearly every core ML course β€” from gradient descent to PCA to attention mechanisms in transformers β€” relies directly on matrix operations, eigendecomposition, and vector spaces. Programs differ in how strictly they enforce this at admissions: some (CMU MSML, Stanford MSCS) expect undergraduate linear algebra as a hard prerequisite and will note the deficiency; others (Georgia Tech OMSCS, some online programs) admit applicants with the expectation that they'll self-study. However, entering an AI master's without solid linear algebra virtually guarantees struggling in core courses. Specifically, you need: matrix multiplication, transpose, inverse, rank; eigenvalues and eigenvectors; singular value decomposition (SVD); vector norms and dot products; and basic linear transformations. If you took linear algebra years ago and felt shaky, a targeted review using MIT 18.06 (Gilbert Strang, freely available on MIT OpenCourseWare) or 3Blue1Brown's Essence of Linear Algebra YouTube series (16 videos, 3–5 hours total) before your first semester is worth the investment. Community college transcripts in linear algebra are accepted by most programs as a prerequisite fulfillment, and Coursera's Mathematics for Machine Learning: Linear Algebra (Imperial College London) provides a verifiable certificate if you need documented evidence of completion.

How much probability and statistics do I need before starting an AI master's?

You need a solid undergraduate probability and statistics course at minimum β€” not a business statistics survey, but a mathematically rigorous probability course covering random variables, distributions (normal, Bernoulli, Poisson, exponential), expectation and variance, conditional probability and Bayes' theorem, maximum likelihood estimation, hypothesis testing, and basic Bayesian reasoning. Here's why each section matters for AI: Bayes' theorem is the foundation of Naive Bayes, probabilistic graphical models, and all of Bayesian deep learning. Maximum likelihood estimation underlies the loss functions of nearly every ML model. The normal distribution and CLT underlie confidence intervals used in model evaluation. Understanding expectation and variance is essential for understanding bias-variance tradeoff. If your undergraduate statistics background was primarily descriptive statistics and ANOVA, you have a meaningful gap. The most efficient way to close it: MIT 6.041 (Probability, available on MIT OCW and edX), or Stanford's Statistics 110 (available on Harvard's YouTube channel). Both are rigorous enough to prepare you for graduate courses. Expect 40–60 hours of study to get from a basic stats background to graduate-ready probability.

What programming skills do AI master's programs actually expect at admission?

The universal expectation is fluent Python β€” not just familiarity, but the ability to write production-quality code in Python including data structures, object-oriented programming, file I/O, and use of scientific computing libraries. Beyond Python, programs differ by specialization: systems-focused programs (Carnegie Mellon MCDS, UCSD ECE) may expect C++ proficiency for performance-sensitive ML work. Research-track programs may expect R or MATLAB for statistical analysis. Data engineering tracks typically expect SQL. The minimum viable Python standard for entering an AI master's: you can implement a binary search tree, write a decorator, use generators, and structure a multi-file project without looking up syntax. More practically: you should be able to write a NumPy-based neural network forward pass from scratch and understand what each line is doing. If you cannot yet do this, the fastest path is: (1) Complete Python Data Science Handbook (Jake VanderPlas, free online) cover-to-cover β€” this covers NumPy, Pandas, Matplotlib, and Scikit-learn at the level most programs expect; (2) Implement 3–5 ML algorithms from scratch (linear regression, logistic regression, k-NN, k-means, a simple feedforward net) in NumPy, without using Scikit-learn. That implementation exercise is both the preparation and the diagnostic β€” if you get stuck on the neural network backward pass, you have found a gap worth closing before semester one.

Is calculus really that important for an AI master's program?

Multivariable calculus and basic calculus are genuinely essential β€” not because you will derive backpropagation by hand on exams (some programs do this, but most do not), but because understanding what gradient descent is doing requires understanding partial derivatives, the chain rule, and the concept of a gradient as a direction of steepest ascent. The specific calculus you need: derivatives (including product rule, chain rule, and rules for common functions); partial derivatives and gradients of multivariate functions; the concept of a Jacobian matrix and a Hessian; basic integration for probability density function calculations. What you do not need for most industry-track AI programs: advanced real analysis, measure theory, functional analysis. These become relevant for PhD-track or highly theoretical programs. The most efficient calculus review for AI purposes: 3Blue1Brown's Essence of Calculus series (11 videos, 2–3 hours) refreshes the geometric intuition quickly; then work through the Khan Academy multivariable calculus module (partial derivatives section specifically) to rebuild computation fluency. If you took calculus as an undergraduate and got through Calc III, your background is likely sufficient β€” review the chain rule and partial derivatives before your first ML course and you will be positioned well.

What if I'm missing prerequisites β€” can I still apply and get in?

Prerequisite gaps are common and manageable if you address them transparently and demonstrably. Most programs do not verify prerequisites at admission β€” they rely on self-disclosure through the statement of purpose and transcripts. However, showing up to a graduate ML course without solid linear algebra and probability is a recipe for a difficult first semester that can derail the entire program. The right strategy: (1) Identify your specific gaps using this checklist before you apply; (2) Take community college or MOOC courses to fill critical gaps before you start β€” not after; (3) Disclose gaps honestly in your SOP while documenting what you are doing to fill them (e.g., 'I am completing MIT 18.06 this summer before enrollment'); (4) For programs with explicit prerequisite lists, take the required courses as a non-degree student at the institution or a nearby community college and request an official transcript. A community college transcript in Calculus II or Linear Algebra satisfies most programs' formal prerequisite requirement. Udacity, Coursera, and edX certificates are generally viewed as supplementary β€” useful evidence of self-directed learning but not equivalent to a formal transcript for programs that require specific coursework on paper.

How long does it realistically take to fill math prerequisites for an AI master's?

The honest answer depends on your starting point. If you have a bachelor's in biology, economics, or psychology with some calculus but no linear algebra or CS background, plan for 6–12 months of serious preparation to be ready for a competitive AI master's program: calculus review (2–4 weeks if you took it before), linear algebra from scratch (6–8 weeks at 10 hours/week using MIT 18.06), probability and statistics (6–8 weeks using MIT 6.041 or equivalent), Python programming to production fluency (8–12 weeks with daily practice), algorithms and data structures basics (4–6 weeks). In total: a motivated non-CS undergraduate with basic calculus can reach readiness in 6–9 months of disciplined 10–15 hours/week study. If you have a BS in math or engineering with calculus and linear algebra but no CS background, you need 3–4 months focused entirely on Python, data structures, and basic algorithms. If you have a BS in CS with calculus but weak linear algebra or probability, 4–6 weeks targeted review of specifically the sections that matter for ML is often sufficient. The most common mistake: underestimating the gap and starting a competitive program underprepared. The most costly outcome: struggling through core courses, getting a Bβˆ’ in graduate ML theory, and finding this affects RA offers and PhD applications for the next five years.

Do online AI master's programs have lower prerequisite requirements than on-campus programs?

Some do, but this does not mean you should exploit the lower bar β€” it means the program trusts you to self-assess. Georgia Tech OMSCS, for example, does not formally verify prerequisites at admission but includes a 'Background Assessment' recommendation on its admissions page listing exactly the competencies expected. Students who enroll without those competencies often receive poor grades in core courses, which affects their program continuation and employer perception of the degree. UT Austin's MSAI similarly recommends but does not enforce specific math prerequisites. The practical implication: online programs with open or minimal prerequisite enforcement are accessible to candidates with gaps β€” but the gap penalty is paid in course performance, not in admission. For career switchers using an online program to transition into AI, this accessibility is genuinely valuable and the right strategy is to fill gaps before starting rather than hoping the program will accommodate them. Programs that do have meaningful online prerequisite gatekeeping include Northeastern Align (which builds prerequisites into the curriculum through bridge courses, adding a semester but solving the problem systematically) and Carnegie Mellon's distance ML program (which has strict prerequisite requirements regardless of delivery format).

What is the most important single thing to master before starting an AI master's program?

If forced to pick one: hands-on proficiency with NumPy and the ability to implement gradient descent from scratch in Python. This single skill synthesizes linear algebra (matrix operations), calculus (partial derivatives and gradients), and programming (Python vectorization) in a way that directly maps to every ML algorithm you will study. Here is the minimal viable check: open a Python notebook with only NumPy imported and implement the following from scratch without looking up code β€” a matrix class with forward and backward methods that does y = Wx + b for a batch of data points, computes mean squared error loss, and updates W and b via gradient descent with a specified learning rate. If you can do this clearly and explain each line, you have the foundation. If you struggle with the backward pass (computing βˆ‚L/βˆ‚W and βˆ‚L/βˆ‚b), that is the gap to close. This exercise also tests your Python fluency, NumPy broadcasting intuition, and mathematical reasoning simultaneously. Do not rely on Scikit-learn or PyTorch autograd for this exercise β€” implementing it manually is the diagnostic. Programs where this exercise is literally week-two coursework include UCSD CSE 151A, CMU 10-601, and MIT 6.036. If you cannot complete it before your first ML core course, you are starting at a deficit.

Next steps

Once your prerequisites are solid, use our tools to identify the right programs and compare options.

All Research & Reports β†’Financial Aid Guide β†’International Admissions β†’Full Admissions Guide β†’