Archive for November, 2011

  • Gate Books :: What to read and from Where : :

The success of Gate exam lies on to read subsequent topics from Standard Books. Generally in our Enginnering life we don’t get a chance to study these books or even we don’t know what the  ” Standard Books “ means . Here  the list of some standard books of Computer Science .

Students  should read one book thoroughly  rather consulting too many books. The choice of book should be one that give you clear inside about the subject and also simple and lucid so that we can understand basic things related to that subject (like Cohen book for Automata ). The links for most of these books are provided in the comment section.

Engineering Mathematics :

1.  Erwin Kreyszig  

Foundations of Computer Science :

1.  Al Aho and Jeff Ullman

2. How To Solve it –  George Pólya


1. Thomas H Cormen

2. Alfred V.Aho,Hopcroft and Jeffrey Ullman

3. Algorithms By S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani

4. How to solve it by computers ~R G Dromey

5. Fundamentals of Algorithms, by Horowitz , Sahni , Rajasekaran

6. Goodrich and Tamassia algorithm design , foundations , analysis and internet examples

C Programming Language :

The C Programming Language Book by– Dennis MacAlistair  Ritchie and Brian Kernighan


1. Fundamentals of Data Structures, Ellis Horowitz and Sartaj Sahni 

2. Mark Allen Weiss


1. Silverchatz and gagne ,

2. William Stalling


1. Andrew S. Tanenbaum

2. Kureso and Ross


1. Daniel I Cohen  (will find in this link )

2. John C Martin

3. Peter Linz

4. Introduction to Automata Theory By Jeffrey David Ullman

5. Michael Fredric Sipser


Compilers: Principles, Techniques, and Tools  – By Alfred Aho , Jeffrey D. Ullman, Ravi Sethi

Modern Compiler Implementation in C – By Andrew Appel


1. Elmasri-Navathe

2. Raghu Ramakrisnan

3. Korth-Sudarshan


1. Kenneth H. Rosen

2. Kolman ,Busby &Ross (Group theory )

3. Ralph P Grimaldi

4. C. L. Liu

5. Douglas West (Graph Theory)

6. Narsingh  Deo (Graph Theory)

7. J. P. Tremblay  and R. Manohar

8. Susanna S.Epp

9. Sheldon M Ross  ( Probability Theory )


M Morris Mano


1. Morris Mano

2. Zaky-Hamacher  ( C.Hamacher, Z.Vranesic and S.Zaky  ” Computer Organization ” )

3. Patterson . D.A. and Hennessy . J.L. –   “Computer Architecture :  A Quantitative Approach “

4. W.Stallings  –  ” Computer Organization and Architecture – Designing for Performance ”

5. Tanenbaum, A.S –  “Structured Computer Organization


1. Rajib Mall

2. Roger Pressman

~ Solution Manuals are available for each Books .

  • people can download these books from below library .

  • View this blog for CS-IT  E BOOKS

Previous year Gate questions with detail  solutions  and Practice Test-Papers:

1.   (2003,2004,2005 ) *

2.  (use for practice questions only)

3.    (2005 and 06) *

4.  (use for practice papers )

5.  gate_2007_cse_solutions    (2007) *

6.             (2008 ) *

7.   (2009) *

8. (2010) *

* Gate Questions and detailed Solutions are provided for these years .


* How many hours should you study per day ?

1. Out of the 24 hours available per day, sleep for 6 hours.

2. Out of the remaining 18 hours, spend 4 hours for life supporting  activities like, bathing, having food, prayer, yoga, Facebook , Computer- games , chatting with friends etc .

3. Out of the remaining 14 hours , study !!!!

* How to study ?

1.  First make a time table , and follow it every day.

2.  Take break at regular intervals. Study for 90 minutes at a stretch and then take 30 minutes break. During break get up from your chair, get out of your room and have some fresh air, do some stretching exercises, rotate your neck in all possible directions , massage your head, wash your face with cold water, massage your eyes,  drink a glass of water , have a light snack . After this u will feel fresh again to study continuously for another 90 minutes.

3.  Change subject after every break. Try to study as many subjects as possible every day. Don’t get bored by studying a single subject for the entire day. More over , studying many subjects every day , refreshes memory and u will not loose contact with the subjects. Otherwise, if u study for many days a single subject , by the time u finish the subject u will forget what ever u have studied before starting the current subject.


4.  Practice , Practice , Practice more questions everyday (Solutions to many many questions ).

5.  Revise , Revise , Revise !!!!

6.   Believe in your abilities . 🙂


This is what I think is required to crack GATE.
1>>Good technical knowledge
2>>Good understanding of Basic Concepts
3>>Ability to apply the knowledge and concepts on variety of problems

To Develop 1 and 2 you will need to read and understand reference
books, to develop 3 you will need to solve the problems. Now question
is from where to get the problems or the MCQs, the answer is the
problems are given at the back of every chapter in the reference
books, you will need to solve those problems,may be not all of them.
Problems reveal lot of truth and clear our misconception and false
convictions. And GATE has certain property that lot of Quesions in it
are based on concepts that are revealed in certain problems in
reference books. So its really really important to have a shot at the

Now here is the list of reference books that I used for preparation.
I started my preparation with discrete maths, and I would recommend
you also to start with this perticular subject because this is the
subject from where Computer Science spreads out. Understanding of this
subject is very important. I used following books:
1>>”Discrete maths and its applications” By Kenneth Rosen
This is an excellent book for GATE preps. Lot of problems are given at
the end of every chapter plus answers are also given to odd numbered
exercises. The explaination in this book is really very good and “easy
to understand”. This book is must read for GATE preps.
2>>book by Tremblay and Manohar
I recommend you to read this book after you have read Rosen’s book.
The contents in this book is hard to comprehend. You need to have your
basics cleared before you attempt this book. This book is also a “must
read”. I also have the lecture notes on discrete maths from some prof
at McGuire university the advanced counting and recurrence relation
part is good in these notes you can download them from my esnips


I recommend to you to read this subject along with Discrete maths or
after you have completed discrete maths. I used only one book for this
subject and found that to be more than enough for GATE.
1>>”Introduction to Algorithms” By T.H.Cormen et al.
This is “THE” book for Algorithms. The Book is simply brilliant, it
makes you understand every details of Algorithms. So this book is a
must read. Although I did not read the entire thing. Here is the list
of chapters that I had read. If you are interested of course you can read the entire book.
Chapter 1,2,3,4[excluding 4.4],6,7[excluding 7.3],8,10,11[excluding
11.5],12[excluding 12.4],18,22,23,24[excluding 24.4 and 24.5] for
NP-Completeness you can read 34 also.
In addition to this book I strongly recommend you to see the video
lectures from MIT. The lectures are given by Lieserson[who BTW is also
one of the authors of CLRS] and Erik demaine. The lectures are
absolutely brilliant. You may download them from
I did not read this subject exclusively. I mostly participated in
discussions in Algorithms and datastructures communities on orkut .
That is i think more than enough.
I initially tried to decipher Ullman’s book but I found the content
too much for my brain to comprehend. So I switched to “Introduction to
Computer Theory” By Daniel Cohen. The contents in this book are lucid.
Also solving or atleast attempting the problems in the exercises is a
must. But its really great if you could read Ullman.
I used Korth and Navathe for this. Initially I read korth because it
is lucid and then only for normalization i read Navathe. The database
design part in korth is difficult so read this part with utmost
concentration and you may require several readings before you begin to
understand things.

Read this from following books:
1>>Operating System Concepts By Galvin et al.
Attempt problems in Stallings they are very important especially
problems on memory management and virtual memory. In Galvin the theory
on memory management is excellent.
• Digital Design
Read “Digital Design” By morris mano

Read this from following books
1>>”Computer Architecture” By Morris mano

2>>”Computer Organization” By Zacky,hamacher

3>>”Computer Organization Hardware/Software Interface” By Hannessey
and Patterson
Read book 1 almost completely then read memory system from book 2 then
you can read
book 3, I had read only the performance measurement chapter from book
3 as it is not given in any other book and also solve numericals from

exercises they are very very important. I recommend you to read this
subject after “Digital Design”.
I had read this subject only from forouzan and had read some chapters
from Comer’s book. Attempt the exercises from forouzan they are
C programming
You read this from “the C programming language” by kernighan and
Ritchie that is more than enough plus spend some time in actually
programming in C that is the best way you can learn C.
I dont know C++ much and I did not read anything for C++. Dont be
spoiled, you can read C++ complete reference if you wish to.

Compiler Design
Did not read this subject at all. “People” say Ullman’s book is
excellent so you can read it from Ullman if you believe “People”.
In the final phase of your preps “try” to solve GATE papers. The
answers for the GATE papers are not present anywhere but still you
should attempt them anyway. This will give you confidence that you can
actually solve GATE.
You can read all the subjects given here you can skip one or two if
you dont have much time But more important thing is to “MASTER”
atleast 2 or 3 subjects. Also actively participate in discussions at
GATE CS or GATE CS/IT 2009 and Algorithms and Datastructures community in that helps alot in patching few loopholes in our concepts and enhancing your problem solving skills. Thats it guys,this much is I think enough to crack GATE. You can ofcourse Device your own methods  and set of books.

Just be confident you can do it!

These are few URLs Which I think “might” be helpful
1>>Opencourseware at MIT>>>>OCW
2>>Lots of computer science resources and e-books at >>>>>>esnips