How I'm Using PYQs
PYQs are where I actually find out whether a topic is learned or just familiar. This page collects what I'm noticing, subject by subject, about which question types keep giving me trouble. Full subject pages have more detail and link back to relevant journey entries.
Recent journey entries
All journey entries →Data Structures & Algorithms
PYQ pattern so far: graph traversal and complexity-of-algorithm questions show up almost every year, so those get extra rounds.
Operating Systems
Scheduling numericals and deadlock / banker's algorithm questions are the two areas I'm drilling hardest, since they show up almost every attempt.
Computer Networks
Subnetting numericals and congestion-control questions are the ones I keep flagging for a redo.
DBMS
Query-output prediction and normalization-form identification are the recurring PYQ types I'm tracking.
Computer Organization & Architecture
Pipeline-hazard numericals are where I'm losing the most time right now, so those get solved slowly and deliberately rather than rushed.
Digital Logic
K-map minimization and flip-flop-based sequential circuit questions are the recurring types I drill.
Discrete Mathematics
Graph theory and counting-based questions are the ones I currently get wrong most often, so they go first in every revision cycle.
Theory of Computation
Automata-construction questions are manageable so far. Decidability questions are the ones I'm avoiding a little, which usually means I need to face them sooner.
Compiler Design
No PYQ practice yet here — that comes after the first read-through, not before.
Engineering Mathematics
Probability questions are the ones I get wrong most often here — usually from misreading the question, not from not knowing the method.
Programming in C
Pointer-arithmetic output-prediction questions are the single type I still get wrong most consistently.