GATE CSE Syllabus 2025: Appearing for computer science? Detailed question paper pattern, cut-offs
GATE 2025: The highest number of 1,52,652 registered for the GATE CSE paper, of which 1,23,967 candidates took the computer science and information technology test last year.
Candidates preparing for GATE 2025 can now access the official syllabus. The detailed syllabus PDF is available for download as PDF here.
Download NowAnu Parthiban | January 30, 2025 | 12:54 PM IST
NEW DELHI: The Indian Institute of Technology Roorkee (IIT Roorkee) has announced the branch-wise GATE syllabus for all 30 papers to be held from February 1. The Graduate Aptitude Test in Engineering (GATE 2025) will be held in computer-based test (CBT) mode for a total of 100 marks.
Candidates will be allowed to appear for one paper or a maximum of two papers. Only those candidates who have opted for the second paper as per the two-paper combination guidelines will only be allowed to take the exams.
As per the GATE question paper pattern 2025, the examination will test candidates’ general aptitude (GA) and selected subjects. The question paper will consist of multiple-choice questions (MCQ), multiple-select questions (MSQ) and/or numerical answer type (NAT) questions.
Also read GATE Cut-off 2025: Qualifying marks for IIT, NIT MTech admissions; branch-wise cut-offs
GATE CSE Syllabus 2025
Last year, the highest number of 1,52,652 registered for the GATE CSE paper, of which 1,23,967 candidates took the computer science and information technology test. GATE cut-off for general category for CSE branch was at 27.6, for OBC-NCL, EWS it was 24.8, and SC, ST, PwD candidates with score equal to or more than 18.4 were shortlisted. Here’s the detailed GATE CSE syllabus for those who have opted to appear in the computer science paper.
GATE syllabus for CSE |
Topics |
Section 1: Engineering Mathematics |
Discrete Mathematics Linear Algebra Calculus Probability and Statistics |
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 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 sub expression 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. |
Follow us for the latest education news on colleges and universities, admission, courses, exams, research, education policies, study abroad and more..
To get in touch, write to us at news@careers360.com.
Next Story
]Featured News
]- MCC NEET PG Counselling: Aspirants demand round 4 or stray vacancy upgrade, fear MP lag may cost seats
- ASER Report: Government schools outshine private in post-Covid learning recovery, but teen enrollment drops
- How new-age law colleges of India are redefining legal learning
- No student, 6 teachers, crumbling building: West Bengal’s zero-enrolment school problem
- NMC proposal to let MSc, PhDs teach at medical colleges will ‘dilute academic standards’: Resident doctors
- ‘Academic apartheid’: Non-doctors denounce NMCs’ new rules for medical faculty recruitment
- New UGC regulations may create rubber-stamp VCs, conflict with states: JNU professor
- Why NMC bid to expand medical faculty pool is drawing fire from both doctors, non-medical postgraduates
- Data Science, Maritime and Property Law: Top LLB, LLM colleges launch courses in niche frontiers
- Music, arts and Harry Potter: How top law colleges are using films and fiction to teach legal concepts