GATE 2022 : Computer Science Syllabus | Information Technology

Fully Revised GATE 2022 Computer Science | Information Technology CS-IT Syllabus

Engineering Mathematics

1. Discrete Mathematics: Propositional and first order logic. Monoids, Groups.

Graphs: connectivity, matching, coloring. Sets, relations, functions, partial orders and lattices.

Combinatorics: counting,

recurrence relations, generating functions.

2. Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU decomposition.

3.Calculus: Maxima and minima. Limits, continuity, and differentiability. 

Integration. Mean value theorem.

4.Probability and Statistics: Random variables. Conditional probability and Bayes theorem. Uniform,

normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation.

Computer Science

Digital Logic

Boolean algebra. Minimization. Number representations and computer arithmetic (fixed and floating

point). Combinational and sequential circuits.

Computer Organisation and Architecture

Machine instructions and addressing modes Memory hierarchy: cache, main memory and secondary

storage; I/O interface (interrupt and DMA mode). ALU, data‐path and control unit. Instruction

pipelining, pipeline hazards.

Programming and Data Structures

Programming in C. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.

Recursion.

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.

Theory of Computation

Regular expressions and finite automata. Regular and context- free languages, pumping lemma. Context-

free grammars and push-down automata. Turning machines and undecidability.

Compiler Design

Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code

generation. Local optimization, Data flow analyses: constant propagation, liveness analysis, common

subexpression elimination.

Operating System

System calls, processes, threads, inter‐process communication, concurrency and synchronization.

Deadlock. File systems. CPU and I/O scheduling. Memory management and virtual memory.

Databases

ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal

forms. Transactions and concurrency control. File organization, indexing (e.g., B and B+ trees).

Computer Networks

Concept of layering: OSI and 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.

~Beat Yourself.

Source : IIT Kharagpur