Arjun Suresh (talk | contribs) (→General Aptitude) |
Arjun Suresh (talk | contribs) |
||
Line 1: | Line 1: | ||
==Algorithms & Data Structures == | ==Algorithms & Data Structures == | ||
− | + | ||
<b> Algorithms:</b> | <b> Algorithms:</b> | ||
<ul> | <ul> | ||
Line 43: | Line 43: | ||
==Databases== | ==Databases== | ||
<div> | <div> | ||
− | |||
<ul> | <ul> | ||
<li> ER-model, Relational model (relational algebra, tuple calculus) </li> | <li> ER-model, Relational model (relational algebra, tuple calculus) </li> | ||
Line 82: | Line 81: | ||
==Compiler Design== | ==Compiler Design== | ||
− | < | + | <div> |
<ul> | <ul> | ||
<li>Lexical analysis, Parsing </li> | <li>Lexical analysis, Parsing </li> | ||
<li> Syntax directed translation, Runtime environments </li> | <li> Syntax directed translation, Runtime environments </li> | ||
<li>Intermediate and target code generation, Basics of code optimization. </li> | <li>Intermediate and target code generation, Basics of code optimization. </li> | ||
− | </ul> | + | </ul></div> |
{| class="wikitable" | {| class="wikitable" | ||
! Book | ! Book | ||
Line 103: | Line 102: | ||
==Operating Systems== | ==Operating Systems== | ||
− | < | + | <div> |
<ul> | <ul> | ||
<li> Processes, Threads, Inter-process communication </li> | <li> Processes, Threads, Inter-process communication </li> | ||
Line 111: | Line 110: | ||
<li> Memory management and virtual memory </li> | <li> Memory management and virtual memory </li> | ||
<li> File systems, I/O systems, Protection and security. </li> | <li> File systems, I/O systems, Protection and security. </li> | ||
− | </ul> | + | </ul></div> |
{| class="wikitable" | {| class="wikitable" | ||
! Book | ! Book | ||
Line 130: | Line 129: | ||
==Theory of Computation== | ==Theory of Computation== | ||
− | < | + | <div> |
<ul> | <ul> | ||
<li> Regular languages and finite automata </li> | <li> Regular languages and finite automata </li> | ||
Line 136: | Line 135: | ||
<li>Recursively enumerable sets and Turing machines</li> | <li>Recursively enumerable sets and Turing machines</li> | ||
<li> Undecidability. </li> | <li> Undecidability. </li> | ||
− | </ul> | + | </ul></div> |
{|class="wikitable" | {|class="wikitable" | ||
!Book | !Book | ||
Line 164: | Line 163: | ||
==CO & Architecture== | ==CO & Architecture== | ||
<div> | <div> | ||
− | |||
<ul> | <ul> | ||
<li> Machine instructions and addressing modes</li> | <li> Machine instructions and addressing modes</li> | ||
Line 186: | Line 184: | ||
| | | | ||
|- | |- | ||
− | | [http://www.groupes.polymtl.ca/inf2610/documentation/ComputerSystemBook.pdf Computer Systems: A Programmers perspective] | + | | [http://www.groupes.polymtl.ca/inf2610/documentation/ComputerSystemBook.pdf ''Computer Systems: A Programmers perspective''] |
| This is a really good book in perspective of architecture as a simple view of how the actual hardware is organised is given. Apart from the classical confusing diagrams, this book has simple ones which is quite clear in its meaning. The explanation for pipeline execution and hazards are really good. This book is no longer in print, but you can get its pdf by clicking in the link provided. Highly recommended if you have time as this covers many of the other CS subjects as well. | | This is a really good book in perspective of architecture as a simple view of how the actual hardware is organised is given. Apart from the classical confusing diagrams, this book has simple ones which is quite clear in its meaning. The explanation for pipeline execution and hazards are really good. This book is no longer in print, but you can get its pdf by clicking in the link provided. Highly recommended if you have time as this covers many of the other CS subjects as well. | ||
|} | |} | ||
Line 195: | Line 193: | ||
==Computer Networks== | ==Computer Networks== | ||
<div> | <div> | ||
− | |||
<ul> | <ul> | ||
<li> ISO/OSI stack, LAN technologies (Ethernet, Token ring) </li> | <li> ISO/OSI stack, LAN technologies (Ethernet, Token ring) </li> | ||
Line 208: | Line 205: | ||
Description | Description | ||
|- | |- | ||
− | |[http://www.flipkart.com/computer-networks/p/itmdxcfuqyqjryxa?pid=DGBDNY382GZTKGNQ&otracker=from-search&srno=t_1&query=davie+networks&ref=47dcd318-fc8e-4b8a-922a-000ea8ee9b96 Computer Networks | + | |[http://www.flipkart.com/computer-networks/p/itmdxcfuqyqjryxa?pid=DGBDNY382GZTKGNQ&otracker=from-search&srno=t_1&query=davie+networks&ref=47dcd318-fc8e-4b8a-922a-000ea8ee9b96 ''Computer Networks''] |
+ | Peterson, Davie | ||
| Most recommended for GATE | | Most recommended for GATE | ||
|- | |- | ||
− | |[http://www.flipkart.com/data-comm-netw-5e-global-ed-english-5th/p/itmdhbyx8cpfhzge?pid=9781259064753&ref=7829042b-d739-4891-a50e-2bbb26b6b223&srno=t_1&otracker=from-search&query=Forouzan+computer+networks Data Communication & Networks | + | |[http://www.flipkart.com/data-comm-netw-5e-global-ed-english-5th/p/itmdhbyx8cpfhzge?pid=9781259064753&ref=7829042b-d739-4891-a50e-2bbb26b6b223&srno=t_1&otracker=from-search&query=Forouzan+computer+networks ''Data Communication & Networks''] |
+ | Forouzan | ||
| Good book with Basics clear | | Good book with Basics clear | ||
|- | |- | ||
− | |[http://www.flipkart.com/computer-networks-5th/p/itmdkzrvw2xcanwg?pid=9788131787571&otracker=from-search&srno=t_1&query=computer+networks+tanenbaum&ref=10a83716-8095-4159-bc5b-c32f0f91ca42 Computer Netwroks | + | |[http://www.flipkart.com/computer-networks-5th/p/itmdkzrvw2xcanwg?pid=9788131787571&otracker=from-search&srno=t_1&query=computer+networks+tanenbaum&ref=10a83716-8095-4159-bc5b-c32f0f91ca42 ''Computer Netwroks''] |
+ | Tanenbaum, Wetherall | ||
+ | | One can not neglect the amazing book by tanenbaum. It contains everything in a very well written way. It is amusing and `it deals with issues in a manner you want to do. If you are starting the subject, go with it. It is not recommended for last time reading. Keep making good notes if you read his book. | ||
+ | |- | ||
+ | |[http://www.flipkart.com/computer-networking-top-down-approach-english-5th/p/itmdatheqysd3cfn?pid=9788131790540&otracker=from-search&srno=t_1&query=computer+networks+by+kurose&ref=d9a4f1e3-0730-4157-9c45-e7fc3d80defb ''Computer Networking: A Top-Down Approach''] | ||
+ | Kurose | ||
|Kurose is best for Almost all fundamental concept with clear figure and very understandable manners | |Kurose is best for Almost all fundamental concept with clear figure and very understandable manners | ||
− | |||
− | |||
− | |||
|} | |} | ||
Line 226: | Line 227: | ||
==Programming== | ==Programming== | ||
<div> | <div> | ||
− | |||
<ul> | <ul> | ||
<li> Programming in C </li> | <li> Programming in C </li> | ||
Line 237: | Line 237: | ||
Description | Description | ||
|- | |- | ||
− | |[http://www.flipkart.com/search?q=ritchie&as=off&as-show=off&otracker=start The C Programming Language | + | |[http://www.flipkart.com/search?q=ritchie&as=off&as-show=off&otracker=start ''The C Programming Language''] |
+ | Kernighan, Ritchie | ||
|No comments- This is the best. To really understand the working of C, you must read this book. If you find this book tough, that means you have to correct your concepts by talking to knowledgeable people. Many local books, skips difficult to digest concepts and make easy to read books- but to get everything you have to follow this book. | |No comments- This is the best. To really understand the working of C, you must read this book. If you find this book tough, that means you have to correct your concepts by talking to knowledgeable people. Many local books, skips difficult to digest concepts and make easy to read books- but to get everything you have to follow this book. | ||
|- | |- | ||
− | |[http://www.flipkart.com/data-structures-using-c-english-1st/p/itmeygjhmkg77xzy?pid=9788131702291&otracker=from-search&srno=t_2&query=tannenbaum+algorithms&ref=a2db40fb-5a65-4c3c-a319-a048634938b5 Data Structures Using C | + | |[http://www.flipkart.com/data-structures-using-c-english-1st/p/itmeygjhmkg77xzy?pid=9788131702291&otracker=from-search&srno=t_2&query=tannenbaum+algorithms&ref=a2db40fb-5a65-4c3c-a319-a048634938b5 ''Data Structures Using C''] |
+ | Aaron M. Tenenbaum | ||
| For most of the data structure concepts | | For most of the data structure concepts | ||
Line 250: | Line 252: | ||
==Digital Logic== | ==Digital Logic== | ||
<div> | <div> | ||
− | |||
<ul> | <ul> | ||
<li>Logic functions, Minimization </li> | <li>Logic functions, Minimization </li> | ||
Line 262: | Line 263: | ||
Description | Description | ||
|- | |- | ||
− | | [http://www.flipkart.com/digital-logic-computer-design-english-1st/p/itmdyughsrncfvsg?pid=9788177584097&otracker=from-search&srno=t_1&query=+by+morris+mano&ref=2dc66827-d61c-489b-9270-467f6954e5b4 Digital Logic & Computer Design | + | | [http://www.flipkart.com/digital-logic-computer-design-english-1st/p/itmdyughsrncfvsg?pid=9788177584097&otracker=from-search&srno=t_1&query=+by+morris+mano&ref=2dc66827-d61c-489b-9270-467f6954e5b4 ''Digital Logic & Computer Design''] |
+ | Morris Mano | ||
| No Comment… One and only… | | No Comment… One and only… | ||
Line 272: | Line 274: | ||
==Information Systems and Software Engineering== | ==Information Systems and Software Engineering== | ||
<div> | <div> | ||
− | |||
<ul> | <ul> | ||
<li>Information gathering, requirement and feasibility analysis data flow diagrams </li> | <li>Information gathering, requirement and feasibility analysis data flow diagrams </li> | ||
Line 284: | Line 285: | ||
Description | Description | ||
|- | |- | ||
− | |[http://www.flipkart.com/software-engineering-english-6th/p/itmdx925vgduvhzs?pid=9780070701137&otracker=from-search&srno=t_1&query=software+engineering+by+pressman&ref=7a20efc8-6a93-494b-9de1-93e250b26fab Software Engineering | + | |[http://www.flipkart.com/software-engineering-english-6th/p/itmdx925vgduvhzs?pid=9780070701137&otracker=from-search&srno=t_1&query=software+engineering+by+pressman&ref=7a20efc8-6a93-494b-9de1-93e250b26fab ''Software Engineering''] |
+ | Pressman | ||
| Just see the GATE topics from this bible. | | Just see the GATE topics from this bible. | ||
|} | |} | ||
Line 293: | Line 295: | ||
==Web technologies== | ==Web technologies== | ||
<div> | <div> | ||
− | |||
<ul> | <ul> | ||
<li> HTML, XML </li> | <li> HTML, XML </li> | ||
Line 305: | Line 306: | ||
== Engineering Mathematics== | == Engineering Mathematics== | ||
===Mathematical Logic=== | ===Mathematical Logic=== | ||
− | |||
<ul> | <ul> | ||
<li>Propositional Logic </li> | <li>Propositional Logic </li> | ||
Line 313: | Line 313: | ||
===Probability=== | ===Probability=== | ||
− | |||
<ul> | <ul> | ||
<li>Conditional Probability </li> | <li>Conditional Probability </li> | ||
Line 325: | Line 324: | ||
Description | Description | ||
|- | |- | ||
− | |[http://www.flipkart.com/first-course-probability-english-9th/p/itmeyhmrscqsytep?pid=9789332519077&otracker=from-search&srno=t_1&query=ross+probability&ref=a6c054ef-d7e6-4e19-a26b-8f1a45e83955 A First Course in Probability | + | |[http://www.flipkart.com/first-course-probability-english-9th/p/itmeyhmrscqsytep?pid=9789332519077&otracker=from-search&srno=t_1&query=ross+probability&ref=a6c054ef-d7e6-4e19-a26b-8f1a45e83955 ''A First Course in Probability''] |
+ | Ross | ||
|Sheldon ross’s book (1st course in Probability) is undoubtedly very good.But you have to read this book very deeply page by page. | |Sheldon ross’s book (1st course in Probability) is undoubtedly very good.But you have to read this book very deeply page by page. | ||
|} | |} | ||
Line 331: | Line 331: | ||
===Set Theory & Algebra=== | ===Set Theory & Algebra=== | ||
− | |||
<ul> | <ul> | ||
<li> Sets, Relations, Functions </li> | <li> Sets, Relations, Functions </li> | ||
Line 343: | Line 342: | ||
Description | Description | ||
|- | |- | ||
− | |[http://www.flipkart.com/discrete-mathematics-its-applications-combinatorics-graph-theory-english-7th/p/itmdwxxszhczjrnf?pid=9780070681880&otracker=from-search&srno=t_1&query=discrete+mathematics+and+its+applications+by+kenneth+h.rosen&ref=d9721371-0168-4553-a128-c337b7c0cbe7 Discrete Mathematics and Its Applications with Combinatorics and Graph Theory | + | |[http://www.flipkart.com/discrete-mathematics-its-applications-combinatorics-graph-theory-english-7th/p/itmdwxxszhczjrnf?pid=9780070681880&otracker=from-search&srno=t_1&query=discrete+mathematics+and+its+applications+by+kenneth+h.rosen&ref=d9721371-0168-4553-a128-c337b7c0cbe7 ''Discrete Mathematics and Its Applications with Combinatorics and Graph Theory''] |
+ | Rosen | ||
| | | | ||
|} | |} | ||
Line 349: | Line 349: | ||
===Combinatory=== | ===Combinatory=== | ||
− | |||
<ul> | <ul> | ||
<li>Permutations, Combinations </li> | <li>Permutations, Combinations </li> | ||
Line 355: | Line 354: | ||
<li> Generating functions, recurrence relations, asymptotics </li> | <li> Generating functions, recurrence relations, asymptotics </li> | ||
</ul></div> | </ul></div> | ||
+ | |||
+ | |||
===Graph Theory=== | ===Graph Theory=== | ||
<div> | <div> | ||
− | |||
<ul> | <ul> | ||
<li>Connectivity, spanning trees</li> | <li>Connectivity, spanning trees</li> | ||
Line 369: | Line 369: | ||
Description | Description | ||
|- | |- | ||
− | |[http://www.flipkart.com/graph-theory-applications-engineering-computer-science-english-new/p/itmdytcjrqqcyxgm?pid=9788120301450&ref=a48bd004-a410-4e6a-9581-570a3f31b5c4&srno=t_1&otracker=from-search&query=graph+theory+narsingh+deo Graph Theory With Applications To Engineering And Computer Science | + | |[http://www.flipkart.com/graph-theory-applications-engineering-computer-science-english-new/p/itmdytcjrqqcyxgm?pid=9788120301450&ref=a48bd004-a410-4e6a-9581-570a3f31b5c4&srno=t_1&otracker=from-search&query=graph+theory+narsingh+deo ''Graph Theory With Applications To Engineering And Computer Science''] |
+ | Deo | ||
| | | | ||
|} | |} | ||
Line 375: | Line 376: | ||
===Linear Algebra=== | ===Linear Algebra=== | ||
− | <div> | + | <div><ul> |
− | <ul> | ||
<li>Algebra of matrices, determinants </li> | <li>Algebra of matrices, determinants </li> | ||
<li> Systems of linear equations </li> | <li> Systems of linear equations </li> | ||
Line 386: | Line 386: | ||
Description | Description | ||
|- | |- | ||
− | |[http://www.flipkart.com/linear-algebra-its-applications-english-4th/p/itmey7qhzmragaty?pid=9788131501726&otracker=from-search&srno=t_1&query=gilbert+strang&ref=35d0c899-dc36-4bb1-ae4d-92cf055fbf5e Linear Algebra and its Applications | + | |[http://www.flipkart.com/linear-algebra-its-applications-english-4th/p/itmey7qhzmragaty?pid=9788131501726&otracker=from-search&srno=t_1&query=gilbert+strang&ref=35d0c899-dc36-4bb1-ae4d-92cf055fbf5e ''Linear Algebra and its Applications''] |
+ | Gilbert Strang | ||
| | | | ||
|- | |- | ||
− | |[http://www.flipkart.com/higher-engineering-mathematics-english-43rd/p/itmczyhpmhhtqnsa?pid=9788174091956&ref=04f4284d-0b23-4ee9-8ec8-575200059f10&srno=t_1&otracker=from-search&query=bs+grewal+engineering+mathematics Higher Engineering Mathematics | + | |[http://www.flipkart.com/higher-engineering-mathematics-english-43rd/p/itmczyhpmhhtqnsa?pid=9788174091956&ref=04f4284d-0b23-4ee9-8ec8-575200059f10&srno=t_1&otracker=from-search&query=bs+grewal+engineering+mathematics ''Higher Engineering Mathematics''] |
+ | Grewal | ||
| | | | ||
|} | |} | ||
Line 395: | Line 397: | ||
===Numerical Methods=== | ===Numerical Methods=== | ||
− | <div | + | <div> |
<ul> | <ul> | ||
<li>LU decomposition for systems of linear equations </li> | <li>LU decomposition for systems of linear equations </li> | ||
Line 401: | Line 403: | ||
<li> Numerical integration by trapezoidal and Simpson’s rules </li> | <li> Numerical integration by trapezoidal and Simpson’s rules </li> | ||
</ul></div> | </ul></div> | ||
+ | |||
+ | |||
===Calculus=== | ===Calculus=== | ||
<div> | <div> | ||
− | |||
<ul> | <ul> | ||
<li> Limit, Continuity & differentiability </li> | <li> Limit, Continuity & differentiability </li> | ||
Line 413: | Line 416: | ||
==General Aptitude== | ==General Aptitude== | ||
===Numerical Ability=== | ===Numerical Ability=== | ||
− | <div | + | <div> |
<ul> | <ul> | ||
<li>Numerical computation </li> | <li>Numerical computation </li> | ||
Line 424: | Line 427: | ||
Description | Description | ||
|- | |- | ||
− | |[http://www.flipkart.com/quantitative-aptitude-competitive-examinations-english-17th/p/itmdytga2sgpggmg?pid=9788121924986&ref=fa36fcb4-078c-4280-b9c8-d849701e4a98&srno=t_1&otracker=from-search&query=agrewal+aptitude Quantitative Aptitude For Competitive Examinations | + | |[http://www.flipkart.com/quantitative-aptitude-competitive-examinations-english-17th/p/itmdytga2sgpggmg?pid=9788121924986&ref=fa36fcb4-078c-4280-b9c8-d849701e4a98&srno=t_1&otracker=from-search&query=agrewal+aptitude ''Quantitative Aptitude For Competitive Examinations''] |
+ | Aggarwal | ||
| | | | ||
|} | |} | ||
Line 430: | Line 434: | ||
===Verbal Ability=== | ===Verbal Ability=== | ||
− | <div | + | <div> |
<ul> | <ul> | ||
<li>English grammar, sentence completion </li> | <li>English grammar, sentence completion </li> |
Algorithms:
Data Structures:
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 |
Description |
---|---|
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 |
---|---|
Compilers : Principles, Techniques, & Tools
Aho, Sethi, Ulman, Lam |
One and only book. If you find the explanations tough, start looking at the given examples, they are easy to follow |
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 |
---|---|
An Introduction To Formal Languages And Automata
Peter Linz |
Most recommended one for GATE |
Introduction to Theory of Computation
Sipser |
Sipser is a quick and comprehensive guide. It is recommended to be read after you have grip on the subject. |
Introduction To Computer Theory
Cohen |
Cohen can be read if very good detailed analysis is required. SPOON FEEDING ! |
Introduction to Automata Theory, Languages, and Computation
Hopcroft |
In most colleges you will find this book as a Main book , but believe me within Cohen or Linz, if you read any one of them , Enough! |
Book |
Description |
---|---|
Computer Organization
Vranesic, Zaky, Hamacher |
|
Computer Organization and Architecture : Designing for Performance
Stallings |
|
Computer Systems: A Programmers perspective | This is a really good book in perspective of architecture as a simple view of how the actual hardware is organised is given. Apart from the classical confusing diagrams, this book has simple ones which is quite clear in its meaning. The explanation for pipeline execution and hazards are really good. This book is no longer in print, but you can get its pdf by clicking in the link provided. Highly recommended if you have time as this covers many of the other CS subjects as well. |
Book |
Description |
---|---|
Computer Networks
Peterson, Davie |
Most recommended for GATE |
Data Communication & Networks
Forouzan |
Good book with Basics clear |
Computer Netwroks
Tanenbaum, Wetherall |
One can not neglect the amazing book by tanenbaum. It contains everything in a very well written way. It is amusing and `it deals with issues in a manner you want to do. If you are starting the subject, go with it. It is not recommended for last time reading. Keep making good notes if you read his book. |
Computer Networking: A Top-Down Approach
Kurose |
Kurose is best for Almost all fundamental concept with clear figure and very understandable manners |
Book |
Description |
---|---|
The C Programming Language
Kernighan, Ritchie |
No comments- This is the best. To really understand the working of C, you must read this book. If you find this book tough, that means you have to correct your concepts by talking to knowledgeable people. Many local books, skips difficult to digest concepts and make easy to read books- but to get everything you have to follow this book. |
Data Structures Using C
Aaron M. Tenenbaum |
For most of the data structure concepts |
Book |
Description |
---|---|
Digital Logic & Computer Design
Morris Mano |
No Comment… One and only… |
Book |
Description |
---|---|
Software Engineering
Pressman |
Just see the GATE topics from this bible. |
Book |
Description |
---|---|
A First Course in Probability
Ross |
Sheldon ross’s book (1st course in Probability) is undoubtedly very good.But you have to read this book very deeply page by page. |
Book |
Description |
---|---|
Discrete Mathematics and Its Applications with Combinatorics and Graph Theory
Rosen |
Book |
Description |
---|---|
Graph Theory With Applications To Engineering And Computer Science
Deo |
Book |
Description |
---|---|
Linear Algebra and its Applications
Gilbert Strang |
|
Higher Engineering Mathematics
Grewal |
Book |
Description |
---|---|
Quantitative Aptitude For Competitive Examinations
Aggarwal |
Book |
Description |
---|---|
Quantitative Aptitude For Competitive Examinations, Aggarwal |
Algorithms:
Data Structures:
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 |
Description |
---|---|
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 |
---|---|
Compilers : Principles, Techniques, & Tools
Aho, Sethi, Ulman, Lam |
One and only book. If you find the explanations tough, start looking at the given examples, they are easy to follow |
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 |
---|---|
An Introduction To Formal Languages And Automata
Peter Linz |
Most recommended one for GATE |
Introduction to Theory of Computation
Sipser |
Sipser is a quick and comprehensive guide. It is recommended to be read after you have grip on the subject. |
Introduction To Computer Theory
Cohen |
Cohen can be read if very good detailed analysis is required. SPOON FEEDING ! |
Introduction to Automata Theory, Languages, and Computation
Hopcroft |
In most colleges you will find this book as a Main book , but believe me within Cohen or Linz, if you read any one of them , Enough! |
Book |
Description |
---|---|
Computer Organization
Vranesic, Zaky, Hamacher |
|
Computer Organization and Architecture : Designing for Performance
Stallings |
|
Computer Systems: A Programmers perspective | This is a really good book in perspective of architecture as a simple view of how the actual hardware is organised is given. Apart from the classical confusing diagrams, this book has simple ones which is quite clear in its meaning. The explanation for pipeline execution and hazards are really good. This book is no longer in print, but you can get its pdf by clicking in the link provided. Highly recommended if you have time as this covers many of the other CS subjects as well. |
Book |
Description |
---|---|
Computer Networks
Peterson, Davie |
Most recommended for GATE |
Data Communication & Networks
Forouzan |
Good book with Basics clear |
Computer Netwroks
Tanenbaum, Wetherall |
One can not neglect the amazing book by tanenbaum. It contains everything in a very well written way. It is amusing and `it deals with issues in a manner you want to do. If you are starting the subject, go with it. It is not recommended for last time reading. Keep making good notes if you read his book. |
Computer Networking: A Top-Down Approach
Kurose |
Kurose is best for Almost all fundamental concept with clear figure and very understandable manners |
Book |
Description |
---|---|
The C Programming Language
Kernighan, Ritchie |
No comments- This is the best. To really understand the working of C, you must read this book. If you find this book tough, that means you have to correct your concepts by talking to knowledgeable people. Many local books, skips difficult to digest concepts and make easy to read books- but to get everything you have to follow this book. |
Data Structures Using C
Aaron M. Tenenbaum |
For most of the data structure concepts |
Book |
Description |
---|---|
Digital Logic & Computer Design
Morris Mano |
No Comment… One and only… |
Book |
Description |
---|---|
Software Engineering
Pressman |
Just see the GATE topics from this bible. |
Book |
Description |
---|---|
A First Course in Probability
Ross |
Sheldon ross’s book (1st course in Probability) is undoubtedly very good.But you have to read this book very deeply page by page. |
Book |
Description |
---|---|
Discrete Mathematics and Its Applications with Combinatorics and Graph Theory
Rosen |
Book |
Description |
---|---|
Graph Theory With Applications To Engineering And Computer Science
Deo |
Book |
Description |
---|---|
Linear Algebra and its Applications
Gilbert Strang |
|
Higher Engineering Mathematics
Grewal |
Book |
Description |
---|---|
Quantitative Aptitude For Competitive Examinations
Aggarwal |
Book |
Description |
---|---|
Quantitative Aptitude For Competitive Examinations, Aggarwal |