Best Books and Study Material for GATE 2019 CSE (CS and IT) Paper
GATE 2019 Study Material for CS and IT – For all the students appearing in GATE 2019, a comprehensive pool of GATE study material has been prepared. You can get all the important GATE preparation for CS and IT details. The list of books, topics and GATE 2019 Study Material for CS and IT has been prepared after a lot of research.
Some of the most recommended GATE preparation books for CSE are.
- TOC and compilers (Compilers: Principles, Techniques, and Tools) by J.D Ullman.
- Database Management Systems – DBMS by Korth.
- Computer Algorithms by Ellis Horowitz.
- Operating Systems Concepts (OS) by Peter Baer Galvin.
- Data communications and networking by Behrouz A. Forouzan.
- Digital Logic & Computer Design by Morris Mano.
Comprehensive List of Important Books for GATE CSE
|2.||Higher Engineering Maths||BS Grewal|
|3.||Probability and Statistics||Miller and Freund|
|4.||Discrete Mathematical Structures||JP Trembly and Manohar|
|5.||Discrete Maths||Schaum’s Series|
|6.||Discrete Mathematical Structures||Kolman, Busby and Ross|
|7.||Graph Theory||Narsingh Deo|
|8.||Numerical Methods||Golden Series|
|9.||Numerical Methods||BS Grewal|
|10.||Numerical Methods||SS Sastry|
|11.||Numerical Methods||Jain and Iyengar|
|12.||Discrete Mathematics||Mott, Kandel and Baker|
|13.||Automata||Ullman and Hopcroft|
|14.||Introduction to Computer Theory||Daniel Cohen 2nd Edition|
|15.||Theory of ComputerScience 2nd Edition||Chandrasekaran & Mishra|
|16.||Design Analysis of Comp. Algorithms||Aho, Hopcroft and Ullman|
|17.||Computer Algorithms||Horowitz and Sahni|
|18.||Introduction to Algorithms||Thomas Cormon, Charles Ronald|
|19.||Switching and Finite Automata Theory||Kohavi|
|20.||Digital Logic and Computer Design||Morris Mano|
|21.||Digital Principles and Applications||Leach and Malvino|
|22.||Computer System Architecture||Mano|
|23.||Computer Org. and Architecture||William Stallings|
|24.||Computer Organization||Hamacher, Vranesic &Zaky|
|25.||Computer Architecture and Organization||Hayes|
|26.||Programming Languages||Pratt and Zelkewitz|
|27.||Compilers||Aho, Ullman and Sethi|
|28.||Principles of Compiler Design||Aho and Ullman|
|29.||Fundamentals of Data Structures||Horowitz. Sahni|
|30.||Introduction to DS with Applications||Trembly and Sorenson|
|31.||Data Structures||Schaum Series|
|32.||DS and Programming in C||Kruse, Tondo and Leung|
|34.||C Programming Language||Kernighan and Ritchie|
|36.||System Programming and OS||Dhamdhere|
|38.||Operating Systems||William Stallings|
|39.||Operating Systems||Milan Milenkovic|
|40.||OS Concepts||Galvin and Silberschatz|
|41.||Computer Networks||Andrew Tanenbaum|
|42.||Data Communications||William Stallings|
|43.||Engg. Approach to Comp. Networks||S Keshav|
|44.||Introduction to Switching Theory & Logic Design||FJ Hill and Peterson|
|45.||Database Systems||Korth and Sudhershan|
|46.||Fundamentals of DBMS||Elmasri, Navathe|
|47.||An Introduction to DBMS||CJ Date|
|48.||DBMS 3rd Edition||Ramakrishnan, Gehrke|
|49.||An Introduction to DBMS||Bipin C Desai|
|50.||Multiple Choice Questions in Computer Science||Timothy J Williams|
|51.||Previous GATE papers (Question papers only)||GK Publications|
Complete List of Important Books for GATE CSE – GATE Study Material for Computer Science and Information Technology.
Given here is a complete list of GATE Books for CSE.
|Mathematical Logic||Mathematical Logic: Propositional Logic; First Order Logic.||Discrete Mathematical Structures With Applications to Computer Science by Jean Paul Tremblay, Rampurkar Manohar.|
|Probability||Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial.||Probability, Statistics, and Queuing Theory by SC Gupta and VK Kapoor.|
|Set Theory & Algebra||Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.||Discrete Mathematical Structures With Applications to Computer Science by Jean Paul Tremblay, Rampurkar Manohar.|
|Combinatorics||Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotics.||Intermediate Mathematics by B.V.Sastry and K.Venkateswarlu (S.Chand publications).Higher Engineering Mathematics by B.S.Grewal.|
|Graph Theory||Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Colouring; Planarity; Isomorphism.||Graph theory with applications to engineering and computer science by Narsingh Deo.|
|Linear Algebra||Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors.||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.||Introductory methods of numerical analysis by SS Sastry.|
|Calculus||Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima.||Intermediate Mathematics by B.V.Sastry and K.Venkateswarlu (S.Chand publications).|
|Digital Logic||Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Number representation and computer arithmetic (fixed and floating point).||Digital Logic and Computer Design by M. Morris Mano.|
|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.||Computer system architecture by M. Morris Mano.Computer architecture by Briggs.|
|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.||Programming with C by Byron Gottfried , Schaumm’s outline series.Principles of Programming Languages by Robert W Sebesta , Addison Wesley.Programming with C++ by Balaguruswamy.Data structures by Schaumm’s outline series.Data structures in PASCAL by Horowitz and Sahani.Data structures and Algorithms by Weiss etal.Introduction to algorithms by Cormen etal ( CLRS ).|
|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. 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 by Schaumm’s outline series.Data structures in PASCAL by Horowitz and Sahani.Data structures and Algorithms by Weiss etal.Introduction to algorithms by Cormen etal ( CLRS ).|
|Theory of Computation||Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability.||Same as above|
|Compiler Design||Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization.||Principles of Compiler Design by Alfred V Aho and Jeffrey D Ullman.Systems Programming by John J Donovan.|
|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.||Operating system concepts by Abraham Silberschatz, Peter B. Galvin, Greg Gagne.Advanced Programming in the UNIX Environment by W. Richard Stevens, Stephen A Rago.Advanced UNIX Programming by NB Venkateswarlu.|
|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.||Database Management systems by Raghu RamaKrishnanDatabase system concepts by Silberschatz , Korth , SudarshanDatabase systems by C.J.DatePrinciples of Database Systems by J.D. Ullman.|
|Information Systems and Software Engineering||Information gathering, requirement and feasibility analysis, data flow diagrams, process specifications, input/output design, process life cycle, planning and managing the project, design, coding, testing, implementation, maintenance.||Software Engineering by K.K. Aggarwal & Yogesh Singh.|
|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. Network security – basic concepts of public key and private key cryptography, digital signature, firewalls.||Computer Networks by Tanenbaum.Data and Computer Communications by William Stallings.|
|Web technologies||HTML, XML, basic concepts of client-server computing.||No book referred.|
Solved papers – Click here to get all GATE Solved Papers.
To get fastest exam alerts and government job alerts in India, join our Telegram channel.