http://www.gatementor.com/viewtopic.php?

f=18
Compiler Design
1. 2. 3. 4. 5. 6. Compilers, Principles, Techniques and Tools by Alfred V. Aho, Ravi Sethi, Jeffery D. Ullman Modern Compiler Design by Dick Grune, H.E. Bal, C. Jacobs, K.G. Langendoen Optimizing Compilers for Modern Architectures: A Dependence-based Approach by Ken Kennedy, Randy Allen Compiler Construction: Principles and Practice, Kenneth C. Louden Engineering a Compiler by Deith D. Cooper, Linda Torczon and Morgan Kaufmann Compiler Construction: Principles and Practice, Kenneth C. Louden

Engg Maths
1. 2. 3. 4. 5. 6. 7. 8. 9. Discrete mathematics & its applications, Kenneth H. Rosen Symbolic Logic, M. Copi Formal Logic, M. Copi Probability, Banerjee, De, Sen Statistics and probability, N.G. Das Higher Algebra, S.K. Mapa Modern Algebra, A.R. Vasistha Discrete Mathematical structure, Kolman, Busby, Ross Graph Theory, Narsingh Deo

10. Linear Algebra Hadley 11. Numerical Analysis & Computational procedure S.A.Mollah 12. Mathematical Analysis, Malik & Arora 13. Differential Calculus, Ghosh, Maity 14. Integral Calculus, Ghosh Maity

Theory of Computation
1. 2. 3. 4. Introduction to Automata Theory, Languages, and Computation, John E. Hopcroft, Jeffery D. Ullman An Introduction to Formal Languages and Automata, Peter Linz Theory of Computer Science (Automata, Languages and Computation), K.L.P. Mishra & N. Chandrasekaran Introduction to Computer Theory, Daniel I. A. Cohen

sbjoshi@cse.iitb.ac.in
1. 2. 3. 4. 5. 6. 7. 8. Discrete Mathematics by C L Liu (Nothing should be missed from the book) Introduction to Automata, Languages and Computation theory by John hopcroft, jeffery ullman and Rajiv Motwani (two books in GCET library, chapter 11 can be omitted ) Introduction to Compiler Design by Aho(first 7 chapters do not miss LALR parser) Linkers and Loaders by John R Levine(1 copy in GCET library- read only introductory chapters) Data structures( I dont remember the exact name) by Mark Allen Weiss (3 copies in GCET library) Some variants of data structures like splay trees can be omitted Computer Architechture by William Stallings (plz read RISC CISC and pipelining thoroughly) book by hamacher is also good. OS and Computer Networks by Tanenbaum (The things generally covered in the syllabus is sufficient) Propositional logic and first order logic (a must read , i dont have idea about any specific book but i can give some tutorial slides) this topic is much important from GATE point of view

9.

Digital Circuits by Morris Mano(contents covered in the syllabus is more than enough)

10. Sharpen your C, C++ skills before going for GATE.

Rajs Collection
1. 2. 3. 4. 5. 6. 7. 8. 9. Databases: For Transaction management chapters refer book by Korth, Concurrency Control from Navathe, SQL Queries --- refer Raghuramkrishnan and Gerkhe. Network: Tanenbaum, Keith Ross { Both we have studied in our curriculum }. Operating system: Refresh Galvin and you can go for any other book where Synchronisation is covered in depth. Data Structure: Tanenbaum would serve the purpose. Algorithms : Introduction to algorithm -- By CORMEN and others { Good Book } , Refresh Levitin in case you wish to do. FAFL: Ullman is better book. You can even use Padmareddy for Quick revaisal. Logic Design: Moris mano,and even Givon { book of our syllabus } Computer Architecture: by Carl Hamacher { Study Caching in depth } Compiler Design: Aho, Ullman, Sethi { Prepare only selected topics; which are in the syllabus }

10. Discrete Mathematics & Graph Theory: --Grimaldi is best book {I have reaped its benefits}, But many refer to the book by Mott. --Only concentrate on [1] Matrix and determinants [2] Probability, Conditional Probability [3] Analytical Geometry.

Rajs Tips
Dont invest much time on Mathematics { there will be least no. of Questions on them } Database: Generally SQL queries will be confusing to understand and may even be time consuming. o So Avoid them {dont attempt} in case they start to bother you in exam. LD: Concentrate on Registers, Flip-flops, Counters, mod-counters, K-map simplifications. FAFL : Concentrate on CFG, CFL, Ambiguous grammars......etc Discrete Mathematics and GT: We can score in these subjects, and there will be many no. of questions on them. {Prepare well} OS: Concentrate on Synchronizations, and CPU scheduling algorithms. { and you will see good no. of questions on them } Compiler Design: Concentrate on Parsing Methods {very very important} like LALR, SLR... blah blah.... :) CO: Concentrate on Interrupt processing like Daisy chain, Central Interrupt Resolution. ADA: Concentrate on analysis of Algorithms and Master theorems usage and compute complexity.

Gate 2008 Computer Science Syllabus

ENGINEERING MATHEMATICS
1. 2. 3. 4. 5. 6. 7. Mathematical Logic: Propositional Logic; First Order Logic. Probability: Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial. Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra. Combinatorics: Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotic. Graph Theory: Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Colouring; Planarity; Isomorphism. Linear Algebra: Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors. Numerical Methods: LU decomposition for systems of linear equations; numerical solutions of non-linear algebraic equations by Secant, Bisection and Newton-Raphson Methods; Numerical integration by trapezoidal and Simpsons rules.

8.

Calculus: Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima.

COMPUTER SCIENCE AND ENGINEERING

1. 2. 3. 4. 5.

Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively
enumerable sets and Turing machines, Undecidability; NP-completeness.

Digital Logic: Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Number representation and
computer arithmetic (fixed and floating point).

Computer Organization and Architecture: Machine instructions and addressing modes, ALU and data-path, CPU control design,
Memory interface, I/O interface (Interrupt and DMA mode), Instruction pipelining, Cache and main memory, Secondary storage.

Programming and Data Structures: Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Abstract data
types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps.

Algorithms: Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis; Design: Greedy
approach, Dynamic programming, Divide-and-conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching.

6. 7. 8. 9.

Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code
generation, Basics of code optimization.

Operating System: Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling,
Memory management and virtual memory, File systems, I/O systems, Protection and security.

Databases: ER-model, Relational model (relational algebra, tuple calculus), Database design (integrity constraints, normal forms),
Query languages (SQL), File structures (sequential files, indexing, B and B+ trees), Transactions and concurrency control.

Computer Networks: ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error control techniques, Routing algorithms,
Congestion control, TCP/UDP and sockets, IP(v4), Application layer protocols (icmp, dns, smtp, pop, ftp, http); Basic concepts of hubs, switches, gateways, and routers.