90-day TRB PG Computer Science Study planner

90‑Day Individual Study Planner for the TRB PG (Post Graduate) Computer Science exam. This planner is structured to build strong foundations, reinforce concepts, practice extensively, and polish before the final exam.

How to Use:

Daily Time Commitment:~3–4 hours
- 1.5 hr – Theory & Concepts
- 1 hr – Problem-solving / Practical Applications
- 30–45 min – Revision / Practice / Previous Questions
Consistency & Tracking: Use a journal or spreadsheet to log progress, issues, and time spent.

Phase Breakdown:

Phase	Days	Focus Area
Phase 1: Core Learning	1–30	Core theory across subjects + basic programming/practice
Phase 2: Intensive Practice	31–60	Advanced problem-solving, previous papers, revision
Phase 3: Final Revision	61–90	Full mock tests, error analysis, polish writing skills

Days 1–30: Core Learning & Foundations

(Each day: focus on one topic/theory + basic practical example + short revision)

Day	Topic (Theory + Practice)	Revision / Notes
1	Discrete Math – Set Theory & Logic	Flash definitions & Venn diagrams
2	Discrete Math – Relations & Functions	Practice proof examples
3	Discrete Math – Graphs & Trees basics	Draw/solve small graphs
4	Algorithms – Time Complexity & Asymptotic Notation	Compare common complexities
5	Algorithms – Sorting (Bubble, Insertion, Merge)	Code & test simple sorts
6	Algorithms – Searching (Binary, Linear)	Write search functions
7	Data Structures – Arrays & Linked Lists	Implement basic operations
8	Data Structures – Stacks & Queues	Practice applications
9	Data Structures – Trees (BSTs)	Insert/delete operations
10	Data Structures – Heaps & Priority Queues	Build small heaps
11	Data Structures – Graph Representations	BFS + DFS implementation
12	Operating Systems – Processes & Threads	Theory + small process scheduling problems
13	OS – Memory Management & Deadlocks	Solve examples
14	OS – File Systems & Scheduling Algorithms	Draw structures & analyze example schedules
15	DBMS – ER Modeling & Normalization	Draw ER diagrams + normalize a sample table
16	DBMS – SQL Queries (DDL/DML)	Write basic SQL queries
17	DBMS – Transactions & Concurrency Control	Practice example problems
18	DBMS – Indexing & Query Optimization	Analyze sample plans
19	Software Engg – SDLC Models	Summarize various models
20	Software Engg – Design Patterns basics	Draw key UML diagrams
21	Computer Networks – OSI & TCP/IP Stack	Sketch layers; basic functions
22	Networks – Routing & Switching	Solving routing problems
23	Networks – Network Security basics	Summarize encryption/authentication
24	Theory of Computation – Automata & Grammars	Write simple automata
25	TOC – Turing Machines & Decidability	Conceptual practice
26	Compiler Design – Lexical & Syntax Analysis	Sketch parse trees
27	Compiler – Semantic Analysis & Code Gen	Solve small examples
28	Compiler – Optimization techniques basics	Summarize strategies
29	Artificial Intelligence – Search Algorithms	Practice BFS/A*
30	AI – Machine Learning & Neural Networks basics	Write simple example models

Days 31–60: Intensive Practice & Revision

(Based on theory from earlier days, heavy on coding, problem-solving, and previous question papers)

Day	Practice Focus	Revision / Problem-Solving Tasks
31	Sorting/Search + DS (Q&A + small coding problems)	Flash practice on complexities
32	Trees & Graphs – BFS/DFS + Traversals (coding)	Practice tree path problems
33	Heaps, Hashing, Stacks/Queues practice	Implement in code challenges
34	Recursion & Dynamic Programming problems	Solve DP pattern questions
35	OS scheduling + memory systems Q&A	Timed MCQs
36	DBMS queries + Normalization + ACID questions	SQL practise set
37	Computer Networks – Subnets, TCP connection problems	Solve network scenario questions
38	Automata – Regular expressions + grammars	MCQs + example parsing
39	Algorithmic problem solving – divide & conquer & greedy	Solve 5 coding problems (LeetCode etc.)
40	Compiler Design – parsing + symbol table questions	Revise parse trees + memory tables
41	AI – Search algorithms + basic machine learning MCQs	Practice example problems
42	Software Engg – questions on SDLC, testing, patterns	Write mini-case study answers
43	Integrated revision – Discrete + DS + Algo all together	Timed mixed problem set
44	Networks + DBMS + OS combined testing + coding	3 small exercises
45	Full-length previous year paper 1	Attempt under timed exam conditions
46	Analyze previous paper answers & corrections	Write improved answers
47	Full-length paper 2	Timed + under exam conditions
48	Analyze paper 2	Focus on weak topics
49	Mixed coding challenge (trees, graphs, DP)	3 problems from each category
50	Theory – Memory management, ACID compliance, deadlocks	Revise notes
51	SQL plus optimization + network performance questions	Practice writing query optimization
52	OS principles: scheduling, concurrency, file system	MCQ practice
53	Automata & Compiler theories revision	Summarize major differences
54	AI & Software engineering combined testing	MCQs + short descriptive answers
55	Full-length previous paper 3	Under timed conditions
56	Analyze & rewrite answers from paper 3	Focus on presentation
57	Full-length previous paper 4	Time-managed session
58	Paper 4 analysis	Revision of theory + corrections
59	Mixed problem-solving day (coding + SQL + OS theory)	Choose weak points to revisit
60	Mock Test – Full theoretical + coding integration	End-of-phase analysis

Days 61–90: Final Revision & Mock Mastery

Day	Focus	Task
61	Full mock – coding + theory integrated	Review and error journal
62	Rewrite weak areas from mock	Flash notes update
63	Theory review – Discrete & Data Structures	Timed MCQs + short coding
64	DS & Algorithms deep dive	Solve 5 advanced problems
65	OS & Networks comprehensive overview	Write short answer explanations
66	DBMS & Compiler review	Coding: implement sample parser or optimizer
67	AI/ML + Software Engg synthesis	Practice summary answers
68	Mock Test – Previous Exam Full paper	Time-bound session
69	Analysis: Rework incorrect code and theory answers	Focus on accuracy and clarity
70	Review graphs/trees + SQL + OS combined day	Mixed coding + theory
71	Mock Test – Coding-only session	1 hr timed
72	Mock Test – Theory-only session	2 hrs timed
73	Write polished essays on Software Engg & Networks	Focus on conciseness
74	Mixed-day revision: DS + DBMS	Mini tasks + quizzes
75	Coding + theory combined practice	Pick top weak areas
76	Full mock – comprehensive test	3–4 hrs test, combined evaluation
77	Detailed mock analysis	Errors correction + final flashcards
78	Final revision – Algorithms + DS	Deep dive in weak points
79	Final revision – OS + Compiler + Networks	Short quizzes + revision notes
80	Final revision – DBMS + AI + SE	Theory + SQL + design blurbs
81	Mock Test – Full previous year paper comprehensive	Timed 3–4 hrs
82	Analyze + polish all outputs from mock	Refine answers
83	Final coding challenge set (5 selected problems)	Timed, stop-watch
84	Mock – Theory heavy session	Focus on short descriptive answers
85	Error review & re-practice weak coding patterns	Practice again
86	Mixed mock – short coding + theory	2-hr test
87	Final subject-specific flashcard revision	Quick recall session
88	Light mock & review day	Rest and final prep notes
89	Quick recap of all flashcards + formulae	Relaxed revision
90	Final "exam simulation" + confidence-building	3–4 hrs test + reflection + rest

Success Tips

Log daily performance – topics covered, problems solved, errors.
Review mocks thoroughly – understanding mistakes is key.
Use flashcards – theory and code patterns.
Time management drills – simulate strict timing.
Rest is essential – keep days 69, 88, 89 light to recharge.