This page has the official GATE 2027 syllabus for Data Science and Artificial Intelligence (DA). IIT Madras, the organising institute for GATE 2027, published it. The topic list is copied exactly from the official DA syllabus PDF; we haven’t added or removed any topics.
The DA syllabus has 7 sections: Probability and Statistics; Linear Algebra; Calculus and Optimization; Programming, Data Structures and Algorithms; Database Management and Warehousing; Machine Learning; AI. Every paper also has a General Aptitude section; see the GA syllabus.
GATE 2027 DA at a glance
| Item | Detail |
|---|---|
| Paper code | DA |
| Organising institute | IIT Madras |
| Questions | 65: 10 General Aptitude + 55 subject |
| Marks | 100: General Aptitude 15, subject 85 |
| Duration | 3 hours |
| Exam dates (all papers) | 6, 7, 13, 14, 20 and 21 February 2027 |
| Allowed second paper | CS, EC, EE, MA, ME, PH, RA, ST, XE |
Marks and question counts are from the GATE 2027 brochure. See the exam pattern for the marking scheme and negative marking.
GATE 2027 DA syllabus
Section 1: Probability and Statistics
Counting (permutation and combinations), probability axioms, Sample space, events, independent events, mutually exclusive events, marginal, conditional and joint probability, Bayes Theorem, conditional expectation and variance, mean, median, mode and standard deviation, correlation, and covariance, random variables, discrete random variables and probability mass functions, uniform, Bernoulli, binomial distribution, Continuous random variables and probability distribution function, uniform, exponential, Poisson, normal, standard normal, t-distribution, chi-squared distributions, cumulative distribution function, Conditional PDF, Central limit theorem, confidence interval, z-test, t-test, chi-squared test.
Section 2: Linear Algebra
Vector space, subspaces, linear dependence and independence of vectors, matrices, projection matrix, orthogonal matrix, idempotent matrix, partition matrix and their properties, quadratic forms, systems of linear equations and solutions; Gaussian elimination, eigenvalues and eigenvectors, determinant, rank, nullity, projections, LU decomposition, singular value decomposition.
Section 3: Calculus and Optimization
Functions of a single variable, limit, continuity and differentiability, Taylor series, maxima and minima, optimization involving a single variable.
Section 4: Programming, Data Structures and Algorithms
Programming in Python, basic data structures: stacks, queues, linked lists, trees, hash tables; Search algorithms: linear search and binary search, basic sorting algorithms: selection sort, bubble sort and insertion sort; divide and conquer: mergesort, quicksort; introduction to graph theory; basic graph algorithms: traversals and shortest path.
Section 5: Database Management and Warehousing
ER-model, relational model: relational algebra, tuple calculus, SQL, integrity constraints, normal form, file organization, indexing, data types, data transformation such as normalization, discretization, sampling, compression; data warehouse modelling: schema for multidimensional data models, concept hierarchies, measures: categorization and computations.
Section 6: Machine Learning
Supervised Learning: regression and classification problems, simple linear regression, multiple linear regression, ridge regression, logistic regression, k-nearest neighbour, naive Bayes classifier, linear discriminant analysis, support vector machine, decision trees, bias-variance trade-off, cross-validation methods such as leave-one-out (LOO) cross-validation, k-folds cross-validation, multi-layer perceptron, feed-forward neural network;
Unsupervised Learning: clustering algorithms, k-means/k-medoid, hierarchical clustering, top-down, bottom-up: single-linkage, multiple-linkage, dimensionality reduction, principal component analysis.
Section 7: AI
Search: informed, uninformed, adversarial; logic, propositional, predicate; reasoning under uncertainty topics — conditional independence representation, exact inference through variable elimination, and approximate inference through sampling.
Official source:
How to use this syllabus
These are our suggestions, not official GATE rules.
- Track the syllabus topic by topic. Mark each topic as done, weak or not started, and come back to the weak ones every few weeks.
- Use previous years’ papers carefully. They are good practice, but they were set on earlier syllabi. Check each question’s topic against the GATE 2027 list on this page.
- Don’t skip General Aptitude. It is worth 15 marks in every paper, and the syllabus is short. See the GA syllabus.
Related: