LEAD Institute of Academics

Text Books for GATE - CS (Computer Science & Information Technology)

S.No. Subject Text Book 1. Discrete Mathematics for computer science - Mott & Kandel Abraham 1. Discrete Mathematics for computer science - Mott & Kandel Abraham 2. Discrete Mathematics - seymour lipschutz, marc lipson (schaum's series) 1. Discrete Mathematics and its application Kenneth H. Rosen 2. Discrete Mathematics for computer science - Mott & Kandel Abraham 1. Discrete Mathematics and its application Kenneth H. Rosen 1. Probabilty - Schaum series 2. Probability - Gupta and kapoor 3. Mathematical Statistics V K Kapoor 1. Numerical methods - Rajaraman 2. Numerical methods - Sastry

Topics Mathematical Logic: Propositional Logic; First Order Logic. Combinatorics: Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotics.

Marks in GATE

Discrete Mathematics

10-12

Graph Theory: Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Colouring; Planarity; Isomorphism. Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra. Probability: Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial. Numerical Methods: LU decomposition for systems of linear equations; numerical solutions of non-linear algebraic equations by Secant, Bisection and NewtonRaphson Methods; Numerical integration by trapezoidal and Simpsons rules. Calculus: Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima. Linear Algebra: Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors.

General Mathematics

6-8

1. Calculus-Differential calculus shantinarayan 2. Integral calculus - Shanti narayan Calculus I A Maron 1. Matrices A R Vasista

No. 569, I-Floor, Near Cambridge Public School BALAJI COLCONY, TIRUPATI Website: leadacademics.com, Phone: 9392926692 Our Ranks in GATE: 3, 11, 13, 14, 63, 72, 112, 120, 122, 141, 144, 172, 182, 186, 229, 238, 274, 310, 326, 359, 369, 385, 420, 436, 447, 460, 482,

LEAD Institute of Academics

Text Books for GATE - CS (Computer Science & Information Technology)
S.No. Subject Text Book 1. Fundamentals of Database Systems Elmasri & Navathe 2. Database Management System Raghu Ramakrishnan 1. Database Systems: The Complete Book Hector Garcia-Molina, Jeff Ullman, and Jennifer Widom 2. Fundamentals of Database Systems Elmasri & Navathe 1. Database Management System Raghu Ramakrishnan 2. Fundamentals of Database - Korth 1. DBMS - CJ Date 2. Database Management System Raghu ramakrishtnan 3. Fundamentals of Database - Korth 4 C Language 1. Programming Language Brian W. Kernighan, Dennis M. Ritchie 2. Exploring C Yashwant Kanitkar 1. Data Structures and Algorithm Analysis in C - Mark Allen Weiss 2. Data Structures and Algorithms - Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman 3. Data Structures & Algorithms - Tanenbaum

Topics ER-model, Relational model (relational algebra, tuple calculus)

Marks in GATE

Database design (integrity constraints, normal forms) Transactions and concurrency control. 5-12

DBMS

Query languages (SQL)

File structures (sequential files, indexing, B and B+ trees)

Programming in C, Functions 3-4

Data structures

Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps.

15-20

No. 569, I-Floor, Near Cambridge Public School BALAJI COLCONY, TIRUPATI Website: leadacademics.com, Phone: 9392926692 Our Ranks in GATE: 3, 11, 13, 14, 63, 72, 112, 120, 122, 141, 144, 172, 182, 186, 229, 238, 274, 310, 326, 359, 369, 385, 420, 436, 447, 460, 482,

LEAD Institute of Academics

Text Books for GATE - CS (Computer Science & Information Technology)
S.No. Subject Text Book 1. Fundamentals of Computer Algorithms Sartaj Sahni Ellis Horowitz 2. Introduction to Algorithms - Thomas H. Cormen, E. Leiserson 3. Data Structures and Algorithms - Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman

Topics Algorithms: Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis; Design: Greedy approach, Dynamic programming, Divideand-conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Theory of Computation: Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability; NP completeness.

Marks in GATE

Algorithm analysis

15-32

Theory of Computation

1. Introduction to Automata theory, Languages and Computation John E Hopcroft, Jeffrey D Ullman 2. Introduction to the theory of computation Michael sipser 3. Introduction to Programming Languages & Automation Peter Linz 1. Compilers principles, Techniques, & Tools Alfred V Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullman 2. Basics of Compiler Design- Torben Mogensen 1. Operating System Concepts Abraham Silberschatz, peter baer Galvin 2. Operating system design and implimentation - Tanenbaum 3. PERATING SYSTEMS William Stallings 1. Computer Organization - Carl Hamacher 2. Computer Organization and Design David A. Patterson 3. Computer Architecture and Organization John P. Hayes

8-10

Language Processor or Compiler Design

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

4-6

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

8-10

10

Computer Organization and Architecture

6-8

No. 569, I-Floor, Near Cambridge Public School BALAJI COLCONY, TIRUPATI Website: leadacademics.com, Phone: 9392926692 Our Ranks in GATE: 3, 11, 13, 14, 63, 72, 112, 120, 122, 141, 144, 172, 182, 186, 229, 238, 274, 310, 326, 359, 369, 385, 420, 436, 447, 460, 482,

LEAD Institute of Academics

Text Books for GATE - CS (Computer Science & Information Technology)
S.No. Subject Text Book 1. Computer network Tenenbaum 2. Computer Networking (Top-Down Approach) - Kruse ross 3. Data and computer communications William stallings

Topics 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 & routers. Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Number representation and computer arithmetic (fixed and floating point).

Marks in GATE

11

Computer Networks

8-10

1. Fundamentals of Logic Design Charles Roth 2. Digital Principles Roger L. Tokheim, 12 Digital Logic M.S.(schaum's series) 3. Digital Logic and Computer Design Morris Mano Note: Analysis is made on the basis of previous NINE GATE Papers (2003-2011)
Examination Type:

4-6

GATE Examination consists of a single paper of 3 Hours duration, which contains 65 Questions carrying a maximum of 100 Marks. The Question paper will consist of only multiple choice objective questions Paper Patterns of Question papers Negative Marks for wrong Answer Code Q.1 to Q.25: Will carry one mark each (sub-total 25 marks). Q.26 to Q.55: Will carry two marks each (sub-total 60 marks) Q.48 through Q.51 (2 pairs) will be common data questions. Each question will carry two marks Question pairs (Q.52, Q.53) and (Q.54, Q.55) will be linked answer questions. CS, EC, The answer to the second question of the last two pairs will depend on the answer to the first question EE, IN, of the pair. CE, ME If the first question in the linked pair is wrongly answered or is un-attempted, then the answer to the second question in the pair will not be evaluated. Each question will carry two marks Q.56 to Q.60 : From General Aptitude (GA) will carry one mark each (sub-total 5 marks). Q.61 to Q.65 : From GA will carry two marks each (sub-total 10 marks)
1 2 2

/3 mark will be deducted for each wrong answer. /3 mark will be deducted for each wrong answer. /3 mark will be deducted for each wrong answer.

There will be negative marks only for wrong answer to the first question of the linked answer question pair i.e. for Q.52 and Q.54, 2/3 mark will be deducted for each wrong answer. There is no negative marking for Q.53 and Q.55.
1 2

/3 mark will be deducted for each wrong answer. /3 mark will be deducted for each wrong answer.

All the papers bearing the codes CS, EC, EE, IN, CE, ME will contain few questions on Engineering Mathematics carrying 15 marks. Note: GATE 2012 score will be valid for 2 YEARS from the date of announcement of the GATE 2012 results.

No. 569, I-Floor, Near Cambridge Public School BALAJI COLCONY, TIRUPATI Website: leadacademics.com, Phone: 9392926692 Our Ranks in GATE: 3, 11, 13, 14, 63, 72, 112, 120, 122, 141, 144, 172, 182, 186, 229, 238, 274, 310, 326, 359, 369, 385, 420, 436, 447, 460, 482,