GATE-2014 Computer Science study books
00:01
This post is for those people who want to clear gate-2014 but do not have enough information how to tackle it.the study material is base to clear any exam if you are with good material you can get easily but with wrong material even hard work does not guaranteeing your success. so gear up to work with the following books the remaining tips will be post soon.
Mathematical Logic: Propositional Logic; First Order Logic, Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.
Textbook :
” Discrete Mathematics ” by Tremblay and Manohar .
Probability: Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial.
Textbook :
” Probability , statistics and queuing theory ” by S.C.Gupta & V.K.Kapoor
Combinatorics: Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotics.
Textbook :
” Intermediate Mathematics ” , S.Chand publications , authors : B.V.Sastry and K.Venkateswarlu ( if i remember )
” Higher Engineering Mathematics ” by B.S.Grewal for generating functions and recurrence relations . ( Bessel’s formula , Lagrangian Polynomial )
” Introduction to algorithms ” – Cormen etal ( CLRS ) for recurrence relations and asymptotics
Graph Theory: Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Colouring; Planarity; Isomorphism
Textbook :
” Intoduction to Graph Theory ” by Narsing Deo
Linear Algebra: Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors.
Textbook :
” Higher Engineering Mathematics ” by B.S.Grewal
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 Simpson’s rules.
Textbook :
” Numerical Methods ” – by S.S.Sastry
Calculus: Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima.
Textbook :
” Intermediate Mathematics ” , S.chand publications , authors : B.V.Sastry , K.Venkateswarlu ( if i remember )
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;
Textbook :
” Formal Languages and Automata theory ” , J.D.Ullman etal
Analysis of Algorithms and Computational Complexity: Asymptotic analysis (best, worst, average case) of time and space, Upper and lower bounds on the complexity of specific problems, NP-completeness.
Textbook :
” Introduction to algorithms ” – Cormen etal ( CLRS )
” Computer Algorithms ” – Horowitz and Sahani
A very good textbook on “Algorithms ” coming soon from Dr.M.N.Seetaramanth ( Tata Mc Graw Hill publications )
Digital Logic: Logic functions, Minimization, Design and synthesis of Combinational and Sequential circuits; Number representation and Computer Arithmetic (fixed and floating point);
Textbook :
” Digital Logic circuits and Design ” by Morris Mano
Computer Organization: Machine instructions and addressing modes, ALU 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.
Textbook :
” Computer Organisation ” by Morris Mano
” Computer Architecture ” by Briggs and 2 chinese authors ( blue cover pad ) { for pipelining }
Data structures: Notion of abstract data types, Stack, Queue, List, Set, String, Tree, Binary search tree, Heap, Graph;
Textbook :
” Data structures ” Schaumm’s outline series
” Data structures in PASCAL ” by Horowitz and Sahani
” Data structures and Algorithms ” by Weiss etal
” Introduction to algorithms ” – Cormen etal ( CLRS )
Programming Methodology: C programming, Program control (iteration, recursion, Functions), Scope, Binding, Parameter passing, Elementary concepts of Object oriented, Functional and Logic Programming
Textbook :
” Programming with C ” – Byron Gottfried , Schaumm’s outline series
” Principles of Programming Languages ” by Robert W Sebesta , Addison Wesley
” Programming with C++ ” – Balaguruswamy
Algorithms for problem solving: Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching; Design techniques (Greedy, Dynamic Programming, Divide-and-conquer);
Textbook :
” Data structures ” Schaumm’s outline series
” Data structures in PASCAL ” by Horowitz and Sahani
” Computer Algorithms ” – Horowitz and Sahani
” Data structures and Algorithms ” by Weiss etal
” Introduction to algorithms ” – Cormen etal ( CLRS )
Compiler Design: Lexical analysis, Parsing, Syntax directed translation, Runtime environment, Code generation, Linking (static and dynamic);
Textbook :
” Principles of Compiler Design ” , Aho , Ullman etal .
” Systems Programming ” by John . J . Donovan
Operating Systems: Classical concepts (concurrency, synchronization, deadlock), Processes, threads and Inter-process communication, CPU scheduling, Memory management, File systems, I/O systems, Protection and security.
Textbook :
” Operating system concepts ” by Abraham Silberschatz and Peter Galvin
” Advanced Unix Programming ” by W. Richard . Stevens
” Advanced Unix Programming ” by N.B.Venkateswarlu , BPB publications
Databases: 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;
Textbook :
” Database Management systems ” – Raghu RamaKrishnan
” Database system concepts ” – Silberschatz , Korth , Sudarshan
” Database systems ” – C.J.Date { normalisation is very lucidly written }
” Principles of Database Systems ” – J.D.Ullman { This is a very good book }
Computer Networks: ISO/OSI stack, sliding window protocol, LAN Technologies (Ethernet, Token ring), TCP/UDP, IP, Basic concepts of switches, gateways, and routers.
Textbook :
” Computer Networks ” – Tenenbaum
” Data communications and Networking ” – William Stallings
Some more important books :
” Multiple choice questions ” – Timothy . J . Williams , TMH publications
” Gate Question Papers ” – G.K.Publishers { follow it only for questions , answers are all wrong in it }
“Aptitude Test” -D R Choudhary
” Multiple choice questions ” – Timothy . J . Williams , TMH publications
” Gate Question Papers ” – G.K.Publishers
6 comments
I am a B.Tech Computer Science final Year student, I want to prepare for GATE 2014.
ReplyDeleteMy friends suggested me join THE GATE ACADEMY Classroom Session for that .Please
leave a replay if you have a query or suggestion.
THE GATE ACADEMY provide POST GATE GUIDANCE which will tell you about the options You have according to your GATE score. Kindly [link "http://thegateacademy.com/gate-exam/"] for more detail.
Thank you.
qualifying gate is not a tough job ,you can do it easily by sticking to the core concepts of subjects ,you can refer to any coaching institute if you have not taken your study seriously in last few years else you can go with the pace either by joining any test series like gateforum and self studying.
ReplyDeleteNice psot. and books for GATE CSE exam.
ReplyDeletethansk
DeleteIt is really a very good idea to make the world Eco Friendly. It is a very good initiative. Lots of things are available on the internet. I know the online institute name they provide good service for your career and make good future .
ReplyDeleteRef:-
Online Education
This comment has been removed by a blog administrator.
ReplyDeletecomments