You are on page 1of 3

Before starting solve 2 full-time papers

Looking into the books, understanding the concept & formulae

Algorithms:

#Horowitz & Sahani – complete, exercise


(yellow coloured front page)

6hr a day * 10 days

Automata theory:

Cohen – quite easy & its good for theory as well as problems
#Martin – good for exercise problems & you can get the solutions over net
Ullman – good for theory & some critical problems & again u can get the ans & some
exercise really really important, get the approach for solutions

All three books


5hr * 10 days

Discrete mathematics:
(collect formulae, write them down on blank pages & go on pasting them over room
walls, & read them daily)

#Tata Mc - ROSEN solve as much as u can


This single book to solve 5hr * 10

Graph theory - douglas west (first 4 chapters)

Trembley & Manoher ( first 2 chapters are good)

Overall

15 days

Data organization & program control & structure first two points:

(from start to end)


#Tanenbaum (green colour) - complete
(doorway to ur all data structures related part)
(try to cover it parallely with data structure part from sahani)

8hr * 3 days
C:
Systems:

Compilers
#Ullman, sethi - Principles of compilers (esp parsers & its techniques)
(very detailed explanation of every theory)

10 hr * 4 days

Operating systems:

(also covers virtual memory , segmentation, paging, I/O systesm)


#Galvin – complete & very good for synchronization (but get the problems from net or
try to solve sync problems from different papers)

Tanenbaum – MOS(modern operating systems) very good for os examples


( paging,memory management,cpu scheduling & utilization)

6 hr * 4 hr

Networking & distributed systems:

#Forouzan – Data communication & networking (do only networking part, & some
algorithms are sensibly explained in only this book eg “swith spanning tree”, execise
problems, protocols)
Also covers Internet structures

8 hr * 2 days

#Tanenbaum – very interesting & critical for problems esp data link & network layer
problems
(essential for net problems)

8 hr * 2 days

Databases:
#Navathe: good for SQL( & for general query languages) & normalization part ( it
includes some terrific techniques & tests to solve normalization problems)

5 hr * 2 days
#Korth: ER model & Transaction management

6 hr * 1 day

Computer Organization
#Zaki – pipelining & cache 10 hr * 1 day
Stallings – CPU design
Henssy patterson also

Digital logic 6 hr * 2days


Morris Mano – problems

350 hrs / 10 hrs = 35 days


I suggest give 40 days to get thorough knowledge
Have 2 phases

You might also like