| Book | Description |
|---|---|
| Introduction to Algorithms, C.L.R.S. | Cormen covers entire GATE syllabus (and much more) in Algorithms as well as Data Structures. Language is simple for most part but some mathematics is required to understand the analysis parts. (This book is only for learning algorithms and theory of data structures and there is no sample programs given in it) |
| Fundamentals of Computer Algorithms, Rajasekaran, Sahni, Horowitz | This book is Mini version of Cormen’s book , this cover almost everything with short discussions ,which is written in Cormen with more pages.
Use this book along with NPTEL lecture of Professor Naveen Garg . Actually if u see prof Garg’s Nptel upon DS you will find slides are taken from this book. Slides are available online in the following link: |
| Design & Analysis of Computer Algorithms, Aho, Hopcroft, Ullman | Another classic book for algorithms. |
| Book | Desciption |
|---|---|
| Database Systems, Elmasri, Navathe | Covers entire GATE syllabus and especially good for file structures and normalization |
| Database Systems, Connolly, Begg | Covers entire GATE syllabus and is easy to understand. |
| Database Management Systems, Raghu Ramakrishnan | Another very good book especially for Transaction management and Normalization. |
| Database System, Widom, Ullman, Garcia-Molina | Another very good book. |
| Database System Concepts, Silberschatz | Very good book but English is bit high standard |
| Book | Description |
|---|---|
| Operating System Concepts, Silberschatz, Galvin | Very good for learning theory in OS. English is good to understand. Writing style is pretty easy and fun. Enough for GATE |
| Modern Operating Systems, Tanenbaum | The Book , but if you read Galvin it is ok , read Tanenbaum for more Knowledge. It contains great number of problems. Also includes some of theory that is not included in Galvin’s book. |
| Book | Description |
|---|---|
| Peter Linz | Most recommended one for GATE |
| Book | Description |
|---|---|
| Introduction to Algorithms, C.L.R.S. | Cormen covers entire GATE syllabus (and much more) in Algorithms as well as Data Structures. Language is simple for most part but some mathematics is required to understand the analysis parts. (This book is only for learning algorithms and theory of data structures and there is no sample programs given in it) |
| Fundamentals of Computer Algorithms, Rajasekaran, Sahni, Horowitz | This book is Mini version of Cormen’s book , this cover almost everything with short discussions ,which is written in Cormen with more pages.
Use this book along with NPTEL lecture of Professor Naveen Garg . Actually if u see prof Garg’s Nptel upon DS you will find slides are taken from this book. Slides are available online in the following link: |
| Design & Analysis of Computer Algorithms, Aho, Hopcroft, Ullman | Another classic book for algorithms. |
| Book | Desciption |
|---|---|
| Database Systems, Elmasri, Navathe | Covers entire GATE syllabus and especially good for file structures and normalization |
| Database Systems, Connolly, Begg | Covers entire GATE syllabus and is easy to understand. |
| Database Management Systems, Raghu Ramakrishnan | Another very good book especially for Transaction management and Normalization. |
| Database System, Widom, Ullman, Garcia-Molina | Another very good book. |
| Database System Concepts, Silberschatz | Very good book but English is bit high standard |
| Book | Description |
|---|---|
| Operating System Concepts, Silberschatz, Galvin | Very good for learning theory in OS. English is good to understand. Writing style is pretty easy and fun. Enough for GATE |
| Modern Operating Systems, Tanenbaum | The Book , but if you read Galvin it is ok , read Tanenbaum for more Knowledge. It contains great number of problems. Also includes some of theory that is not included in Galvin’s book. |
| Book | Description |
|---|---|
| Peter Linz | Most recommended one for GATE |
GATECSE