GATE CY study plan

Prove and apply core set identities, relations, and functions to solve counting and graph problems

Derive closed forms for linear recurrences and compute generating functions

Simplify Boolean expressions using Karnaugh maps and implement them with NAND/NOR gates

Design combinational circuits (adders, multiplexers, decoders) and verify truth tables

Convert numbers between binary, octal, decimal, and hexadecimal and perform two's complement arithmetic

Analyze CPU performance using CPI, clock rate, and instruction mix; compute speedup and Amdahl's law limits

Trace pipelined execution, identify data/control hazards, and calculate stalls with forwarding

Compare cache mapping schemes (direct, set-associative) and compute hit ratios and AMAT

Implement and debug pointer-based data structures (linked lists, stacks, queues) in C

Solve recurrence relations for time complexity of recursive programs and analyze stack frames

Derive time and space complexities for sorting algorithms (merge, quick, heap) and justify best/worst cases

Apply greedy and dynamic programming strategies to solve optimization problems (knapsack, LCS, shortest paths)

Construct minimal DFAs and convert between DFA, NFA, and regular expressions

Use the pumping lemma to prove non-regularity and closure properties to combine languages

Design Turing machines for simple languages and classify problems as decidable, recognizable, or undecidable

Construct LL(1) parsing tables, compute FIRST and FOLLOW sets, and identify conflicts

Build LR(0) and SLR(1) item sets and parse strings using the resulting automaton

Compare scheduling algorithms (FCFS, SJF, Round Robin) and compute average waiting and turnaround times

Analyze process synchronization problems using semaphores and detect deadlocks with resource-allocation graphs

Apply page-replacement algorithms (FIFO, LRU, Optimal) and compute page faults for a reference string

Design normalized relational schemas (up to BCNF) from ER diagrams and verify lossless join and dependency preservation

Write SQL queries involving joins, aggregation, and nested subqueries; translate relational algebra to SQL

Compute the sliding-window throughput and efficiency for stop-and-wait, Go-Back-N, and Selective Repeat

Apply IP addressing, subnetting, and CIDR to assign addresses and determine routing tables

Trace TCP connection establishment, congestion control (slow start, AIMD), and compare with UDP

Solve quantitative aptitude problems on ratios, percentages, and interest within time limits

Interpret data from tables and charts to answer comparison and calculation questions

Identify logical reasoning patterns (syllogisms, seating arrangement) and apply elimination strategies

Solve verbal ability questions on grammar, vocabulary, and reading comprehension

Practice time management by completing a full-length aptitude section under exam conditions

Revise all technical domains by solving mixed-topic question sets under timed conditions

Revisit weak areas identified in previous weeks and re-solve incorrect questions

Memorize key formulas and theorems (e.g., master theorem, Little's law, Shannon capacity) using flashcards

Practice previous-year GATE papers (at least 2 full papers) and analyze score distribution

Improve accuracy by reviewing common traps and edge cases in each domain

Simulate full exam conditions with 3 complete mock tests (including aptitude) and adhere to time limits

Refine question-selection strategy: skip, mark, and return based on difficulty and weightage

Review all mock tests to eliminate repeated errors and reinforce weak concepts

Practice stress management and maintain a consistent sleep schedule

Finalize exam-day logistics and a quick-revision checklist