In this article, you will get GATE 2024 Syllabus for Computer Science & Information Technology (CS). Given Below is the official GATE syllabus for Computer Science & Information Technology 2024 that has been released by IISC Bangalore. GATE syllabus for Computer Science & Information Technology is designed to assess candidates’ proficiency in various areas of computing and its applications.
It covers a wide range of topics, including Engineering Mathematics, Digital Logic, Computer Organization and Architecture, Programming and Data Structures, Algorithms, Theory of Computation, Compiler Design, Operating Systems, Databases, and Computer Networks.
The syllabus aims to evaluate not only theoretical knowledge but also practical problem-solving skills. Aspirants are expected to have a strong grasp of foundational concepts as well as advanced topics, which are crucial for pursuing higher studies or professional careers in the rapidly evolving field of computer science and information technology.
GATE Syllabus for Computer Science & Information Technology 2024-2025
| 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, 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: 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 optimisation, 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 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. |
Computer Science & Information Technology 2024 Paper Pattern and Marking
- Mode of Examination: Online
- Duration of Exam: 3 hours
- Types of Questions: MCQs, MSQs and NAT
- Sections: 3 sections – General Aptitude, Engineering Mathematics and Computer Science & Information Technology
- Total Marks: 100 marks
- Total Questions: 65 questions
- General Aptitude – 15 Marks of MCQs Questions
- 5 Questions – 1 Marks
- 5 Questions – 2 Marks
- Engineering Mathematics and Computer Science & Information Technology – 85 Marks of MCQs, MSQs and NATs Questions
- Engineering Mathematics – 13 Marks
- Computer Science & Information Technology – 72 Marks
- 25 Questions – 1 Marks
- 30 Questions – 2 Marks
- General Aptitude – 15 Marks of MCQs Questions
- Negative Marking
- For MCQs
- ⅓ for 1 mark questions
- ⅔ for 2 marks questions
- NATs – No Negative Marking
- For MCQs
Frequently Asked Questions
- What are the main topics covered in the GATE CS & IT syllabus?
- The syllabus includes Digital Logic, Computer Organization and Architecture, Programming and Data Structures, Algorithms, Theory of Computation, Compiler Design, Operating Systems, Databases, and Computer Networks.
- Is Engineering Mathematics included in the GATE CS & IT syllabus?
- Yes, Engineering Mathematics is a significant part of the syllabus and covers various topics like discrete mathematics, linear algebra, calculus, and probability and statistics.
- Can I appear for any other paper along with CS & IT?
- Candidates are allowed to appear for a second paper from the pre-defined Two Paper Combination list provided by the GATE authorities.
- What is the weightage of the General Aptitude section in the exam?
- The General Aptitude section carries 15% of the total marks, which is common across all GATE papers.
- Where can I find the detailed GATE syllabus for CS & IT?
- The detailed syllabus can be downloaded from our website or from the official GATE website – https://gate2024.iisc.ac.in/.
- Are there any changes in the syllabus from the previous year?
- The syllabus can be updated from time to time. Candidates should refer to the official GATE notification for the latest syllabus updates.
- What type of questions are asked in the GATE CS & IT paper?
- The paper includes multiple-choice questions (MCQs), multiple-select questions (MSQs), and numerical answer type (NAT) questions based on the topics in the syllabus.
- How can I practice for the GATE CS & IT exam?
- Past year question papers and syllabus are available in our website which can be used for practice. Additionally, use hight quality study material and test series for preparation.