∑GATE DA Atlas

Artificial Intelligence

Search — uninformed (BFS, DFS, uniform-cost, iterative deepening), informed (greedy best-first, A*, heuristics) and adversarial (minimax, alpha–beta); logic — propositional and predicate (first-order) logic, inference and resolution; and reasoning under uncertainty — conditional independence and Bayesian networks, exact inference by variable elimination, and approximate inference by sampling.

8 topics75 practice questions≈ 3–11 marksPractise this section →

The AI section covers three classical pillars: search (how an agent finds a sequence of actions), logic (how it represents and reasons with certain knowledge) and probabilistic reasoning (how it reasons with uncertain knowledge). Third-party analyses put it at about 11 marks in 2024 and only 3 in 2025, so the weight varies — but the questions are usually quick marks if you can trace an algorithm by hand.

What the syllabus lists: search — informed, uninformed, adversarial; logic — propositional, predicate; reasoning under uncertainty — conditional independence representation, exact inference through variable elimination, and approximate inference through sampling.

Topics

Read in order — later topics build on earlier ones
01Problem Solving by Search — Uninformed StrategiesFormulating problems as state-space search (states, actions, transition model, goal test, path cost), tree search vs graph search, measuring strategies by completeness, optimality, time and space, and the uninformed strategies — breadth-first, uniform-cost, depth-first, depth-limited, iterative deepening and bidirectional search — traced on an example graph.0/9 solved02Informed (Heuristic) Search — Greedy Best-First and A*Heuristic functions and evaluation functions, greedy best-first search, A* search with f = g + h traced step by step, admissible and consistent heuristics and why they guarantee optimality, dominance and designing heuristics from relaxed problems (8-puzzle examples), memory-bounded variants (IDA*, weighted A*), and local search in brief.0/9 solved03Adversarial Search — Minimax, Alpha–Beta Pruning and ExpectimaxGames as search problems (deterministic, zero-sum, perfect information), game trees and the minimax algorithm, alpha–beta pruning traced step by step with the effect of move ordering, depth-limited search with evaluation functions, expectimax for games of chance, and a glimpse of Monte Carlo tree search.0/9 solved04Propositional LogicSyntax and semantics of propositional logic, truth tables, validity, satisfiability and entailment, the key logical equivalences, converting to CNF, sound inference rules (modus ponens, modus tollens, resolution), proof by resolution refutation, Horn clauses with forward and backward chaining, and knowledge-based agents.0/10 solved05Predicate (First-Order) LogicWhy propositional logic is not enough, the syntax of first-order logic (constants, variables, predicates, functions, quantifiers), semantics over a domain, translating English sentences (and the classic ∀/→ and ∃/∧ pattern), quantifier negation and ordering, valid equivalences, prenex form and Skolemisation, unification and the most general unifier, and first-order resolution and chaining.0/9 solved06Conditional Independence and Bayesian NetworksRepresenting uncertainty with full joint distributions and why they don't scale, independence and conditional independence, Bayesian networks (DAG + CPTs) and the chain-rule factorisation, parameter counting, the three connection types (chain, fork, collider) and explaining away, d-separation, Markov blankets, and computing joint, marginal and conditional probabilities from a network.0/9 solved07Exact Inference — Variable EliminationAnswering posterior queries in a Bayesian network exactly with inference by enumeration and normalisation, then variable elimination with factors, pointwise products and summing out, the effect of elimination order on factor size, pruning irrelevant variables, and the complexity of exact inference (linear on polytrees, NP-hard in general).0/10 solved08Approximate Inference — SamplingMonte Carlo estimation of posteriors in Bayesian networks — prior (direct) sampling, rejection sampling and its waste when evidence is unlikely, likelihood weighting with sample weights, and Markov chain Monte Carlo with Gibbs sampling over Markov blankets — plus consistency, error rates and when to use which method.0/10 solved