Академический Документы
Профессиональный Документы
Культура Документы
Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case
analysis;
Tree and graph traversals, Connected components, Spanning trees, Shortest paths;
Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds,
Basic concepts of complexity classes P, NP, NP-hard, NP-complete.
Data Structures:
Linked Lists
Introduction to Algorithms
C.L.R.S
Fundamentals of Computer
Algorithms
Rajasekaran, Sahni, Horowitz
Description
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)
This book is Mini version of Cormens 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 you see prof Gargs Nptel upon DS you will find slides are
taken from this book. Slides are available online in the following link:
http://ww3.algorithmdesign.net/handouts/
Design & Analysis of Computer
Algorithms
Another classic book for algorithms.
Aho, Hopcroft, Ullman
Databases
Database Systems
Elmasri, Navathe
Database Systems
Connolly, Begg
Database Management
Systems
Raghu Ramakrishnan
Database System
Widom, Ullman, Garcia-Molina
Database System Concepts
Silberschatz
Description
Covers entire GATE syllabus and especially good for file structures and
normalization
Compiler Design
Book
Compilers : Principles,
Techniques, & Tools
Aho, Sethi, Ulman, Lam
Description
One and only book. If you find the explanations tough, start looking at
the given examples, they are easy to follow
Operating Systems
Concurrency, Synchronization
Deadlock
CPU scheduling
Description
Very good for learning theory in OS. English is good to understand.
Writing style is pretty easy and fun. Enough for GATE
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 Galvins book.
Theory of Computation
Undecidability.
Book
An Introduction To Formal
Languages And Automata
Description
Peter Linz
Introduction to Theory of
Computation
Sipser
Introduction To Computer
Theory
Cohen
Introduction to Automata
Theory, Languages, and
Computation
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!
Hopcroft
CO & Architecture
Instruction pipelining
Computer Organization
Description
Most recommended one and cache memory and pipelines are described
well.
Stallings
Computer Systems: A
Programmers perspective
Computer Networks
TCP/UDP and sockets, IP(v4), Application layer protocols (icmp, dns, smtp, pop, ftp, http)
Network security basic concepts of public key and private key cryptography, digital signature,
firewalls
Book
Computer Networks
Peterson, Davie
Data Communication &
Networks
Description
Most recommended for GATE
Forouzan
Computer Networks
Tanenbaum, Wetherall
Computer Networking: A TopKurose is best for Almost all fundamental concept with clear figure and
Down Approach
very understandable manners
Kurose
Programming in C
Functions, Recursion
Data Structures:
Linked Lists
Book
Description
Digital Logic
Description
Morris Mano
Software Engineering
Pressman
Description
Just see the GATE topics from this bible.
Web technologies
HTML, XML
Description
This presentation is enough for GATE.
Engineering Mathematics
Mathematical Logic
Propositional Logic
Description
Mathematical Introduction to Buy only if needed. The GATE topic is only till first order logic and these
Logic
questions can be solved just by practicing previous year papers. But
NEVER ignore this topic.
Enderton
Permutations, Combinations
Counting, Summation
Probability
Conditional Probability
Random Variables
Book
A First Course in Probability
Ross
Description
Sheldon rosss book (1st course in Probability) is undoubtedly very good.
But you have to read this book very deeply page by page.
Groups
Boolean Algebra
Book
Description
Graph Theory
Description
First 4 chapters are important for GATE
Good and concise books. If you have followed this book during
bachelors, then it is enough for GATE.
Linear Algebra
Higher Engineering
Mathematics
Grewal
Linear Algebra and its
Applications
Description
Grewal's book is sufficient for Linear Algebra in GATE (it is needed for
other mathematical subjects)
Gilbert Strang
Calculus
Higher Engineering
Mathematics
Description
Grewal
Calculus
Gilbert Strang
If you have time, go through the book and videos in this link.
General Aptitude
Numerical Ability
Numerical computation
Numerical estimation
Description
Those having good aptitude skills can do without this book. But do
refresh the problems in progression, cost-selling price etc. Questions in
aptitude are easy but scoring in this topic is very important to the final
GATE score.
Verbal Ability
Description