Computer Science & Information Technology –CS(Shared by Mahendra IITB & Rajiv Ranjan NITC)

GATE SYLLABUS

ENGINEERING MATHEMATICS

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; asymptotics.

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 Simpson’s rules.

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 INFORMATION TECHNOLOGY

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. 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.

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

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.

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.

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.

Web technologies: HTML, XML, basic concepts of client-server computing.
....................................................................................................................................................................

IMPORTANT BOOKS

Engineering Mathematics
1.Higher Engineering Mathematics By Dr. B.S.Grewal (for matrix and probability)

Discreate Maths
1.Discrete Mathematical Structure With Applications To Computer Science by Jean Paul Tremblay,Manohar R
2.Discrete Mathematics For Computer Scientists And Mathematicians,by Kandel Mott,Baker
3.Discrete Mathematical Structures by Bernard Kolman , Robert Busby ,Sharon C. Ross

Digital Logic:
1. Digital Logic and Computer Design by M. Morris Mano
2. Computer Fundamentals (Architecher & organization) By B.Ram(it is for both digital & comp. organization)

Computer Organization and Architecture:
1. Computer Architecture & Organization by John P. Hayes
2. Computer Organization And Design by P. Pal Chaudhuri
3. Computer Organization by Carl Hamacher V,Zvonko G Vranesic,Safwat G Zaky
4. Computer System Architecture by M. Morris Mano

Programming and Data Structures:
1.Data Structures And Program Design In C by Robert L. Kruse,clovis L. Tondo,bruce P. Leung
2.Schaum's Outline of Theory and Problems of Data Structures by Seymour Lipschutz
3.Data Structures & Algorithms using C by R.S.salaria

Algorithms:
1. Introduction to Algorithms by Thomas Cormen , Charles Leiserson , Ronald Rivest , Clifford Stein
2. Fundamentals of Computer Algorithms by Ellis Horowitz , Sartaj Sahni , Sanguthevar Rajasekaran
Data Structure books are also used in Algorithm

Theory of Computation:
1.Introduction to Automata Theory, Languages, and Computation by John E. Hopcroft , Rajeev Motwani , Jeffrey D. Ullman
2. Introduction To Languages And The Theory Of Computation by John C. Martin , Martin John
3. Introduction to Formal Languages and Automata by Peter Linz (Narosa publication)

Compiler Design:
1. Principles Of Compiler Design by Alfred V Aho & Jeffrey D Ullman
2. Compiler Design by Dr. O. G. Kakde

Operating System:
1. Operating Systems Concepts Sixth Edition by by Abraham Silberschatz , Peter Baer Galvin & Greg Gagne
2. Systems Programming & Operating Systems by D. Dhamdhere
3. Operating Systems by William Stallings
4. Modern Operating Systems by Andrew S. Tanenbaum

Databases:
1. Database Systems Concepts by Abraham Silberschatz ,Henry F. Korth & S. Sudarshan
2. Fundamentals Of Database Systems by Ramez Elmasri Shamkant B. Navathe(for functional dependencies)

Information Systems and Software Engineering:
1.Software Engineering: A Practitioner's Approach by Roger Pressman , Roger Pressman
2. Fundamentals of Software Engineering by Rajib Mall
3. An Integrated Approach to Software Engineering by Pankaj Jalote

Computer Networks:
1. Computer Networking: A Top-Down Approach Featuring the Internet by James F. Kurose, Keith W. Ross
2. Internetworking with TCP/IP Vol.1: Principles, Protocols, and Architecture by Douglas E. Comer
3. Computer Networks by Andrew S. Tanenbaum
4. Data Communications & Networking by Behrouz A. Forouzan

Web technologies:
1. get information from net.

................................................................All the Best...............................................................................