GATE Strategy & Roadmap
48 articles in this topic

ISRO Scientist/Engineer CS Syllabus vs GATE CS: The Subject Overlap Map
See which core CS subjects transfer directly from GATE to ISRO, what drops out, how the question texture changes and where an ISRO-specific polish helps.

Union-Find for GATE: Union by Rank, Path Compression and the Near-Constant Bound
Trace seven unions, inspect the final ranks, then compress the deepest path by hand. The worked forest makes the inverse-Ackermann bound much less mysterious.

RAID Levels for GATE: Striping, Mirroring, Parity and the Two Capacity Formulas
Stop memorising RAID names in isolation. Tie each level to usable capacity, failure tolerance and write cost, then test the formulas on one eight-disk array.

Memory Interfacing for GATE: Chip-Count and Address-Decoding Numericals, Fully Worked
Separate words from bits, split the address correctly, and verify the result with a gap-free hexadecimal map. This guide works through depth and width expansion step by step.

KMP and Rabin-Karp for GATE: The Failure Function and Rolling Hash, Fully Solved
Build the LPS array without guessing, trace a KMP fallback that never moves the text index back, and calculate every Rabin-Karp window hash by hand.

Calculus for GATE CS: Limits, Continuity and Maxima-Minima Questions, Fully Solved
Work through one complete limit, continuity and extrema problem, then use a compact checklist to avoid the setup errors that turn simple calculus into lost marks.

Backtracking and Branch and Bound for GATE: N-Queens and the State-Space Tree, Traced
Trace a 4-Queens state-space tree, see exactly why branches die, and calculate a fractional knapsack bound. The comparison turns two similar methods into distinct exam tools.

ARP, DHCP and ICMP for GATE: The Three Support Protocols and How They Are Tested
Fix the job, layer and packet flow of ARP, DHCP and ICMP. Then use six GATE-style scenarios to practise choosing the right support protocol without guesswork.

Runtime Environments for GATE: Activation Records, Static vs Dynamic Scoping and Parameter Passing
Separate control and access links, trace static and dynamic scope, then calculate how value, reference and value-result change one program's output.

ROM, PLA and PAL for GATE: Sizing and Programmable-Logic Implementation Questions Solved
Implement the same Boolean functions with ROM, PLA and PAL, calculate every size and see exactly why product-term sharing changes the answer.

RISC vs CISC for GATE: Architecture Differences and the True-False Questions They Generate
Learn the design choice behind RISC and CISC, rebuild the comparison table from first principles, and solve the CPU-time numerical that defeats instruction-count guesses.

Modular Arithmetic for GATE CS: Congruences, GCD and Euler's Totient, Solved
Turn large remainder questions into small calculations using congruences, the Euclidean algorithm, Euler's totient and modular inverses.