GATE CS at a Glance
Paper Code
CS
Paper Name
Computer Science & IT
Exam Authority
IISc / IITs (Rotational)
Exam Mode
Computer Based Test (CBT)
Duration
3 Hours (180 Minutes)
Important Dates
Check Latest Official Notification
Who Can Appear for GATE CS?
Standard official eligibility requirements for candidates.
Educational Qualification
Candidates currently in the 3rd or higher years of any undergraduate degree program OR who have already completed any government approved degree program in Engineering / Technology / Architecture / Science / Commerce / Arts are eligible.
Age Limit
There is absolutely no age limit criteria defined for candidates appearing for the GATE examination.
Number of Attempts
There is no restriction on the number of times a candidate can appear for the GATE examination.
GATE CS Exam Pattern
Structure and marking scheme of the Computer Science paper.
| Section | Total Questions | Total Marks | Weightage |
|---|---|---|---|
| General Aptitude (GA) | 10 Questions | 15 Marks | 15% |
| Engineering Mathematics | Combined with Core | ~13 Marks | ~13% |
| Core Computer Science (CS) | 55 Questions (incl. Math) | 85 Marks (incl. Math) | ~72% |
| Total | 65 Questions | 100 Marks | 100% |
Multiple Choice Questions (MCQ)
Multiple Select Questions (MSQ)
Numerical Answer Type (NAT)
For 1-mark MCQ: -1/3 mark
For 2-mark MCQ: -2/3 mark
No negative marking for MSQ and NAT.
GATE CS Syllabus
Official subject-wise topic breakdown for Computer Science & IT.
01 Engineering Mathematics
Discrete Mathematics, Linear Algebra, Calculus, Probability and Statistics.
02 Digital Logic
Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).
03 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).
04 Programming and Data Structures
Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.
05 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.
06 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.
07 Compiler Design
Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation. Local optimisation, Data flow analyses.
08 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.
09 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.
10 Computer Networks
Concept of layering: OSI and TCP/IP. Data link layer: framing, error detection, MAC, Ethernet. Routing: IPv4/IPv6, CIDR, OSPF, BGP. Transport: UDP, TCP, Congestion control. Application: DNS, SMTP, HTTP.
Master Every GATE CS Subject
Focus on chapter-wise preparation and concept building.
Algorithms & DS
Build problem-solving skills through structured topic-wise practice of arrays, trees, graphs, and DP.
Practice Topics →Operating Systems
Master concurrency, synchronization, CPU scheduling, and memory management numericals.
Practice Topics →Theory of Computation
Understand automata, grammars, and decidability through extensive conceptual practice.
Practice Topics →Databases (DBMS)
Practice SQL queries, normalization rules, indexing trees, and transaction control.
Practice Topics →GATE CS Previous Year Questions
Practice previous year questions to understand concepts, question styles and recurring areas in Computer Science.
GATE CS Mock Tests
Practice with exam-style tests, improve your time management, and identify areas that need improvement.
How to Prepare for GATE CS
A structured approach specifically tailored for Computer Science.
1 Master Engineering Math
Discrete Mathematics and Engineering Math carry roughly 13-15 marks. Discrete Math forms the foundation for TOC, Algorithms, and DBMS. Complete this first.
2 Core Programming Sequence
Follow this sequence: C Programming → Data Structures → Algorithms. These topics are deeply interconnected and heavily tested in GATE CS.
3 Hardware Sequence
Study Digital Logic before Computer Organization and Architecture (COA), as COA relies on digital circuits. Follow COA with Operating Systems.
4 Don't Ignore Aptitude
General Aptitude provides 15 highly scoring marks. Practice daily aptitude questions to build speed and guarantee these marks without intense study.
GATE CS FAQs
Ready to Start Your GATE CS Preparation?
Choose your topics, practice PYQs and build your preparation step by step.