Random variables and expectation, Conditional probability, Independent
random variables, Distributions (Uniform, Normal, Exponential, Poisson, Binomial).
THEORY OF COMPUTATION: 1.John Martin, 2.J.D.Ullman
Formal Languages and Automata Theory: Regular languages and finite
automata, Context free languages and Push-down automata, Recursively
enumerable sets and Turing machines, Un-decidability.
Data structures and Algorithms: 1.Coremen, Leiserson, Rivest, Stein
Asymptotic analysis (best, worst, average case) of time and space, Upper
and lower bounds on the complexity of specific problems,
NP-completeness. Stack, Queue, List, Set, String, Tree, Binary search tree,
Heap, Graph.
Tree and graph traversals, Connected components, Spanning trees,
Shortest paths; Hashing, Sorting, Searching; Design techniques (Greedy,
Dynamic Programming, Divide-and-conquer.
Digital Logic: 1.Morris Mano
Logic functions, Minimization, Design and synthesis of Combinational
and Sequential circuits; Number representation and Computer
Arithmetic (fixed and floating point).
Computer Organization: 1.J.P.Hayes
Machine instructions and addressing modes, ALP and Data-path, hardwired
and micro-programmed control, Memory interface, I/O interface
(Interrupt and DMA mode), Serial communication interface, Instruction
pipelining, Cache, main and secondary storage.
Compiler Design: 1.Aho, J.D.Ullman (The Dragon Book)
Lexical analysis, Parsing, Syntax directed translation, Runtime
environment, Code generation, Linking (static and dynamic); Program
control (iteration, recursion, Functions), Scope, Binding, Parameter
passing.
Operating Systems: 1.Silberschatz, Galvin
Classical concepts (concurrency, synchronization, deadlock), Processes,
threads and Inter-process communication, CPU scheduling, Memory
management, File
systems, I/O systems, Protection and security.
Databases: 1.Korth, Silbershatz, Sudarshan
Relational model (ER-model, relational algebra, tuple calculus),
Database design (integrity constraints, normal forms), Query languages
(SQL), File structures (sequential files, indexing, B+ trees),
Transactions and concurrency control.
Computer Networks: 1.Andrew Tannenbaum
ISO/OSI stack, sliding window protocol, LAN Technologies (Ethernet,
Token ring), Basic concepts of switches, gateways, and routers.
2.Forouzan
TCP/UDP, IP.
How to Prepare for GATE
Group Study is Always Better, so that u
can share your problems and knowledge with your friends. However, the group
size should be limited. Recall, "Two is company, three is chaos";). Group
size of 4/5 is ideal.
Standard Reference Books
listed above are good enough as reading material. U may refer to any
other notes for GATE at your own risk.
Solve problems. Recall, "I listened, I forgot. I read, I remembered. I did and understood."
Start GATE preparation from beginning of academic year.