Skip to content
GATEiit

GATE DA syllabus 2027

The Data Science and Artificial Intelligence syllabus, organised by subject. Based on the official GATE 2026 syllabus; we will update it if the 2027 syllabus changes.

Marks distribution

Marks distribution
PartMarks
General Aptitude15
Data Science & AI subjects85
Total100

Topic-wise weightage from previous year papers will appear here as PYQs are added.

Counting, probability, random variables, standard distributions and hypothesis testing.

  • Counting: permutations and combinations
  • Probability axioms, sample space, events, independent and 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 and binomial distributions
  • Continuous random variables and probability distribution functions
  • Uniform, exponential, Poisson, normal, standard normal, t- and chi-squared distributions
  • Cumulative distribution function; conditional PDF
  • Central limit theorem
  • Confidence intervals; z-test, t-test and chi-squared test

Vector spaces, special matrices, linear systems, eigenvalues and matrix decompositions.

  • Vector spaces and subspaces; linear dependence and independence of vectors
  • Matrices: projection, orthogonal, idempotent and partition matrices and their properties
  • Quadratic forms
  • Systems of linear equations and their solutions; Gaussian elimination
  • Eigenvalues and eigenvectors
  • Determinant, rank and nullity; projections
  • LU decomposition and singular value decomposition (SVD)

Single-variable calculus and optimization.

  • Functions of a single variable
  • Limit, continuity and differentiability
  • Taylor series
  • Maxima and minima
  • Optimization involving a single variable

Programming, Data Structures and Algorithms

Programming, Data Structures and Algorithms in detail →

Python programming, core data structures, searching, sorting and graph algorithms.

  • Programming in Python
  • Basic data structures: stacks, queues, linked lists, trees and hash tables
  • Search algorithms: linear search and binary search
  • Basic sorting algorithms: selection sort, bubble sort and insertion sort
  • Divide and conquer: merge sort and quicksort
  • Introduction to graph theory
  • Basic graph algorithms: traversals and shortest path

Database Management and Warehousing

Database Management and Warehousing in detail →

Relational databases, SQL, normalization, data preparation and data warehouse modelling.

  • ER model
  • Relational model: relational algebra, tuple calculus and SQL
  • Integrity constraints and normal forms
  • File organization and indexing
  • Data types; data transformation: normalization, discretization, sampling and compression
  • Data warehouse modelling: schemas for multidimensional data models
  • Concept hierarchies; measures: categorization and computations

Supervised learning, model validation, neural networks, clustering and PCA.

Supervised learning

  • Regression and classification problems
  • Simple linear regression, multiple linear regression and ridge regression
  • Logistic regression
  • k-nearest neighbour and naive Bayes classifier
  • Linear discriminant analysis
  • Support vector machine
  • Decision trees
  • Bias–variance trade-off
  • Cross-validation: leave-one-out (LOO) and k-fold
  • Multi-layer perceptron and feed-forward neural networks

Unsupervised learning

  • Clustering algorithms: k-means and k-medoid
  • Hierarchical clustering: top-down and bottom-up; single-linkage and multiple-linkage
  • Dimensionality reduction: principal component analysis (PCA)

Search, logic and reasoning under uncertainty.

  • Search: informed, uninformed and adversarial
  • Logic: propositional and predicate
  • Reasoning under uncertainty: conditional independence representation
  • Exact inference through variable elimination
  • Approximate inference through sampling

General Aptitude (common to all papers)

Common to every GATE paper and worth 15 marks: verbal, quantitative, analytical and spatial aptitude.

Verbal Aptitude

  • Basic English grammar: tenses, articles, adjectives, prepositions, conjunctions, verb–noun agreement and other parts of speech
  • Basic vocabulary: words, idioms and phrases in context
  • Reading and comprehension
  • Narrative sequencing

Quantitative Aptitude

  • Data interpretation: bar graphs, pie charts and other graphs, 2- and 3-dimensional plots, maps and tables
  • Numerical computation and estimation: ratios, percentages, powers, exponents and logarithms, permutations and combinations, and series
  • Mensuration and geometry
  • Elementary statistics and probability

Analytical Aptitude

  • Logic: deduction and induction
  • Analogy
  • Numerical relations and reasoning

Spatial Aptitude

  • Transformation of shapes: translation, rotation, scaling, mirroring, assembling and grouping
  • Paper folding, cutting and patterns in 2 and 3 dimensions