9 Month Planner Computer Engineering(CS)
Introduction
Hi Warriors,
Please find a comprehensive study plan for your exam preparation. This Planner is for 9 months but you may modify it for 6 months (by studying more hours per day). The number of hours considered in this planner is 3 hours per day (on an average). For instance, if you see the Master planner below, you will find we need approx. 220250 hours during April + May + June. So if we study 3 hours, on an average, for 90 days = 270 hours, we can easily cover what’s given in the document.
Note: This planner is designed keeping in consideration students who have got top 100 ranks in GATE or any national level exam in the past few years.
Note: This plan is designed in consideration with students who have got top 100 ranks in GATE or any national level exam in the past few years
A similar plan is followed by many exam toppers and is highly recommended by most of The top faculties of the country. You will realise while going through it that a lot of research is gone In to make it helpful to you.
The following document contains
The following document contain
 Master plan
 Flow of a subject which should be followed
 How to make notes
 How to do Test Analysis
 How to do revison
 Subject wise( topic wise) time devotion plan
1.Master Plan
2. Flow of Studies for Any subject:
 Notes
 GATE que for past 10 years topic wise
 Topic wise test on aspiration.ai
 Subject tests on aspiration.ai
 Extra practice que + revision of subject
3.How to Make Notes:
 If you attend lectures of any faculty through gateflix then you can easily make notes. If you haven’t done so, go to online videos to do so. You may also go to Youtube: Khan academy, Nptel or the latest and most popular are Gateflix videos.
 Make notes neatly as they will be very very useful while revision in the last 30 days. Use 3 colour pen to indicate important, very important and very very important concepts.
 Make a separate handbook for formulas. In exams 40% questions are direct formala based or implied formula based. Problem with students is that they tend to mix up formula. If you have this handbook of formula ready and have revised the things atleast 2 times , I can gurantee you the 40 % marks.
 Don’t Xerox someone’s notes because the moment you write youself then you can memorise the concept for a longer duration.
 Leave one page Space after 2/3 pages or after every major chapter . This is to ensure that if you come across any vital formula or Information or short trick while refering tests or refernce book later then you may place That information in these spaces.
4.How to do a Test Analysis:
 Any test( Online or offline) need to taken in time frame.There is No point in taking the test without a time Limit.
 Don’t take any test without revision of Notes of the syllabus covered in the test. It will be a wastage if You just randomly take a test.
 Once the test time is over, don’t jump to answer Solution . Check the answer key and get To Know your score.
 Now follow a 3 stage process .
Stage 1: Go to the right ones and check wheteher you were confident of answering that question . If the answer is “yes” check the solution given in order to see which method was better( yours or the given in Book or online portal ). Adopt the best you like.
Stage 2: Go to questions which you got wrong. Try to fight with the question that why you got it wrong without looking at the solution yet. Try 3 or 4 times by re reading the question or even refer notes. Maximum time it’s a silly mistake. These silly Mistakes can’t be zeroed but can be reduced by practicing more .Refer notes again if needed. In case you are still not able to click after a lot of Slumber, try to open the solution and check your mistake. If it was a new concept to you, add in the void space you have kept in your notes. This will help to solve similar question again.
Stage 3: Now the turn of questions which are un attempted.This could be due to
 Not knowing The concept or due to lack of time. If it was conceptual ignorance , go to your faculty ( many online live class teachers are available , In case you don’t have one)and learn the concept.
 It was a lack of time issue try now and solve it. If you are taking a lot of Time try to memorise few steps so that if it appears in exam you will be able to do it fast. Other students might leave such question in exam , But you will probably dare to attempt such and score more.
 The key to successs in any entrance exam is solve More , analyse more. In each subject you should Solve almost 1000+ questions including past year Actual Exam questions, topic wise test, subject test and mock tests.
5. How To do Revision:
 Well this is dependent on the way you have prepared notes and how effectively have you done the Test Analysis.
 Go through the whole cycle again in this revision phase like NOTES > GATE QUESTIONS > Topic test > Subject Test > Extra questions (if any ).
 While Revising, don’t solve Each and every question from notes or tests. Try To randomly pick 20 questions from different pages or test( purely random) . If you are able to recall the logic of 16+ then you are good to go ahead. If you are Not able to solve more than 10 questions then it’s a re revision time. Follow step 2.
 Try to have abird eye view and See topics on which questions Are asked again and Again. Star mark them for making revision 2 and revision 3 effective.
6.SUBJECT WISE PLAN:
a. General Aptitude
Chapter 1  Numerical Ability  Numerical computation, numerical estimation, numerical reasoning, data interpretation  4 days 
Chapter 2  Verbal Ability  English grammar, sentence completion, verbal analogies, word groups, instructions, critical reasoning and verbal deductions  2 days 
Note: For the years 2014 to 2017 there have been 2 and 3 sets so we have taken the average weightage of the topics for the same
 Column 1 represent Time to study and make notes + Solving GATE Questions of that topic .
 The last 10 column represents year wise number questions( marks in Bracket ).
GA Master Plan

Hours  Remarks  
Notes + Gate Questions  22  
Topic test from Aspiration.ai  3  with Analysis  
Subject test from aspiration.ai  2  with Analysis  
revision overall  2  
Total  29hrs 
b. Engineering Maths
Chapter 1  Linear Algebra  Matrix Algebra, Type of matrices, Determinant, Cramer’s rule, Systems of linear equations, Rank of the equation, consistency of the equation, Eigen values and Eigen vectors. 
2 days 
Chapter 2  Probability & distribution  Sampling theorems, Conditional probability, Baye’s theorem, Random variables, Expectation & Variance, Discrete and continuous distributions, uniform, normal, xponential, Poisson, Binomial, Correlation and regression analysis, covariance, correlation coefficient, Mean, median, mode and standard deviation 
1 day 
Chapter 3  Calculus  Limits & continuity, Basic differentiation & integration, Mean value theorems, Theorems of integral calculus, Evaluation of definite and improper integrals, Partial Derivatives, Maxima and minima, ultiple integrals, Vector identities, Directional derivatives, Line, Surface and Volume integrals, Stokes, Gauss and Green’s theorems. 
3 days 
 Column 1 represent Time to study and make notes + Solving GATE Questions of that topic .
 The last 10 column represents year wise number questions( marks in Bracket ).
Maths

Hours  Remarks  
Notes + Gate Questions  15  
Topic test from Aspiration.ai  5  with Analysis  
Subject test from aspiration.ai  4  with Analysis  
revision overall  4  
Total  28 hrs 
c. Compiler Design
Chapter 1  Introduction to compilers  Language processing system, phases of compiler, analysis of program, lexical analysis, input buffering 
1 day 
Chapter 2  Parsing  Syntax analysis, role of parser, context free bgrammars, derivations, top down parsing, LL (1) grammar, LR parser, SLR parsing, LALR parsing, error handling 
3 days 
Chapter 3  Syntax directed translation  Introduction, synthesized attributes, syntax trees, translation schemes, topdown translation, runtime environment 
1 day 
Chapter 4  Intermediate code generation  Introduction, three address code 
2 days 
 Column 1 represent Time to study and make notes + Solving GATE Questions of that topic .
 The last 10 column represents year wise number of questions( marks in Bracket )
Compiler Design

Hours  Remarks  
Notes + Gate Questions  26  
Topic test from Aspiration.ai  4  with Analysis  
Subject test from aspiration.ai  3  with Analysis  
revision overall  4  
Total  37 hrs 
d. Computer Networks
Chapter 1  ISO OSI physical layer, LAN technologies  Introduction, computer networks, design issue of layers, network hardware and topology, transmission mode, reference models, layer functions, TCP/IP model, comparison of TCP/IP and OSI model, physical layer, transmission media, communication satellite 
2 days 
Chapter 2  Data link layer  Layer design issue, error detection and correction, error correcting codes, data link protocols, LLC protocol, ALOHA, IEEE802.3 and Ethernet 
2 days 
Chapter 3  Network and transport layer  Switching networks, congestion control, bridges, internetworking devices, IP addressing, Ipv4 and Ipv6, routing protocol, transport layer and its duties, connection, OSI transport protocol, subletting and super netting, IP datagrams and routing 
6 days 
Chapter 4  Application layer and network security  Session, presentation and application layer, digital signatures, firewalls, POP3, IMAP, DMSP 
2 days 
 Column 1 represent Time to study and make notes + Solving GATE Questions of that topic .
 The last 10 column represents year wise number questions( marks in Bracket ).
Computer Networks

Hours  Remarks  
Notes + Gate Questions  49  
Topic test from Aspiration.ai  5  with Analysis  
Subject test from aspiration.ai  3  with Analysis  
revision overall  6  
Total  63 hrs 
e. Computer Organization and Architecture
Chapter 1  Overview of computer system  Introduction, functional units, numbers and arithmetic operations, point representations, Booth’s algorithm, integer division, nonrestoring division algorithm 
2 days 
Chapter 2  Introduction  Introduction cycle, addressing modes, instruction formats, microgram med control, Wilkes design, horizontal and vertical microinstructions 
4 days 
Chapter 3  Memory organization  Introduction, memory hierarchy, characteristics, emiconductor RAM memories, virtual memory technology, advantages of using virtual memory, paging, segmentation and paged segments, secondary memory technology 
3 days 
Chapter 4  Input and output unit  I/O mapping and addressing modes, I/O processor, direct memory access, DMA operation, interrupt initiated I/O, data transfer techniques, responsibilities of I/O interface, IBM 370 I/O channel, polling, independent requesting, local communication 
1 day 
Chapter 5  Multiple processor organization  Flynn’s classification of computer organization, multiprocessor, parallel processing applications, multiprocessor architecture, loosely coupled multiprocessor, serial communication, synchronous and asynchronous transmission. 
1 day 
 Column 1 represent Time to study and make notes + Solving GATE Questions of that topic .
 The last 10 column represents year wise number of questions( marks in Bracket ).
COA Master Plan

Hours  Remarks  
Notes + Gate Questions  46  
Topic test from Aspiration.ai  5  with Analysis  
Subject test from aspiration.ai  3  with Analysis  
revision overall  5  
Total  59 hrs 
f. Digital Logic
Chapter 1  Number systems

Introduction, binary, octal and hexadecimal number system, binary codes, complements 
2 days 
Chapter 2  Boolean algebra and logic gates

Introduction, POS & SOP expressionskarnaugh map, logic gates, basic gates, universal gates, special purpose gates, implements of SOP & POS expression 
2 days 
Chapter 3  Combinational circuits

Introduction, adders, sutractors, multiplexer, DE multiplexer, decoder, encoder 
2 days 
Chapter 4  Sequential circuits

Introduction, flipflops, egisters, counters 
2 days 
 Column 1 represent Time to study and make notes + Solving GATE Questions of that topic .
 The last 10 column represents year wise number questions( marks in Bracket ).
Digital Master Plan

Hours  Remarks  
Notes + Gate Questions  32  
Topic test from Aspiration.ai  4  with Analysis  
Subject test from aspiration.ai  3  with Analysis  
revision overall  3  
Total  42 hrs 
g. Database Management System
Chapter 1  EntityRelationship model

Introduction, ER model, DBA, ER diagram 
3 days 
Chapter 2  Relational model

Levels of a database system, attributes and tuples of relation student, keys, relational database design, network data modelling concepts 
3 days 
Chapter 3  Transactions

Transactions, serializable schedule, recoverability, recoverable schedules, cascadeless schedules, implementation of isolation, transaction definition in SQL, testing for seralizability 
3 days 
Chapter 4  Quel

Quel, sequel, SQL, select statement, defining a null value, duplicate rows, character strings and dates, comparison operators, logical operators, character functions, working with dates, types of joins, group functions, subqueries, DML, queries, terminology used in relational database, table sal grade 
3 days 
Chapter 5  File structure  Records and record types, Btrees and other data structures, DBMS, existence dependencies 
3 days 
 Column 1 represent Time to study and make notes + Solving GATE Questions of that topic .
 The last 10 column represents year wise number questions( marks in Bracket ).
DBMS Master Plan

Hours  Remarks  
Notes + Gate Questions  40  
Topic test from Aspiration.ai  4  with Analysis  
Subject test from aspiration.ai  3  with Analysis  
revision overall  5  
Total  52 hrs 
h. Discrete Mathematics and Graph Theory
Chapter 1  Propositional logic

Statement/proposition, logical connectives and compound statements, tautologioes and contradictions, local equivalents, predicates and quantifiers, rules of inference, ules of inference for quantified statements 
3 days 
Chapter 2  Set theory, relations and functions

Set theory, operations on sets, artition, relations and its types, epresentation of relation, composition of relation, onnectivity relation, partial order relation and poset, hasse diagram, lattice, functions, composition of functions, groups 
5 days 
Chapter 3  Number theory and counting

Division, prime numbers, greatest common divisor, least common multiples, modular arithmetic, basic counting principles, inclusion and exclusion principle, permutations and combinations 
3 days 
Chapter 4  Graph theory

Terminology, irected graphs, subgraph, graph isomorphism, operations on graph, konigsberg bridge problem, coloring problem, bipartite graph, trees, planar and dual graphs, minimum spanning tree 
3 days 
 Column 1 represent Time to study and make notes + Solving GATE Questions of that topic .
 The last 10 column represents year wise number questions( marks in Bracket ).
DMGT

Hours  Remarks  
Notes + Gate Questions  50  
Topic test from Aspiration.ai  4  with Analysis  
Subject test from aspiration.ai  3  with Analysis  
revision overall  5  
Total  62 hrs 
i. Data Structures and Algorithms
Chapter 1  Introduction to data structures  Introduction, linked lists 
1 day 
Chapter 2  Stack and queue

Stack, queue, dequeue, abstract data types, performance analysis, asymptotic notation 
3 days 
Chapter 3  Sorting and searching

Sorting, sorting algorithms, searching 
4 days 
Chapter 4  Tree

Binary tree, header nodes: threads, binary search trees 
4 days 
Chapter 5  Heap and height balanced trees

Heap, tree searching, optimum search trees, general search trees, multiday search trees, B tree and B+ tree, digital search tree 
5 days 
Chapter 6  Introduction to graph theory

Terminology, directed graph, null graph, finite graph, trivial graphs, subgraphs, shortest path algorithm, linked representation of a graph, graph traversal, spanning forest, minimum spanning trees 
3 days 
Chapter 7  Design techniques

Greedy algorithm, divide and conquer algorithm, dynamic programming, backtracking 
4 days 
 Column 1 represent Time to study and make notes + Solving GATE Questions of that topic .
 The last 10 column represents year wise number questions( marks in Bracket ).
DSA Master Plan

Hours  Remarks  
Notes + Gate Questions  130  
Topic test from Aspiration.ai  7  with Analysis  
Subject test from aspiration.ai  5  with Analysis  
revision overall  5  
Total  147 hrs 
j. Theory of Computation
Chapter 1  Finite automata and regular expression

Alphabets, strings and languages, operations on languages, automata and grammar, finite automata, minimization of DFA, regular expression definition, regular grammars and language, nonregular language 
5 days

Chapter 2  Context free grammars and pushdown automata

CFG, derivation, parse tree and ambiguity, left recursion, left factoring and normal forms, PDA, deterministic and nondeterministic PDA, quivalence of PDAs and CFGs, context free languages and its properties 
5 days 
Chapter 3  Turing machine, unrestricted languages, complexity

Types of Turing machine, recursive and recursively innumerable languages, unrestricted grammars, linear bounded automata, Chomsky hierarchy, complexity theory, P, NP, NP hard and NP complete problems 
3 days 
 Column 1 represent Time to study and make notes + Solving GATE Questions of that topic .
 The last 10 column represents year wise number questions( marks in Bracket ).
TOC Master Plan

Hours  Remarks  
Notes + Gate Questions  53  
Topic test from Aspiration.ai  5  with Analysis  
Subject test from aspiration.ai  3  with Analysis  
revision overall  3  
Total  64 hrs 
k. Operating System
Chapter 1  Process and deadlock

Process concept, states, degree of multi programming, process control block, threads, CPU scheduling, scheduling algorithms, deadlock, procedure consumer problem, solution to IPC/synchronization, solution to producer consumer problem using semaphores, solution to reader and writer problem 
3 days 
Chapter 2  Memory management

Introduction, single partition allocation, external and internal fragmentation, virtual memory, page replacement, demand paging, page replacement, counting algorithms, allocation of frames, thrashing 
3 days 
Chapter 3  Interrupts

Introduction, interrupts, applications I/O interface, block and character devices, kernel I/O subsystems, performance, stable storage implementation 
3 days 
Chapter 4  File management

Introduction, file concept, access methods, single level directory, types of access, allocation methods, free space management, directory implementation 
2 days 
 Column 1 represent Time to study and make notes + Solving GATE Questions of that topic .
 The last 10 column represents year wise number questions( marks in Bracket ).
OS Master Plan

Hours  Remarks  
Notes + Gate Questions  65  
Topic test from Aspiration.ai  5  with Analysis  
Subject test from aspiration.ai  4  with Analysis  
revision overall  3  
Total  77 hrs 