Do you know who prepares the syllabus for the GATE examination? The GATE syllabus is decided by the examination conducting body. Each year, one of the eight examination conducting bodies (7 IITs and IISc Bangalore) finalises the syllabus. In 2024, the conducting authority of the GATE examination is IISc Bangalore. The syllabus covers a total of ten sections, including Computer Science Engineering (8 topics), Engineering Mathematics, and General Aptitude, which will be released by them soon. Since the GATE Syllabus for CSE 2024 is not declared officially, take a look at the previous year’s syllabus and develop a basic idea of it.
Every year, the examination will be conducted for 29 disciplines, and they are listed below:
- Aerospace Engineering (AE)
- Agricultural Engineering (AG)
- Architecture and Planning (AR)
- Biotechnology (BT)
- Civil Engineering (CE)
- Chemical Engineering (CH)
- Computer Science Engineering (CSE)
- Chemistry (CY)
- Electronics and Communication Engineering (ECE)
- Electrical Engineering (EE)
- Ecology and Evolution (EY)
- Geology and Geophysics (GG)
- Instrumentation Engineering (IN)
- Mathematics (MA)
- Mechanical Engineering (ME)
- Mining Engineering (MN)
- Metallurgical Engineering (MT)
- Petroleum Engineering (PE)
- Physics (PH)
- Production and Industrial Engineering (PI)
- Textile Engineering and Fibre Science (TF)
- Statistics (ST)
- Biomedical Engineering (BM)
- Engineering Sciences (XE)
- Life Sciences (XL)
- Humanities and Social Sciences (XH)
- Environmental Science and Engineering (ES)
- Geomatics Engineering (GE)
- Naval Architecture and Marine Engineering (NM)
Branch-wise GATE Syllabus PDFs, based on the discipline, will be released, and candidates can download them by visiting the official website. The information provided in this article will help them develop a better understanding of the GATE Syllabus for CSE. Candidates have to make sure that every topic included in the Computer Science Engineering (CSE) syllabus is covered well in advance of the GATE examination. With a proper study plan, candidates can effectively cover the GATE CSE syllabus and obtain a good percentile.
GATE Computer Science Syllabus 2023
In the GATE 2023 syllabus for CSE, the topics were mainly split into ten sections: Engineering Mathematics, Digital Logic, Computer Organisation and Architecture, Programming and Data Structures, Algorithms, Theory of Computation, Compiler Design, Operating Systems, Databases, and Computer Networks. Go through the following table to grasp a better idea about these topics.
| Section | Topics |
| 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: 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. Minimisation. Number representations and computer arithmetic (fixed and floating point). |
| Section 3: Computer Organisation 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 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 subexpression elimination. |
| Section 8: Operating System | ● System calls, processes, threads, inter-process communication, concurrency and synchronisation. 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 organisation, 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 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. |
To figure out if there’s any change in the topics added to the GATE syllabus for CSE, candidates can visit the official website. Visiting the official website will also help them stay updated with the information related to the GATE syllabus, important dates, exam pattern, GATE results, etc. For more information related to the GATE examination, visit BYJU’S website.
