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.
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. 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 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.
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. Machine Learning: (i) 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; (ii) Unsupervised Learning: clustering algorithms, k-means/k-medoid, hierarchical clustering. top-down, bottom-up: single-linkage, multiple-linkage, dimensionality reduction, principal component analysis.
Al: Search: informed, uninformed, adversarial; logic, propositional, predicate; reasoning under uncertainty topics conditional independence representation, exact inference through variable elimination, and approximate inference through sampling. CS Computer Science and Information Technology
Section 1: Engineering Mathematics
Discrete Mathematics: Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Monoids, Groups. Graphs: connectivity. matching, colouring. Combinatorics: counting. recurrence relations, generating functions.
Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU decomposition.
Calculus: Limits, continuity and differentiability, Maxima and minima, Mean value theorem, Integration.
Probability and Statistics: Random variables, Uniform, normal, exponential, Poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.
Section 2: Digital Logic
Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).
Section 3: Computer Organization and Architecture
Machine instructions and addressing modes. ALU, data-path and control unit. Instruction pipelining. pipeline hazards. Memory hierarchy: cache, main memory and secondary storage; I/0 interface (interrupt and DMA mode).
Section 5: Algorithms Searching, sorting. hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide-and-conquer. Graph traversals, minimum spanning trees, shortest paths.
Section 6: Theory of Computation
Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages, pumping lemma. Turing machines and undecidability.
Section 7: Compiler Design
Lexical analysis, parsing. syntax-directed translation. Runtime environments. Intermediate code generation. Local optimisation, Data flow analyses: constant propagation, liveness analysis, common sub expression elimination.
Section 8: Operating System
System calls, processes, threads, inter-process communication, concurrency and synchronization. Deadlock. CPU and l/0 scheduling. Memory management and virtual memory. File systems.
Section 9: Databases ER-model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal forms. File organization, indexing le.g. Band B+ trees). Transactions and concurrency control.
GATE 2024, IISc. Bengaluru 51
Section 10: Computer Networks
Concept of layering: 0Sland TCP/IP Protocol Stacks; Basics of packet, circuit and virtual circuit-switching: Data link layer: framing, error detection, Medium Access Control, Ethernet bridging: Routing protocols: shortest path, flooding. distance vector and link state routing: Fragmentation and IP addressing. IPv4, CIDR notation, Basics of IP support protocols (ARP, DHCP. ICMP), Network Address Translation (NAT); Transport layer: flow control and congestion control, UDP. TCP, sockets; Application layer protocols: DNS, SMTP, HTTP, FTP. Email.
