GATE CS Preparation
Subject-wise strategy, PYQ analysis, and realistic study plans for GATE CS aspirants.
84 articles in this topic
Phases of a Compiler for GATE: One Statement Traced Through Every Phase
Follow position = initial + rate * 60 through all six compiler phases. Each step shows the exact artifact, error class and hand-off that GATE can test.
Probability for GATE CS
Translate the wording into events before calculating. Exact dice, Bayes and expectation examples show how to build the denominator and avoid the standard independence trap.
Final Year Placement Preparation Plan: A 90-Day Schedule for Aptitude, Coding and Interviews
Run aptitude, coding and interviews as three connected streams across 90 days. The schedule includes weekly hours, phase checkpoints and a rule for missed days.
Relational Algebra for GATE: Operators, Tuple-Counting and Query Equivalence Drills
Calculate set, join, and outer-join cardinalities on concrete relations, then use selection and projection pushdown without changing query meaning.
Ambiguous Grammars, Precedence and Associativity for GATE: Grammar Classification Questions Solved
Learn how to prove that a grammar is ambiguous, then remove expression ambiguity by encoding operator precedence and associativity into the grammar itself.
Minimum Spanning Tree for GATE: Kruskal and Prim Numericals with Unique-MST Questions
Run Kruskal and Prim on the same weighted graph, verify their common cost, and use cut, cycle, and equal-weight reasoning to answer uniqueness questions.
Booth's Algorithm for GATE: Signed Multiplication Traced Step by Step
Trace Booth multiplication through A, Q and Q-1, preserve the sign during every shift, and count additions and subtractions from bit transitions.
Flip-Flop Conversion for GATE: Excitation Tables and the SR, JK, D, T Conversion Recipe, Solved
Convert one flip-flop into another with the target transition, the available device's excitation table and a K-map. The solved JK-to-T case shows every row.
Pointers in C for GATE
Draw pointers as addresses in boxes, then trace double pointers, arrays, swaps and precedence without guessing. The worked outputs show the method GATE rewards.
TCP Congestion Control for GATE
Track cwnd at one fixed point in every round, apply the correct growth rule, and reset it according to the stated loss signal. This guide works through the full table.
Master Theorem for GATE: All Cases, Boundary Traps and Solved Recurrences
Classify divide-and-conquer recurrences through one comparison, verify the regularity condition, and recognise the log-gap recurrences that need another method.
LL(1) Parsing Table Construction for GATE
Build an LL(1) table cell by cell, test it for conflicts, and see how left recursion and common prefixes break predictive parsing.