GATE Strategy & Roadmap
53 articles in this topic

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.

Minimum Registers to Evaluate an Expression for GATE: Sethi-Ullman Numericals Solved
Label an expression tree from the leaves upward, read the minimum register count at the root, and construct an evaluation schedule that actually achieves it.

Mathematical Induction and Proof Techniques for GATE CS: Direct, Contrapositive and Contradiction Worked
Learn when to use direct proof, contrapositive, contradiction and induction, with complete algebra and the proof errors GATE commonly turns into options.

Two-Phase Locking and Timestamp Ordering for GATE: Recoverable and Cascadeless Schedules Solved
Classify one schedule as recoverable but not cascadeless, trace basic timestamp ordering against Thomas' Write Rule, and connect both results to strict 2PL.

Random Variables and Distributions for GATE CS: Expectation and Variance Numericals Solved
Compute expectation and variance from a PMF, recognise four standard distributions, and use linearity and variance scaling without silent formula errors.

P, NP, NP-Complete and NP-Hard for GATE: Reductions and Problem-Classification Questions Solved
Learn the four complexity labels, fix the direction of polynomial reductions, and verify Independent Set to Vertex Cover on a five-cycle.

Lossless Join and Dependency Preservation for GATE: Decomposition Checks Solved Step by Step
Test a decomposition for lossless join and dependency preservation using attribute closure, projected dependencies and a complete chase tableau.

IPv4 Header and Fragmentation for GATE: Offset, MTU and TTL Numericals Solved
Decode the IPv4 header, split a 4000-byte datagram across a 1500-byte MTU, and verify every offset, flag and fragment length.