⏳
Loading cheatsheet...
GATE Computer Science syllabus, exam pattern, preparation strategy, and key formulas.
| Question Type | 1-Mark | 2-Mark |
|---|---|---|
| MCQ | +1 / -1/3 | +2 / -2/3 |
| MSQ | +1 / 0 | +2 / 0 |
| NAT (Numerical Answer) | +1 / 0 | +2 / 0 |
| GA (General Aptitude) | +1 / -1/3 | +2 / -2/3 |
╔═════════════════════╦══════════════════╦══════════════════╗
║ GATE Score (1000) ║ All India Rank ║ What You Get ║
╠═════════════════════╬══════════════════╬══════════════════╣
║ 900+ (Top 0.1%) ║ 1 - 100 ║ IIT Bombay CS ║
║ 800-900 ║ 100 - 500 ║ Top 7 IITs ║
║ 700-800 ║ 500 - 1500 ║ IITs + NITs ║
║ 600-700 ║ 1500 - 3000 ║ Top NITs + IIITs ║
║ 500-600 ║ 3000 - 7000 ║ NITs + PSU calls ║
║ 400-500 ║ 7000 - 15000 ║ Lower NITs + PSU ║
║ Below 400 ║ 15000+ ║ Private colleges ║
╚═════════════════════╩══════════════════╩══════════════════╝| Subject | Avg Marks | Questions | Priority |
|---|---|---|---|
| General Aptitude | 15 | 10 (5+5) | ⭐⭐⭐⭐⭐ |
| Algorithms | 12-14 | 7-8 | ⭐⭐⭐⭐⭐ |
| Data Structures | 10-12 | 6-7 | ⭐⭐⭐⭐⭐ |
| Operating Systems | 8-10 | 5-6 | ⭐⭐⭐⭐ |
| DBMS | 8-10 | 5-6 | ⭐⭐⭐⭐ |
| Computer Networks | 8-10 | 5-6 | ⭐⭐⭐⭐ |
| Digital Logic | 5-7 | 3-4 | ⭐⭐⭐ |
| Discrete Mathematics | 6-8 | 4-5 | ⭐⭐⭐ |
| Theory of Computation | 5-7 | 3-4 | ⭐⭐⭐ |
| Compiler Design | 4-5 | 2-3 | ⭐⭐ |
| Computer Organization | 5-7 | 3-4 | ⭐⭐⭐ |
| Topic | Marks | Key Areas |
|---|---|---|
| Engineering Math | 13-15 | Linear Algebra, Probability, Calculus, Discrete Math |
| Linear Algebra | 3-4 | Matrices, Eigenvalues, Rank, Systems of equations |
| Probability | 3-4 | Bayes, Random variables, Distributions |
| Calculus | 2-3 | Limits, Continuity, Maxima-Minima, Integration |
| Discrete Math | 3-5 | Graph theory, Combinatorics, Logic, Sets |
ENGINEERING MATHEMATICS
═══════════════════════════════════════════
• Linear Algebra: Matrices, Determinants, Systems, Eigenvalues
• Calculus: Limits, Continuity, Differentiation, Integration
• Probability: Random variables, Distributions, Bayes theorem
• Discrete Math: Logic, Sets, Relations, Graphs, Combinatorics
COMPUTER SCIENCE CORE
═══════════════════════════════════════════
• Digital Logic: Boolean algebra, Minimization, Combinational/Sequential circuits
• Computer Organization: Machine instructions, Addressing, Memory hierarchy, Pipeline
• Programming & DS: C/C++ concepts, Arrays, Linked Lists, Trees, Graphs, Hashing
• Algorithms: Sorting, Searching, Greedy, DP, Graph algorithms, Complexity
• Theory of Computation: Regular/CFL/DCFL, Turing machines, Undecidability
• Compiler Design: Lexical analysis, Parsing, Syntax-directed translation
• Operating Systems: Processes, Threads, Synchronization, Memory, File systems
• Databases: ER model, Relational algebra, SQL, Normalization, Transactions, Concurrency
• Computer Networks: OSI/TCP-IP, Routing, TCP/UDP, Application layer, Security| Section | Questions | Marks | Negative |
|---|---|---|---|
| GA (1-mark MCQ) | 5 | 5 | -1/3 |
| GA (2-mark MCQ) | 5 | 10 | -2/3 |
| CS Core (1-mark) | 25 | 25 | -1/3 (MCQ) / 0 (NAT/MSQ) |
| CS Core (2-mark) | 30 | 60 | -2/3 (MCQ) / 0 (NAT/MSQ) |
| Total | 65 | 100 | — |
| Type | Description | Strategy |
|---|---|---|
| MCQ | One correct answer from 4 options | Eliminate 2, then guess if 50-50 |
| MSQ | Multiple correct answers (1+ options) | Verify each option; no negative |
| NAT | Type numerical answer (real number) | Compute carefully; no guessing |
╔═══════════════════════════════════════════════════════════════╗
║ GATE CS TIME MANAGEMENT (180 MINUTES) ║
╠═══════════════════════════════════════════════════════════════╣
║ ║
║ ROUND 1 — Easy Questions (90 min) ║
║ → GA: 10 Qs in 12 min ║
║ → Core 1-mark: 20-22 Qs in 35 min ║
║ → Core 2-mark: 15-18 Qs in 43 min ║
║ → Target: 45-50 questions attempted ║
║ ║
║ ROUND 2 — Medium Questions (60 min) ║
║ → Remaining 1-mark: 3-5 Qs in 15 min ║
║ → Remaining 2-mark: 8-10 Qs in 45 min ║
║ → Target: 55-58 questions total ║
║ ║
║ ROUND 3 — Review & Guess (30 min) ║
║ → Review marked-for-review questions ║
║ → Guess MCQs with 2 options eliminated (50-50) ║
║ → Never guess NAT or MSQ blindly ║
║ → Final check of answer sheet ║
╚═══════════════════════════════════════════════════════════════╝| Phase | Months | Focus | Hours/Day |
|---|---|---|---|
| Foundation | 1-3 | Core subjects + Math | 6-8 hrs |
| Practice | 4-5 | Previous year papers + topic tests | 6-8 hrs |
| Mocks | 6-7 | Full-length mocks + weak areas | 4-6 hrs |
| Revision | 8 | Formula revision + select mocks | 4-5 hrs |
| Resource | Best For | Format |
|---|---|---|
| NPTEL Lectures | Concept building | Video |
| GeeksforGeeks | DS, Algo, OS, CN, DBMS | Text + Practice |
| Gate CSE by Ravula | All subjects | YouTube |
| Standard Books | In-depth understanding | Books |
| Gate Overflow | Previous year Qs | Website |
| Made Easy / ACE | Test series | Online platform |
╔═════════════════════════════════════════════════════════╗
║ GATE CS STANDARD BOOKS ║
╠═════════════════════════════════════════════════════════╣
║ Discrete Mathematics → Kenneth Rosen ║
║ Linear Algebra → Gilbert Strang (NPTEL) ║
║ Digital Logic → Morris Mano ║
║ Computer Organization → Carl Hamacher ║
║ Programming & DS → Cormen (CLRS) or Narasimha ║
║ Algorithms → Cormen (CLRS) ║
║ Theory of Computation → Peter Linz or Ullman ║
║ Compiler Design → Dragon Book (Aho, Lam) ║
║ Operating Systems → Galvin (Silberschatz) ║
║ Databases → Korth or Ramakrishnan ║
║ Computer Networks → Tanenbaum / Forouzan ║
║ Computer Networks → Kurose & Ross (for TCP/IP) ║
╚═════════════════════════════════════════════════════════╝SORTING COMPLEXITIES
═══════════════════════════════════════════════════════
Algorithm Best Average Worst Space
────────────────────────────────────────────────────────────
Bubble Sort O(n) O(n²) O(n²) O(1)
Selection Sort O(n²) O(n²) O(n²) O(1)
Insertion Sort O(n) O(n²) O(n²) O(1)
Merge Sort O(n log n) O(n log n) O(n log n) O(n)
Quick Sort O(n log n) O(n log n) O(n²) O(log n)
Heap Sort O(n log n) O(n log n) O(n log n) O(1)
Counting Sort O(n+k) O(n+k) O(n+k) O(n+k)
Radix Sort O(d(n+k)) O(d(n+k)) O(d(n+k)) O(n+k)
MASTER THEOREM: T(n) = aT(n/b) + f(n)
• Case 1: f(n) = O(n^c) where c < log_b(a) → T(n) = Θ(n^log_b(a))
• Case 2: f(n) = Θ(n^log_b(a) × log^k n) → T(n) = Θ(n^log_b(a) × log^(k+1) n)
• Case 3: f(n) = Ω(n^c) where c > log_b(a) → T(n) = Θ(f(n))OPERATING SYSTEMS
═══════════════════════════════════════════════════════
• CPU Utilization = 1 / (1 + (W/S)) [W=wait, S=service]
• Turnaround Time = Completion Time - Arrival Time
• Waiting Time = Turnaround Time - Burst Time
• Response Time = First Run Time - Arrival Time
• Page Fault Rate: 1 / (1 + 2×(frames_available))
DBMS
═══════════════════════════════════════════════════════
• RAID 0: n disks → speed n×, no redundancy
• RAID 1: 2n disks → speed n× (read), n/2× (write)
• RAID 5: n+1 disks → speed n× (read), n/(n+1)× (write)
• Normal Forms: 1NF → 2NF → 3NF → BCNF → 4NF → 5NF
• 2NF: No partial dependency on composite key
• 3NF: No transitive dependency (X→Y, Y→Z)
• BCNF: For every FD X→A, X must be a superkey
COMPUTER NETWORKS
═══════════════════════════════════════════════════════
• Throughput = (Window Size × 8) / RTT (bps)
• Efficiency = Window Size / (1 + 2a) [a = propagation/transmission]
• Maximum: Efficiency = 1 when Window = 1+2a
• DNS: Hierarchy → Root → TLD → Authoritative → Local