GATE CS study plan
GATE CS · Give each week a clear focus.
8 weeks · About 6 hours per week
Computer Science and Information Technology (CS)
Derive and memorize the master theorem cases and apply them to at least 15 recurrences
Solve 20 asymptotic-complexity comparison items using limit and ratio tests
Implement merge sort, quicksort, and binary search from scratch and verify their recurrence solutions empirically
Build a one-page complexity cheat sheet covering standard growth rates and summation bounds
Your checkpoint
A hand-written complexity cheat sheet plus a log of 35 solved recurrence/asymptotics problems with final answers
Computer Science and Information Technology (CS)
Construct and traverse binary search trees, AVL trees, and heaps on paper for 10 insertion/deletion sequences
Solve 15 hashing problems involving open addressing, chaining, and load-factor analysis
Analyze graph traversals (BFS, DFS) and topological sort on 8 small graphs by hand
Compare sorting algorithms on stability, in-place behavior, and worst-case bounds in a written table
Your checkpoint
A 10-problem data structures problem set fully solved with worked traces for each tree/graph operation
Computer Science and Information Technology (CS)
Prove and apply the pumping lemma to classify at least 8 languages as regular or non-regular
Convert between DFA, NFA, and regular expressions for 10 given languages
Construct CFGs and pushdown automata for 6 languages and test membership
Classify 10 languages into the Chomsky hierarchy with justification
Your checkpoint
A language-classification worksheet of 30 items, each with a one-line proof or construction
Computer Science and Information Technology (CS)
Design Turing machines for 5 simple decision problems and describe their transitions
Determine decidability or undecidability of 10 problems using reductions from the halting problem
State and apply Rice's theorem to classify 6 language properties
Derive closure properties of recursive and recursively enumerable languages and use them in 8 proof sketches
Your checkpoint
A timed 90-minute mock section on theory of computation scored and reviewed, with every wrong answer corrected in writing
Computer Science and Information Technology (CS)
Solve 15 propositional and first-order logic problems, including validity and satisfiability checks
Apply counting principles (pigeonhole, inclusion-exclusion, recurrence relations) to 12 combinatorics items
Compute closures, partial orders, and lattice properties for 8 relations
Solve 10 graph theory problems on connectivity, planarity, and Euler/Hamiltonian conditions
Your checkpoint
A discrete mathematics problem set of 45 solved items with a summary of recurring trick patterns
Computer Science and Information Technology (CS)
Solve 20 probability problems covering conditional probability, Bayes' theorem, and distributions
Analyze 12 algorithm-design items requiring greedy versus dynamic programming decisions
Evaluate 10 numerical-methods items on root finding and interpolation error
Work through 8 linear algebra and calculus items relevant to CS (matrix rank, eigenvalues, limits)
Your checkpoint
A solutions portfolio of 50 problems across probability, algorithms, numerical methods, and mathematics
Computer Science and Information Technology (CS)
Trace 10 pipelined and cached CPU scenarios, computing speedup, CPI, and hit ratios
Convert between number systems and perform IEEE 754 floating-point arithmetic for 12 items
Analyze 8 OS problems on scheduling, deadlock detection, and page replacement
Solve 10 database problems on normalization, relational algebra, and SQL query output
Your checkpoint
A systems-and-databases worksheet of 40 items with full step-by-step calculations
Computer Science and Information Technology (CS)
Complete two full-length timed mock papers under exam conditions
Categorize every error from both mocks by topic and root cause
Re-solve all previously logged wrong answers without notes
Compress revision notes into a final one-page formula and concept sheet
Your checkpoint
A final revision sheet plus a scored error log showing improvement between the two mock papers
Milestones
Week 2: Score at least 60% on a self-made 20-question quiz on asymptotics, trees, hashing, and sorting without notes
Week 4: Score at least 55% on the timed theory-of-computation mock and reduce repeat errors to fewer than three
Week 6: Score at least 60% on a mixed 30-question set spanning discrete mathematics, probability, and algorithms
Week 8: Score at least 65% on the second full mock and finish with a complete one-page revision sheet