GATE DA 2027: syllabus and marking scheme
Data Science and Artificial Intelligence (paper code DA)
The official GATE 2027 syllabus, paper DA (IIT Madras) lists 7 syllabus lines in 7 sections, shown below in the exact official wording. The exam lasts 3 hours. Multiple choice: a wrong answer costs 1/3 of the marks of that question; an unanswered question scores 0.
Pattern and marking
| Section | Questions | Type | Marking |
|---|---|---|---|
| General Aptitude (1 mark) | 5 | Multiple choice, multiple select and numerical answer | Wrong multiple choice: minus one-third of the marks; none for multiple select or numerical; no partial marks |
| General Aptitude (2 marks) | 5 | Multiple choice, multiple select and numerical answer | Wrong multiple choice: minus one-third of the marks; none for multiple select or numerical; no partial marks |
| Subject including Engineering Mathematics where present (1 mark) | 25 | Multiple choice, multiple select and numerical answer | Wrong multiple choice: minus one-third of the marks; none for multiple select or numerical; no partial marks |
| Subject including Engineering Mathematics where present (2 marks) | 30 | Multiple choice, multiple select and numerical answer | Wrong multiple choice: minus one-third of the marks; none for multiple select or numerical; no partial marks |
More verified facts
- Duration: 3 hours (180 minutes).
- Total marks: 100.
- Language of the paper: English.
- Calculator: on-screen virtual scientific calculator; physical calculators are prohibited in the hall.
- Numerical answers: on-screen virtual numeric keypad for NAT answers (the computer keyboard is disabled); the answer is a signed real number, an integer or with up to three decimals, and the question states the decimal places required; no options are shown.
- Multiple choice: a wrong answer costs 1/3 of the marks of that question; an unanswered question scores 0.
- Multiple select: no negative marking and no partial marks.
- Numerical answer type: no negative marking.
Pattern source: GATE 2027 Information Brochure, revised version dated 17 October 2026 (IIT Madras) (official document). Last checked 2026-11-21. Every pattern fact above cites a section of that document in our data. The split of the subject questions into 25 one-mark and 30 two-mark questions is worked out from the stated totals (55 questions carrying 85 marks), not quoted.
Official syllabus lines (2027)
Copied from GATE 2027 syllabus, paper DA (IIT Madras), read on 2026-11-20. Each line is shown unchanged.
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.
What is next
Question pages, topic notes and practice sets for this exam are being prepared on the same syllabus graph as JEE Main. Until a question has passed our checks it is not shown as verified.