Section 10 chapters · 122 of 122 lessons
GATE DA
An exam-first track for GATE Data Science & Artificial Intelligence. Ten roadmaps across the full syllabus — Probability & Statistics, Linear Algebra, Calculus, Python & Algorithms, Databases & Warehousing, Machine Learning, AI, and General Aptitude — each taught from first principles to exactly the depth GATE asks, drilled with real previous-year questions, NAT practice, and full mock tests.
0 / 122 lessons
The GATE DA journey 0 / 122 completed
- Chapter 01
Orientation
1 lesson - 01 How GATE DA Works Everything you need to know about the paper before you start studying: structure, marking, weightage, and a study plan that starts where the marks are.
- Chapter 02
Probability & Statistics
16 lessons - 02 Counting: Permutations & Combinations Permutations count ordered arrangements; combinations count unordered selections. Both feed straight into binomial probability — and the GA section.
- 03 Mean, Median, Mode & z-scores Summarise a dataset in a few numbers: centre with mean/median/mode, spread with variance, and standardise with the z-score that ML preprocessing relies on.
- 04 Sample Space, Events & Axioms Probability is built on three short rules. Get the axioms and inclusion-exclusion right and every later probability question rests on solid ground.
- 05 Independent vs Mutually Exclusive Two ideas GATE deliberately confuses. Mutually exclusive events can't co-occur; independent events don't inform each other — and they're almost never the same thing.
- 06 Conditional & Total Probability P(A given B) rescales probability to the world where B happened. The law of total probability stitches those pieces back together — and sets up Bayes.
- 07 Bayes' Theorem Flip a conditional probability around: from P(evidence given cause) to P(cause given evidence). The single most-tested idea in GATE DA probability.
- 08 Random Variables, PMF & CDF A random variable turns outcomes into numbers; the PMF lists their probabilities and the CDF accumulates them. The shared language of every distribution that follows.
- 09 Expectation, Variance & SD Expectation is the long-run average of a random variable; variance and SD measure how far it spreads. The summary numbers every distribution and ML lesson leans on.
- 10 Uniform, Bernoulli & Binomial The three workhorse discrete distributions: equally-likely outcomes, a single yes/no trial, and the count of successes in n independent trials.
- 11 Continuous RVs: PDF, CDF & Uniform When outcomes form a continuum, probability lives in areas under a density curve — not in single points. The gateway to every continuous distribution GATE tests.
- 12 Exponential & Poisson Two distributions that always travel together: the exponential times the wait until an event, the Poisson counts how many events land. Both lean on one number, lambda.
- 13 Normal & Standard Normal The bell curve and its standardized twin. Standardize with z, read a Phi table, and the 68-95-99.7 rule does the rest — the workhorse behind the CLT and z-tests.
- 14 Joint, Marginal & Conditional Distributions How two random variables live in one table: read off a marginal by summing out the other, a conditional by re-normalising a slice, and chain them with the law of total expectation.
- 15 Covariance, Correlation & Total Expectation Covariance measures how two variables move together; correlation rescales it into [−1, 1]. Independence forces both to zero — but zero covariance does not buy back independence.
- 16 Central Limit Theorem & Confidence Intervals Average enough independent samples and the result is Normal — whatever the original shape. That single fact powers GATE's NAT questions on sums, proportions, and confidence intervals.
- 17 z-test, t-test & chi-squared test A hypothesis test is a courtroom for data: assume the null, measure how surprising the evidence is, decide. GATE tests recognition — which test fits which situation.
- Chapter 03
Linear Algebra
16 lessons - 18 Vectors, Matrices & Special Forms Vectors and matrices, the operations on them, and the special shapes — identity, diagonal, symmetric, triangular — that GATE DA leans on everywhere.
- 19 Vector Spaces & Subspaces A subspace must contain the origin and stay closed under addition and scaling. GATE's favourite trick: a set with squared terms looks linear but fails closure.
- 20 Independence, Span, Basis & Dimension Linear independence, span, basis and dimension in one pass — plus why orthonormal sets are automatically independent and why a space has many valid bases, not one.
- 21 Systems of Equations & Gaussian Elimination Solve a linear system Ax = b by reducing the augmented matrix to row-echelon form, then classify it as having one solution, infinitely many, or none.
- 22 Rank, Nullity & Solution Sets Rank counts independent rows; nullity counts the free directions. Their sum equals the number of columns — and that single identity classifies every solution set.
- 23 Determinants & Their Properties A single number that tells you whether a matrix is invertible, how it scales area or volume, and whether its rows are linearly dependent.
- 24 Inverse & Invertibility When a matrix can be undone: the 2x2 inverse formula and the chain of equivalent conditions that all decide whether an inverse exists.
- 25 Eigenvalues & Eigenvectors Some directions a matrix only stretches: those are eigenvectors, and the stretch factors are eigenvalues. The backbone of GATE Linear Algebra.
- 26 Eigen-properties & Transforms Once you know an eigenvalue, you know it for A², A⁻¹, and A + cI for free. Plus the symmetric and triangular facts GATE asks as 'which is always true'.
- 27 Orthogonality & Orthogonal Matrices Orthogonal matrices have orthonormal columns, so Q transpose times Q equals the identity. They preserve length and angle, have determinant plus or minus one, and eigenvalues on the unit circle.
- 28 Projections & Idempotent Matrices A projection matrix maps every vector onto a subspace and fixes vectors already in it, so applying it twice changes nothing: P squared = P. This idempotence underlies PCA's centering matrix.
- 29 Quadratic Forms & Definiteness A quadratic form x transpose A x measures a matrix's curvature. Its sign is set by the eigenvalues, and its extreme values on the unit sphere are the largest and smallest eigenvalues — the heart of PCA.
- 30 LU Decomposition Factor A = L·U into a lower- and an upper-triangular matrix — it is Gaussian elimination remembered, and it makes solving Ax = b for many right-hand sides cheap.
- 31 Partition (Block) Matrices Split a matrix into blocks and multiply block-wise as if the blocks were scalars; for block-diagonal or block-triangular matrices the determinant is the product of the diagonal blocks' determinants.
- 32 Singular Value Decomposition Every matrix factors as A = UΣVᵀ with orthogonal U, V and non-negative singular values on Σ; the singular values are the square roots of the eigenvalues of AᵀA.
- 33 Always-True Synthesis Drills Consolidate the linear-algebra web of equivalences for a square matrix and drill the GATE 'which statements are always true' MSQ format, checking every edge case.
- Chapter 04
Calculus & Optimization
13 lessons - 34 Functions of One Variable Domain, range, and the handful of standard function shapes you must recognise on sight — the foundation the whole Calculus block stands on.
- 35 Limits & One-Sided Limits What a limit really means — the value a function heads toward — plus left vs right limits, limits at infinity, and why a limit can exist where the function isn't even defined.
- 36 Limit Techniques The toolkit for actually evaluating limits — factoring, conjugate rationalising, standard limits, and Taylor expansion — drilled on real GATE DA NATs from 2024 and 2025.
- 37 L'Hopital's Rule A shortcut for limits stuck at 0/0 or ∞/∞: differentiate top and bottom separately and try again. A reliable source of GATE DA limit marks.
- 38 Continuity A function is continuous at a point when its limit there exists and equals the function value — no jump, no hole, no asymptote. A recurring GATE DA piecewise question.
- 39 Differentiability A function is differentiable where it has a unique tangent slope. Differentiable implies continuous — but NOT the reverse, as ReLU and |x| show at their corner.
- 40 Product, Quotient & Chain Rule The three rules that turn any combination of standard functions into its derivative: product, quotient, and chain. The everyday workhorse of GATE Calculus.
- 41 Taylor & Maclaurin Series Rewrite a smooth function as an infinite polynomial: its Taylor series. The coefficients carry the derivatives, and GATE asks you to read one off.
- 42 Critical Points & Monotonicity Where a curve flattens out: f'(x) = 0 marks the candidates for peaks and valleys, and the sign of f' tells you where the function climbs or falls.
- 43 Maxima, Minima & the 2nd-Derivative Test Once you have a critical point, the second derivative tells you its type: concave up is a valley, concave down is a peak. The single most-tested calculus idea in GATE DA.
- 44 Optimization on a Closed Interval To find the global max and min of a continuous function on a closed interval, compare every critical point against both endpoints — the endpoints are the part everyone forgets.
- 45 Convexity & Single-Variable Optimization A convex function is bowl-shaped: f''(x) ≥ 0 everywhere. The payoff — any local minimum is automatically global, and a strict bowl has at most one minimizer.
- 46 Lipschitz & One-Insight Problems Some GATE calculus problems look brutal but turn on a single idea. The signature one: a squared bound |f(x) − f(y)| ≤ C(x − y)² secretly forces f to be constant.
- Chapter 05
Programming, Data Structures & Algorithms
15 lessons - 47 Python for GATE: Types & Slicing GATE DA programming is in Python, and the signature question is predict the output. Master types, division, and slicing first.
- 48 Lists, Tuples, Dicts, Sets & Gotchas The four built-in collections and the gotchas GATE loves: append vs extend vs +, and aliasing vs copying a list.
- 49 Functions, Scope & the Mutable-Default Trap Define functions, pass default arguments, and understand local vs global scope — plus the mutable-default trap GATE tests directly.
- 50 Recursion & Tracing A function that calls itself on a smaller input until a base case fires. The GATE DA skill is tracing the call tree and counting calls — including over dict-encoded trees.
- 51 Reading Pseudocode & Predicting Output GATE writes some algorithm questions in language-neutral pseudocode. The skill is patient, table-driven tracing — and watching the index base.
- 52 Big-O: Best, Average & Worst Case Big-O is the growth rate of work as input grows — drop constants, keep the dominant term. Reading loop nests and simple recurrences underlies every GATE algorithm question.
- 53 Linear & Binary Search Scan left-to-right in O(n), or halve a sorted range in O(log n) — and count the comparisons the way GATE does.
- 54 Bubble, Insertion & Selection Sort The three quadratic sorts GATE traces pass-by-pass — bubble bubbles, selection picks the min, insertion grows a sorted prefix. Know their passes, stability, and Big-O cold.
- 55 Merge Sort & Quicksort Two divide-and-conquer sorts: mergesort is always Θ(n log n) and stable; quicksort averages Θ(n log n) but degrades to Θ(n²) on the wrong input.
- 56 Stacks, Queues & Deques Three order-defined containers: a stack is LIFO, a queue is FIFO, a deque is both. The exam skill is tracing the contents after a sequence of operations.
- 57 Linked Lists Nodes chained by pointers, not laid out in contiguous memory: O(1) insert and delete at a known node, but O(n) access — the mirror image of an array's trade-off.
- 58 Hash Tables & Linear Probing A hash function turns a key into a slot for ~O(1) lookup; when slots collide, linear probing walks to the next free one. The open-addressing idea GATE keeps testing.
- 59 Trees, Traversals & Reconstruction How a binary tree is walked four canonical ways — pre, in, post, and level-order — and why inorder plus one other order rebuilds the tree but preorder + postorder does not.
- 60 Graph Theory & Representations A graph is just vertices joined by edges. Learn the vocabulary, the handshake fact, and the two ways to store a graph — the bedrock for every BFS/DFS question.
- 61 BFS, DFS, Topological Sort & Shortest Path BFS spreads level by level, DFS plunges deep, topological sort linearises a DAG, and Dijkstra handles weights. The four traversals GATE keeps asking about.
- Chapter 06
Database Management & Warehousing
15 lessons - 62 The Relational Model A relation is just a table — rows are tuples, columns are attributes. Get this vocabulary right and the rest of the DBMS block falls into place.
- 63 ER Model & Mapping to Relations Draw the world as boxes, diamonds, and lines — then turn that picture into tables. The two skills GATE tests over and over in database design.
- 64 Keys & Integrity Constraints Keys are how a table guarantees 'this row, not that one' — and how tables link to each other without lying. Super, candidate, primary, foreign: pick them apart once and it sticks.
- 65 Relational Algebra I Filter rows, pick columns, mix tables with set ops — the small toolkit that builds every SQL query underneath. The single most-tested DBMS sub-topic in GATE DA.
- 66 Joins & Division Joins stitch tables together on a shared key; division answers 'who has done every one of these?' — the two heavy-hitters of relational algebra.
- 67 Tuple Relational Calculus Instead of writing the recipe step by step, just describe the dish — TRC is the declarative twin of relational algebra, the same power in different clothes.
- 68 SQL: Computing Results by Hand Read a SQL query and predict its row count — the single skill GATE drills with the SELECT/JOIN/GROUP BY toolkit.
- 69 Functional Dependencies & Closure If two rows share an X-value, must they share a Y-value? That's a functional dependency — the rule that decides keys, normal forms, and half of GATE DA's DBMS marks.
- 70 Finding Candidate Keys from FDs Given a relation and its FDs, which combinations of attributes can uniquely identify a row? A short procedure does it every time — and GATE asks it almost every year.
- 71 Normal Forms: 1NF to BCNF Why does the same data design feel "clean" or "messy"? Normal forms give you four named bars to clear — and GATE asks the highest a relation satisfies almost every year.
- 72 Lossless-Join vs Dependency-Preservation Splitting a relation into two should not lose any rows when you join back — and should let you check every FD on the pieces. Two desirable properties, and they don't always come together.
- 73 File Organization & Indexing Heap vs sorted files, primary vs secondary indexes, hash vs B+-tree — the four choices behind every fast lookup, and the one GATE tests.
- 74 Normalization, Discretization, Sampling, Compression Get raw data ready for analysis — rescale it, bucket it, sample it, shrink it. Four small prep moves that make every downstream model behave.
- 75 Star vs Snowflake Schemas How a data warehouse organises facts and dimensions for fast analytics — and why one design has fewer joins but uses more storage.
- 76 Concept Hierarchies & Measures Roll up sales to the year, drill back down to the day, and learn which aggregates you can merge from sub-totals — and which need every raw row.
- Chapter 07
Machine Learning
20 lessons - 77 Supervised vs Unsupervised; Train/Test The two great families of machine learning, and the one discipline every experiment obeys: keep the test set unseen until the very end.
- 78 Simple Linear Regression Fit the best straight line through points by minimizing squared vertical errors — the least-squares solution you compute by hand. A 2025 NAT, step by step.
- 79 Multiple Linear Regression One line, many features. The normal equation w = (XᵀX)⁻¹Xᵀy solves it in closed form — a formula GATE wants you to apply to tiny matrices, not to derive.
- 80 Gradient Descent (One Step) The workhorse of model training, reduced to a single line: w ← w − η·(∂L/∂w). GATE asks you to perform exactly one update by hand.
- 81 Ridge Regression & Regularization Ordinary least squares can overfit. Ridge adds an L2 penalty that shrinks the weights, trading a little bias for a lot less variance.
- 82 The Bias-Variance Trade-off Total error splits into bias, variance, and irreducible noise. Reduce one and you usually raise the other — the conceptual backbone of the ML section.
- 83 Cross-Validation: k-fold, LOO, Stratified One train/test split is a coin flip. Cross-validation rotates the validation set so every sample is tested once — averaging out the luck.
- 84 Confusion Matrix, Precision, Recall, ROC Accuracy hides failure on imbalanced data. The confusion matrix splits errors into the two kinds that matter — and precision, recall, F1, and AUC read straight off it.
- 85 Logistic Regression Despite the name it is a classifier: a linear score wᵀx + b squashed by the sigmoid into a probability, trained with log-loss.
- 86 k-Nearest Neighbours A lazy learner with no training step: classify a point by the majority vote of its k closest neighbours, where k trades bias against variance.
- 87 Naive Bayes A classifier that applies Bayes' rule under one bold shortcut: features are conditionally independent given the class. Few parameters, fast, and a GATE DA regular.
- 88 Linear Discriminant Analysis A supervised projection that pulls classes apart: LDA maximises between-class separation relative to within-class scatter. Its GATE hook is the contrast with PCA.
- 89 Support Vector Machines Find the separating line with the widest margin. The margin is 2/‖w‖, only the support vectors define it, and kernels bend it into curves — all GATE-frequent.
- 90 Decision Trees: Entropy, Gini & Info Gain A decision tree splits data to drive down impurity. Entropy and Gini measure that impurity; information gain picks the split — a recurring GATE DA NAT.
- 91 Perceptron & the Update Rule The original neural unit: predict sign(wᵀx + b), then nudge the weights toward every misclassified point until the classes are separated.
- 92 Multi-Layer Perceptron & Activations An MLP stacks fully-connected layers with nonlinear activations. Counting its trainable parameters is a recurring GATE DA NAT — once with bias, once without.
- 93 Backpropagation (One Step) Backprop is the chain rule walked backward over a computation graph. GATE asks for one partial derivative through a small net — here is the exact recipe.
- 94 k-means & k-medoid Clustering Clustering by alternation: assign every point to its nearest centroid, then move each centroid to the mean of its points. Repeat. A recurring GATE DA NAT.
- 95 Hierarchical Clustering & Linkage Build clusters by merging: start with every point alone and repeatedly join the two closest. The linkage rule decides what closest means — single is min, complete is max.
- 96 PCA & Dimensionality Reduction Rotate to the axes of maximum variance: PCA reads off the eigenvectors of the covariance matrix as new orthogonal components, keeping the top few to shrink dimensions.
- Chapter 08
Artificial Intelligence
11 lessons - 97 Problem-Solving as Search Turn an AI puzzle into a search problem — states, actions, transitions, goal test, path cost — and watch the search tree unfold from the start state.
- 98 BFS, DFS, UCS & IDDFS Four uninformed search strategies — what they explore, when they're complete, what they cost in time and space, and why IDDFS re-expanding the root isn't wasteful.
- 99 Heuristics & Admissibility A heuristic h(n) estimates the cost from a node to the goal. Admissible means it never overestimates; consistent means it obeys the triangle inequality — and consistent implies admissible.
- 100 A* Search Add what a step actually cost to what the heuristic guesses is left, then always expand the smallest sum. That's A*.
- 101 Adversarial Search: Minimax Two perfect players, one game tree. MAX chases the largest value, MIN chases the smallest — back the values up and read the root.
- 102 Alpha-Beta Pruning Same minimax answer, fewer nodes touched. Track the best each side has guaranteed so far, and cut whole subtrees the parent will never pick.
- 103 Propositional Logic Truth tables, models, satisfiability, equivalence, and entailment — the algebra of true/false that GATE DA quietly tests every year.
- 104 First-Order & Predicate Logic Translate English into ∀ and ∃ without falling into the most common GATE trap — the ∀ uses ⇒, ∃ uses ∧ rule.
- 105 Bayesian Networks & Joint Factorization Draw who causes what as a DAG, attach a small probability table to each node, and the whole joint distribution falls out as a product. The compact picture GATE keeps asking about.
- 106 Exact Inference: Variable Elimination Want the exact posterior on a Bayes net? Multiply the CPTs together and sum out the variables you don't care about, one at a time. That's variable elimination.
- 107 Approximate Inference: Sampling When exact inference is too slow, draw a few thousand samples from the Bayes net and estimate the answer. Rejection, likelihood-weighting, and Gibbs — three classic recipes.
- Chapter 09
General Aptitude
7 lessons - 108 General Aptitude: The 15 Marks GA is 15 marks of cheap, reliable points on every GATE paper — same questions, same buckets, friendly to a few hours of prep. Don't skip it.
- 109 Verbal Ability Articles, prepositions, sentence correction, vocabulary in context, analogies — the four shapes every GA verbal question takes.
- 110 Reading Comprehension & Narrative A short passage, two or three questions, your answer must be supported by the text — not by what you already know.
- 111 Quantitative Aptitude Percentages, ratios, powers, simple algebra, basic geometry, time-speed-distance — the small toolkit that covers almost every GA quant question.
- 112 Data Interpretation Read the chart, then do the arithmetic. Most DI questions are just percentages, ratios, or differences hiding behind a bar or pie.
- 113 Analytical & Logical Reasoning Seating puzzles, blood relations, and syllogisms — the skill is drawing a diagram, not holding everything in your head.
- 114 Spatial Aptitude Rotate, reflect, fold, assemble. Track one distinguishing feature through the transformation — the rest falls into place.
- Chapter 10
The Exam Lab — PYQs & Mock Tests
8 lessons - 115 GATE DA 2024 — Solved Walkthrough A curated set of fully-worked GATE DA 2024 problems across every subject — see exactly how each concept turns into an exam question and its verified answer.
- 116 GATE DA 2025 — Solved Walkthrough A curated set of fully-worked GATE DA 2025 problems across every subject — see exactly how each concept turns into an exam question and its verified answer.
- 117 GATE DA 2026 — Solved Walkthrough A guided walk through representative solved problems from GATE DA 2026 — one per subject, each worked to its verified answer and linked to the lesson that teaches it.
- 118 PYQs by Topic Every verified previous-year GATE DA problem, regrouped by subject so you can drill one area at a time — each with its year, a one-line topic, the answer, and a link to the lesson that teaches it.
- 119 Timed Mock 1 (mixed) A timed, mixed mock under exam conditions — every subject, GATE negative marking, and a per-subject score breakdown at the end. The closest thing to the real thing.
- 120 Timed Mock 2 (mixed) A second timed, mixed mock under exam conditions — a fresh set of questions across every subject, GATE negative marking, and a per-subject score breakdown at the end.
- 121 Subject Mini-Mocks Short, timed, single-subject drills for the four heaviest GATE DA subjects — a 12-minute sprint each, with GATE negative marking and a score at the end.
- 122 Formula & Trap Revision Sheets One compact, scannable formula-and-trap sheet per subject — the night-before-the-exam reference where the Traps lines flag exactly where marks leak.
- End of section 0 / 122 complete
Make it stick — pass every quiz.
Each lesson has a short quiz at the bottom. Passing the quiz is what marks the lesson complete.
Section complete 122 / 122 lessonsNice work — you finished GATE DA.
Now lock it in — drill the Review & Mastery Checks and the full mock tests until you're exam-ready.
FAQCommon questions
GATE DA — frequently asked questions
Straight answers to the questions people ask most about gate da.
What is the GATE DA exam?
GATE DA (Data Science and Artificial Intelligence) is an Indian graduate-entrance exam, introduced in 2024, covering probability and statistics, linear algebra, calculus, programming and data structures, databases, machine learning, and AI. It tests conceptual understanding and problem-solving rather than rote memorisation.
What subjects does GATE DA cover?
The syllabus spans probability and statistics, linear algebra, calculus and optimization, programming and data structures, algorithms, database management, data warehousing, machine learning, and AI (search, logic, reasoning), plus the common General Aptitude section. Probability, linear algebra, and ML carry significant weight.
How should I prepare for GATE DA?
Build concepts first, then drill previous-year-style problems under timed conditions, and review with spaced retrieval so material sticks. Prioritise high-weight topics like probability, linear algebra, and ML, and practice General Aptitude, which is high-return for the time invested.
How is GATE DA different from a typical ML course?
GATE DA is exam-oriented — it rewards precise definitions, derivations, and fast, accurate problem-solving against the official syllabus, where an ML course is project-oriented. The concepts overlap heavily, but the exam demands speed and rigor on paper rather than building systems.
How accurate should my study answers be?
Always verify solutions against official answer keys and primary sources, since small differences in convention or rounding can change a multiple-choice answer. Reputable preparation material checks every previous-year answer against the official key for exactly this reason.