Standard Reference Blueprint

Authoritative Textbooks & Test Series Strategy

Stop wasting time reading 800-page textbooks cover to cover. Know exactly which chapters to master, which to skip, and how to operate the virtual calculator with maximum speed.

Reading Strategy

Standard Textbook Chapter-by-Chapter Guide

Curated by IISc & IIT Rankers

Operating System Concepts (Galvin, Silberschatz, Gagne - 9th/10th Ed.)

Weightage: 8-10M
✓ MUST-READ CHAPTERS:
  • Ch 3: Processes (PCB, Process states, fork() calls, Context switch).
  • Ch 5: CPU Scheduling (FCFS, SJF, SRTF, RR, Priority, Multi-level feedback).
  • Ch 6 & 7: Synchronization & Deadlocks (Peterson's algorithm, Semaphores, Classic synchronization problems, Banker's Safety algorithm, RAG cycle detection).
  • Ch 8 & 9: Main Memory & Virtual Memory (Multi-level paging, TLB EMAT, Inverted page tables, FIFO Belady's anomaly, LRU, Optimal page replacement, Thrashing).
✗ SKIP ENTIRELY (Not in GATE Syllabus):
  • • Ch 14-16: Distributed Systems, Network File Systems (NFS).
  • • Ch 17-18: Real-Time Systems and Multimedia OS.
  • • Ch 19-21: Windows Internals and Linux case study appendices.

Computer Networking: A Top-Down Approach (Kurose & Ross, 7th/8th Ed.)

Weightage: 8-10M
✓ MUST-READ CHAPTERS:
  • Ch 3: Transport Layer (TCP segment structure, 3-way handshake, TCP AIMD, Slow Start, Fast Retransmit, UDP checksum).
  • Ch 4 & 5: Network Layer (IPv4 header, Subnetting, CIDR, Fragmentation, Distance Vector Bellman-Ford, Link State Dijkstra, BGP).
  • Ch 6: Link Layer (CRC polynomial math, Hamming distance, CSMA/CD, Stop-and-Wait, Go-Back-N, Selective Repeat).
✗ SKIP ENTIRELY:
  • • Ch 7: Wireless & Mobile Networks (Cellular CDMA/GSM architectures).
  • • Ch 8: Advanced Cryptography (Complex cipher suites not on syllabus).
  • • Ch 9: Video Streaming / CDN DASH protocols (Conceptual overview is enough).

Introduction to Algorithms (CLRS, 3rd/4th Ed.)

Weightage: 12-15M
✓ MUST-READ CHAPTERS:
  • Ch 3 & 4: Growth of Functions & Divide-and-Conquer (Master Theorem, recursion trees).
  • Ch 6-9: Sorting & Order Statistics (HeapSort, QuickSort analysis, CountingSort, RadixSort).
  • Ch 15 & 16: DP & Greedy (LCS, Matrix Chain, Fractional Knapsack, Huffman).
  • Ch 22-24: Graph Algorithms (BFS, DFS, Topological sort, Strongly Connected Components, Dijkstra, Bellman-Ford, Kruskal, Prim).
✗ SKIP ENTIRELY:
  • • Ch 18-20: B-Trees (Read from Korth instead for database focus), Fibonacci Heaps, van Emde Boas trees.
  • • Ch 26: Maximum Flow (Ford-Fulkerson - rarely tested in CSE).
  • • Ch 27-33: Multithreaded Algorithms, Matrix operations, Number-Theoretic algorithms, Fast Fourier Transform (FFT).

Introduction to the Theory of Computation (Michael Sipser, 3rd Ed.)

Weightage: 7-9M
✓ MUST-READ CHAPTERS:
  • Ch 1: Regular Languages (DFA, NFA, Regular expressions, Pumping Lemma).
  • Ch 2: Context-Free Languages (CFG, Ambiguity, Pushdown Automata, Chomsky Normal Form).
  • Ch 3, 4 & 5: Turing Machines, Decidability & Reducibility (Halting problem, Rice's theorem, PCP reductions).
✗ SKIP ENTIRELY:
  • • Ch 8: Space Complexity (PSPACE completeness proofs beyond basic definitions).
  • • Ch 9 & 10: Advanced Topics in Complexity (Intractability, Probabilistic computation, Quantum computation).
Exam Tactical Speed

GATE Virtual Calculator Speed Tactics

Avoid Costly NAT Calculation Blunders
1

Base-2 Logarithm (\(\log_2\))

The virtual calculator has NO direct \(\log_2(X)\) button. If you need \(\log_2(1024)\) or \(\log_2(500)\), use the natural log property:

ln(X) / ln(2) = log_2(X)

Example: 500 \to ln \to / \to 2 \to ln \to = 8.9657

2

Memory Accumulation (\(M+\) / \(MR\))

For multi-term equations like EMAT: \(0.9 \times 90 + 0.08 \times 170 + 0.02 \times 250\):

  • 1. Compute \(0.9 \times 90 \to M+\)
  • 2. Compute \(0.08 \times 170 \to M+\)
  • 3. Compute \(0.02 \times 250 \to M+\)
  • 4. Press \(MR\) to retrieve final sum without writing on paper.
3

Degree vs Radian Mode Trap

By default, trigonometric calculations in the virtual calculator are in Degrees. If an Engineering Mathematics limit requires evaluating \(\sin(x)\) or \(\cos(x)\) where \(x\) is in radians, toggle the top Rad radio button!

⚠️ Forgetting to check Rad mode causes wrong answers in calculus NATs.
Test Series Science

The 3-Phase Test Execution Protocol

The Science of Peak Exam Performance
Phase 1 • Jul to Oct

Topic-Wise Accuracy Drills

Do not worry about speed. Solve 10-15 questions per subtopic untimed. Your goal is strictly accuracy > 95%. If a question is wrong, classify it in your error log immediately.

Phase 2 • Nov to Dec

Multi-Subject Time Budgeting

Practice paired tests (e.g. OS + COA, TOC + CD, DBMS + CN). Enforce strict time budgeting: 1.5 min per 1-mark question, 3 min per 2-mark question. Develop the muscle to skip questions within 45 seconds.

Phase 3 • Jan to Feb

Full-Length Mocks & Error Logs

Take 15-20 full-length mock exams strictly in the official 9:30 AM - 12:30 PM slot. Maintain a 3-column Mistake Log: Conceptual Gap, Calculation Error, Misread Question. Review the log weekly.