Anda di halaman 1dari 4

Programming & Data Structure

 The C Programming language, Author’s Name: Brian W. Kernighan , Dennis

M. Ritchie, Edition: 2
 Classic Data Structures, Author’s Name: Debasis Samanta, Edition: 2
 Kurt Mehlhorn, "Algorithms and Data Structure", Springer - 2008.
 Peter Brass, "Advanced Data Structures", Cambridge university Press.

 Introduction to Algorithms, Author’s Name: Thomas H. Cormen, Charles E.
Leiserson, Ronald L. Rivest, and Clifford Stein, Edition: 3
 Horowitz and Sahani is another good book for algorithms
 Christos Papadimitriou , Umesh Vazirani , Sanjoy Dasgupta, "Algorithms", McGraw
Hill Education (India) Private Limited. ( Highly recommended )
 Bratley Paul, "Fundamentals Of Algorithmics" by Brassard Gilles, Prentice-Hall.
(Excellent reference text)
 Richard Johnsonbaugh, "Algorithms", Pearson

Operating Systems
 Book Name: Operating System Concepts, Author’s Name: Silberschatz, Galvin,
Gagne, Edition: 8
 Modern Operating System by Andrew Tanenbaum is also good book for OS.
It contains great number of problems. Also includes some of theory that is not
included in Galvin’s book.
 Operating Systems by Stallings also contains tricky problem use solution
manual if required. Good for Memory. Attempt problems in Stallings they are very
important especially problems on memory management and virtual memory.

 Database System Concepts, Author’s Name: Silberschatz, Sudarshan, Korth.
 Navathe
Book by Raghuramkrishnan is good for physical database organisation RA, TRC ,
SQL. Use solution manual if required.

Discrete Mathematics
 Discrete Mathematics and Its Applications by Kenneth H. Rosen
 Trembley-Manoher includes good theorems in Group Theory.
 Graph Theory : with applications to engineering and computer science
by Narsingh Deo is good.
 Douglas West for graph theory
 A first course in probability by Sheldon Ross - this is easy and efficient book for
basic probability theory.
 Discrete Mathematics,Probability Combinatorics, Set Theory &
Algebra by Seymour Lipschutz (Schaum's Outline).
 Erwin Kreyszig‘s book
 Book by K.D.Joshi on Discrete Maths has good derivations regarding
enumerating the relations.

 K. A. Ross and C. R. B. Wright, "Discrete Mathematics", 5th Education,

Pearson - 2012. (Primary Text, strongly advised to acquire a copy of the
 Norman L. Biggs, "Discrete Mathematics", Oxford University Press.
 Ralph P. Grimaldi, "Discrete and Combinatorial Mathematics", Pearson
 Richard A. Brualdi, "Introductory Combinatorics", 4th Edition, Pearson -
 Reinhard Diestel, "Graph Theory", Springer – 2010
 William Feller , "An Introduction to Probability Theory and its Applications",
Volume I & II, Wiley.
 V.K. Rohatgi, A.K. Md. E. Saleh, "An Introduction to Probability and
Statistics", 2nd Edition, Wiley.

Computer networks

 Computer Networking: A Top-Down Approach, Author’s Name: James F.

Kurose, Keith W. Ross, Edition: 6
 Forouzan book is good for frame formats TCP and IP header formats and
the exercises from forouzan are important
 Tanenbaum book is best for data link layer,network layer,transport layer.Solve
all the exercise take help of solution manual on if required.
 There have been questions in the past directly from Tanenbaum.
 William Stallings book could be useful for certain topics For Numerical

 Peterson & Davie, "Computer Networks, A Systems Approach", 2nd Ed.,

Morgan Kaufmann, 2000.
 Bertsekas Dimitri , Gallager Robert, "Data Networks", 2nd Edition, Phi

 Morris Mano book is all you would need for gate it contains all the things
and bible for Digital Logic.

 Charles H. Roth, "Fundamentals of Logic design", 4th Edition, Jaico

Publishing House.
 Harris & Harris, "Digital Design and Computer Architecture", 2nd Edition,
Morgan Kaufmann. ( strongly advised to acquire a copy of the Textbook)
 Katz Randy H, Borriello Gaetano, "Contemporary logic design", 2nd Edition,
Prentice-Hall. The 1994 edition is more than sufficient.


 MORRIS MANO book of C A O is good as it has some good theory and

problems for addressing
 modes , D m a , etc.
 Pipe lining , Cache, and addressing modes are important topics and should be
studied in detail.
 Hamacher book good theory for Pipelining and detailed discussion in Cache
 Computer Architecture – A Quantitative Approach – Hennessy and
Patterson is also good book used in IIT's.
 Here another good book by William Stallings.
 J.P.Hayes book also has good theory on Microprograming and Hard-wired
control as well as pipelining and Floating-Point arithmetic.

 David A. Patterson and John L. Hennessy, "Computer Organization and

Design: The Hardware/Software Interface", Elsevier.
 Harris & Harris, "Digital Design and Computer Architecture", 2nd edition,
Morgan Kaufmann. ( strongly advised to acquire a copy of the Textbook)
 David A Patterson, John L. Hennessy, "Computer Architecture: A
Quantitative Approach", 4th Edition, Morgan Kaufmann, 2009.
 Linda Null, Julia Lobur, "The Essentials of Computer Organization and
Architecture", 4th Edition, Jones & Bartlett India Private Limited.
Theory of Computation
1. Harry R. Lewis and Christos H. Papadimitriou, "Elements of the Theory of
Computation", Pearson Education.
2. John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman, "Introduction to
Automata Theory, Languages, and Computation", 3rd edition ,Pearson
3. Dexter C. Kozen, "Automata and Computability", Undergraduate Texts in
Computer Science, Springer.
4. Michael Sipser, "Introduction to the Theory of Computation", 3rd Edition,
5. Thomas sudkamp, "Languages and Machines", 3rd Edition, Pearson
Education. ( Highly recommended)
6. Alan P. Parkes, "A Concise Introduction to Languages and Machines",
7. Elaine A. Rich, "Automata, computability and complexity: Theory and
Applications", 1st Edition, Pearson Education - 2012.
Compiler Design
1. Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman, "Compilers: Principles,
Techniques and Tools", Pearson.
2. Andrew W. Appel, "Modern Compiler Implementation in C/Java", Revised
Edition, Cambridge University Press.
3. Keith D. Cooper, Linda Torczon, "Engineering a Compiler", 2nd Edition,