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, coloring. 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.
Computer Science and Information Technology
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/O interface
(interrupt and DMA mode).
Section 4: Programming and Data Structures
Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary
heaps, graphs.
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 contex-free languages, pumping lemma. Turing machines and undecidability.
Section 7: 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.
Section 8: Operating System
System calls, processes, threads, inter-process communication, concurrency and synchronization.
Deadlock. CPU and I/O 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 (e.g., B and B+ trees). Transactions and concurrency control.
Section 10: Computer Networks
Concept of layering: OSI and TCP/IP Protocol Stacks; Basics of packet, circuit and virtual circuitswitching; 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.
++++++++++++++++++++
CS/IT Candidates should focus on the following topics while preparing for the GATE exam:
General Aptitude (GA): This section is common for all branches of engineering and covers topics such as verbal ability, numerical ability, and reasoning ability.
Engineering Mathematics: This section covers topics such as calculus, differential equations, linear algebra, probability, and statistics.
Core Subject:
- Programming and Data Structures: Candidates should have a strong understanding of programming concepts and data structures and should practice solving problems from previous year question papers and reference books.
- Computer Organization and Architecture: Candidates should have a good understanding of digital logic and processor design and should practice solving problems related to memory hierarchy, I/O systems, and cache memory.
- Theory of Computation: Candidates should have a good understanding of automata theory and should practice solving problems related to regular expressions, context-free grammars, Turing machines, and undecidability.
- Compiler Design: Candidates should have a good understanding of compiler design and should practice solving problems related to lexical analysis, parsing, syntax-directed translation, runtime environments, and code generation.
- Operating System: Candidates should have a good understanding of process management, memory management, file systems, and protection and security and should practice solving problems related to these topics.
- Databases: Candidates should have a good understanding of ER diagrams, relational algebra, normalization, transaction management, and indexing and should practice solving problems related to these topics.
- Computer Networks: Candidates should have a good understanding of the OSI model, TCP/IP protocol suite, network devices, routing algorithms, and congestion control and should practice solving problems related to these topics.
Apart from the above topics, candidates should also focus on time management and practice solving problems within the given time frame. Regular practice, revision, and mock tests are essential for success in the GATE exam.
Candidates can refer to the official GATE website for the detailed syllabus and exam pattern for CS/IT. It is recommended that candidates follow the syllabus provided by the GATE authorities and study only the relevant topics to avoid wasting time on unnecessary topics.