Section 1: Engineering Mathematics
Section 1: Engineering Mathematics
Section 1: Engineering Mathematics
Discrete Mathematics: Propositional and first order logic. Sets, relations, functions,
partial orders and lattices. Groups. Graphs: connectivity, matching, coloring.
Combinatorics: counting, recurrence relations, generating functions.
Calculus: Limits, continuity and differentiability. Maxima and minima. Mean value
theorem. Integration.
Section 5: Algorithms
Searching, sorting, hashing. Asymptotic worst case time and space complexity.
Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer.
Graph search, minimum spanning trees, shortest paths.
Section 6: Theory of Computation
Regular expressions and finite automata. Context-free grammars and push-down
automata. Regular and contex-free languages, pumping lemma. Turing machines and
undecidability.
GATE 2020 Syllabus for Computer Science and Information Technology Section 9
Section 9: Databases
ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity
constraints, normal forms. File organization, indexing (e.g., B and B+ trees).
Transactions and concurrency control.
GATE 2020 Syllabus for Computer Science and Information Technology Section 10