The GATE Computer Science (CSE) syllabus is a comprehensive guide for aspirants aiming to excel in the GATE exam, designed for postgraduate admissions and public sector jobs. It covers fundamental and advanced topics in computer science, including programming, data structures, algorithms, operating systems, databases, computer networks, theory of computation, and software engineering. Understanding the syllabus is crucial for strategic preparation, as it provides insight into the core areas tested in the exam. A strong grasp of these subjects not only helps in the GATE exam but also enhances problem-solving and analytical skills crucial for a successful career in technology. Check GATE CSE Syllabus in details.
Gate CSE Syllabus 2025
The GATE (Graduate Aptitude Test in Engineering) syllabus for Computer Science and Engineering (CSE) is designed to test your understanding of various undergraduate topics in computer science. The syllabus is divided into several sections:
Engineering Mathematics
- Discrete Mathematics: Propositional and First Order Logic, Sets, Relations, Functions, Partial Orders and Lattices, Groups, Graphs, Connectivity, Matching, Coloring.
- Linear Algebra: Matrices, Determinants, System of Linear Equations, Eigenvalues and Eigenvectors.
- Calculus: Limits, Continuity, Differentiability, Mean Value Theorems, Theorems of Integral Calculus, Maxima and Minima, Fourier Series, Partial Derivatives, Total Derivatives, Double and Triple Integrals.
- Probability: Conditional Probability, Bayes Theorem, Expectation and Variance, Random Variables, Distributions (Uniform, Normal, Exponential), Mean, Median, Mode.
- Statistics: Random Variables, Probability Distributions, Mean, Variance, Hypothesis Testing.
- Numerical Methods: Numerical solutions of Linear and Non-linear Equations, Integration, and Differentiation.
Digital Logic
- Boolean Algebra, Combinational and Sequential Circuits, Minimization, Number Representations, and Computer Arithmetic (Fixed and Floating Point).
Computer Organization and Architecture
- Machine Instructions and Addressing Modes, ALU, Data-path, Control Unit, Instruction Pipelining, Memory Hierarchy (Cache, Main Memory, and Secondary Storage), I/O Interface (Interrupt and DMA Mode), Microprogramming, RISC and CISC Architectures.
Programming and Data Structures
- Programming in C, C++, Java, Python, etc.
- Recursion, Arrays, Stacks, Queues, Linked Lists, Trees, Binary Search Trees, Heaps, Graphs, Sorting, Searching, and Hashing.
Algorithms
- Asymptotic Notations, Space and Time Complexity, Divide and Conquer, Greedy Algorithms, Dynamic Programming, Backtracking, Branch-and-Bound, Graph Traversals, Shortest Paths, Minimum Spanning Trees, NP-Completeness.
Theory of Computation
- Regular Languages and Finite Automata, Context-Free Languages and Pushdown Automata, Turing Machines, Undecidability.
Compiler Design
- Lexical Analysis, Parsing, Syntax-Directed Translation, Runtime Environments, Intermediate Code Generation, Code Optimization, Code Generation.
Operating Systems
- Processes, Threads, Inter-process Communication, Concurrency, Synchronization, Deadlock, CPU Scheduling, Memory Management, Virtual Memory, File Systems.
Databases
- ER-model, Relational Model (Integrity Constraints, Normal Forms), SQL, Tuple Calculus, Query Processing, Transactions and Concurrency Control, Recovery.
Computer Networks
- OSI Model, TCP/IP, Network Topologies, Data Link Layer (MAC protocols, Ethernet), Switching, IP Addressing (IPv4, IPv6), Routing Algorithms, Transport Layer (TCP, UDP), Congestion Control, Application Layer Protocols (DNS, SMTP, HTTP).
Software Engineering
- Software Development Life Cycle (SDLC), Agile Methodologies, Design Patterns, Testing and Debugging, Version Control.
Web Technologies
- HTML, CSS, JavaScript, XML, Client-server Architecture, Web Services, Basics of Internet Protocols.
Computer Security
- Cryptography, Symmetric and Asymmetric Key Algorithms, Digital Signatures, Firewalls, VPNs, Network Security.
Machine Learning (New Additions)
- Supervised Learning, Unsupervised Learning, Regression, Classification, Clustering, Neural Networks, and Support Vector Machines.
Gate CSE Syllabus 2025 PDF Download
Download Last two year Gate CSE Syllabus PDFs by clicking on the below links.
Gate CSE Exam Pattern 2025
The GATE (Graduate Aptitude Test in Engineering) 2025 exam pattern for Computer Science Engineering (CSE) includes the following key elements:
1. Exam Duration:
- 3 hours (180 minutes)
2. Total Marks:
- 100 marks (divided between different sections)
3. Total Number of Questions:
- 65 questions in total
4. Question Types:
- Multiple Choice Questions (MCQs): These questions will have four options, out of which only one is correct.
- Multiple Select Questions (MSQs): These questions will have four options, and one or more options could be correct.
- Numerical Answer Type (NAT): These questions require a numerical answer, which must be entered using a virtual keyboard.
5. Marking Scheme:
- MCQs:
- For 1-mark questions: 1 mark for the correct answer, and a 1/3 mark will be deducted for incorrect answers.
- For 2-mark questions: 2 marks for the correct answer, and 2/3 marks will be deducted for incorrect answers.
- MSQs & NATs:
- No negative marking for these types of questions.
6. Section-wise Distribution:
- General Aptitude (GA): 10 questions (15 marks total)
- 5 questions of 1 mark each
- 5 questions of 2 marks each
- Core Subject (CSE): 55 questions (85 marks total)
- 25 questions of 1 mark each
- 30 questions of 2 marks each
7. Syllabus Coverage:
- The core CSE syllabus includes:
- Engineering Mathematics
- Digital Logic
- Computer Organization and Architecture
- Programming and Data Structures
- Algorithms
- Theory of Computation
- Compiler Design
- Operating Systems
- Databases
- Computer Networks
- Discrete Mathematics
8. Mode of Examination:
- Online (Computer-based Test – CBT)
All Details are also mentioned in this table.
| GATE CSE Exam Pattern 2025 | |
| Particulars | Details |
| Mode of Exam | Online |
| Number of Questions | 65 |
| Duration of Exam | 3 hours |
| Pattern of Questions |
|
| Marking Scheme |
|
| Number of Sections |
|
| Topic wise weightage |
|
Gate Computer Science Syllabus: FAQs
Q 1. What are the key topics in the GATE CSE syllabus?
Ans. The syllabus covers General Aptitude, Engineering Mathematics, and core CSE subjects like Algorithms, Data Structures, Operating Systems, Computer Networks, and Databases.
Q.2 What is the weightage of different subjects in GATE CSE?
Ans. Core CSE topics account for 72% of the exam, General Aptitude 15%, and Engineering Mathematics 13%.
Q 3. What type of questions are asked in GATE CSE?
Ans. There are MCQs, MSQs (Multiple Select Questions), and NAT (Numerical Answer Type) questions.
Q 4. Is programming important for GATE CSE?
Yes, Programming and Data Structures have a significant weightage (around 13%).
Q 5. What is the weightage for Algorithms in GATE CSE?
Algorithms generally hold around 5-10% weightage in the exam