You are on page 1of 4

What to study ?

In this section i will list some textbooks which you can follow during your
preparation , you need not limit to these only and go ahead with some more book
s that you like .
1 . 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 .
2 . Probability: Conditional Probability; Mean, Median, Mode and Standard Dev
iation; Random Variables; Distributions; uniform, normal, exponential, Poisson,
Binomial .
Textbook : " Probability , statistics and queuing theory " by S.C.Gupta
& V.K.Kapoor
3 . Combinatorics: Permutations; Combinations; Counting; Summation; generati
ng 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 gen
erating functions and recurrence relations . ( Bessel's formula , Lagrangian Pol
ynomial )
" Introduction to algorithms " - Cormen etal ( CLRS ) f
or recurrence relations and asymptotics
4 . Graph Theory: Connectivity; spanning trees; Cut vertices & edges; coveri
ng; matching; independent sets; Colouring; Planarity; Isomorphism
Textbook : " Intoduction to Graph Theory " by Narsing Deo
5 . Linear Algebra: Algebra of matrices, determinants, systems of linear equ
ations, Eigen values and Eigen vectors.
Textbook : " Higher Engineering Mathematics " by B.S.Grewal
6 . Numerical Methods: LU decomposition for systems of linear equations; nume
rical solutions of non linear algebraic equations by Secant, Bisection and Newto
n-Raphson Methods; Numerical integration by trapezoidal and Simpson's rules.
Textbook : " Numerical Methods " - by S.S.Sastry
7 . Calculus: Limit, Continuity & differentiability, Mean value Theorems, The
orems 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 )
8 . Formal Languages and Automata Theory: Regular languages and finite autom
ata, Context free languages and Push-down automata, Recursively enumerable sets
and Turing machines, Un-decidability;

Textbook : " Computer Organisation " by Morris Mano " Computer Architecture " by Briggs and 2 chinese aut hors ( blue cover pad ) { for pipelining } 12 . . Heap. Memory interface. Shortest paths. Functional and Logic Programming Textbook : " Programming with C " . Set. Hashing. ALU and Data-path. Binding. Binary search tree. Number representation and Computer Arithme tic (fixed and floating point).M.Byron Gottfried . Graph. Computer Organization: Machine instructions and addressing modes. Upper and lower bounds on the comp lexity of specific problems. Parameter passing. Searching. Schaumm's out line series " Principles of Programming Languages " by Robert W Sebesta . Connected components. Program control (iteration.N. Textbook : " Data structures " Schaumm's outline series " Data structures in PASCAL " by Horowitz and Sah ani " Data structures and Algorithms " by Weiss etal " Introduction to algorithms " .Cormen etal ( CLRS ) 13 . Elementary concepts o f Object oriented. NP-completeness. Textbook : " Digital Logic circuits and Design " by Morris Mano 11 .Balaguruswamy 14 . hardwired and micro-programmed control. Textbook : " Introduction to algorithms " .Cormen etal ( CLRS ) " Computer Algorithms " .Horowitz and Sahani A very good textbook on " Algorithms " coming soon fro m Dr. worst. Queue. Design techniques (Greedy.D. Spanning trees. I/O int erface (Interrupt and DMA mode). Functions). Programming Methodology: C programming. List. Stack. Textbook : " Formal Languages and Automata theory " . Cache. Design and synthesis of C ombinational and Sequential circuits. J.Seetaramanth ( Tata Mc Graw Hill publications ) 10 . Digital Logic: Logic functions. Instruction pip elining. Divide-and-conquer). Serial communication interface. average case) of time and space. String. Minimization. recursion. Addison Wesley " Programming with C++ " . Algorithms for problem solving: Tree and graph traversals. Sorting. Scope. Data structures: Notion of abstract data types. Tree. main and secondary storage.Ullman etal 9 . Analysis of Algorithms and Computational Complexity: Asymptotic analysis ( best. Dynamic Programming.

IP. CPU scheduling. Databases: Relational model (ER-model. synchronization. Steve ns " Advanced Unix Programming " by N. and routers.William St allings Some more important books : .Horowitz and Sahani " Data structures and Algorithms " by Weiss etal " Introduction to algorithms " . Compiler Design: Lexical analysis.Raghu RamaKrishnan " Database system concepts " .Tenenbaum " Data communications and Networking " . Token ring).Venkateswarlu . Sudarshan " Database systems " .B. Ullman etal . Operating Systems: Classical concepts (concurrency. Syntax directed transla tion. File systems. J . Korth . Richard . B+ trees). indexing.Ullman { T his is a very good book } 18 .C. Protection and security. Textbook : " Data structures " Schaumm's outline series " Data structures in PASCAL " by Horowitz and Sah ani " Computer Algorithms " . Query languages ( SQL).D. Transactions and c oncurrency control. relational algebra. Donovan 16 . Aho . deadlock). Processes. threads and Inter-process communication. Textbook : " Database Management systems " .Silberschatz . Textbook : " Principles of Compiler Design " . normal forms). M emory management.Date { normalisation is very lucidly written } " Principles of Database Systems " . BPB publications 17 . TCP/UDP. Parsing. LAN Tec hnologies (Ethernet. Textbook : " Operating system concepts " by Abraham Silberschatz and Peter Galvin " Advanced Unix Programming " by W.Cormen etal ( CLRS ) 15 . " Systems Programming " by John . Basic concepts of switches. Linking (static and dynamic). Database design (integrity constraints. gatew ays. Textbook : " Computer Networks " . sliding window protocol. Computer Networks: ISO/OSI stack. Runtime environment.J. File structures (sequential files.J. I/O systems. Code generation. tuple cal culus).

M. My another teacher Dr. only those which you feel like useful for your pre paration .Venkateswarlu always stress to analyze the t hings by working out on the paper and don't take anything for granted . " Multiple choice questions " . how . application will definitely succeed irrespective of the percentage . follow standard textbooks . *** One important note to the undergraduates . don't worry even if it was too late to start the preparatio n for one reason or the other . TMH publications " Gate Question Papers " . see you believe it or not these 4 years of your B. T ry to work out the exercise problems given at the back of each chapter in the te xtbook ( once again not all . think about how they would be useful and can be applied practically ( what . getting ragged by the seniors and ragging your juniors etc . Williams . read the concepts .Tech are the best days of your entire life so enjoy them to t he fullest . ** Another thing is that don't worry whether i can do well in GATE as my perce ntage in university exams is very less . " How " and " Why " ( In telugu we say " enduku " . there is no point in wasting your time over 3 starred problems ) . Re ad two different subjects in parallel so that you wont feel bored . This would give you some insight on the GATE qu estions and build your confidence as well .B. why ) . " emiti " .N. then thi ngs would be fine for you and life will be smooth . unde rstanding . answers are all wrong in it } How to study ? I will tell you three golden words told by my teacher Dr. g oing to second show movies .K. there are many more beautiful things in life so . it is not everyth ing in life .. J .Timothy . for people who think like that let me c larify your university percentage has nothing to do with GATE both of them are entirely different ball games all together . * I tell you these Brilliant tutorial materials and all will not help you .Publishers { follow it only for questions .N. understand them . i tell you 2 months is more than enough for the preparation of the CS paper even if you have not studied much for your universit y exams . Studies is only part of life . playing cricket ..G. Read the subject by posing question s " What " .Seetaramanath garu to me when he took me into his hands . roaming with friends . The student with good basics . I promise you that these wor ds are very powerful . don't miss them ( you cannot reuse time unlike space right ) Author: D V Janardhan Rao In case of any queries mail to the autho . bunking the classes and going to movies . Try to answ er the questions related to a subject after you finish studying it from both " M ultiple choice questions " book by williams and questions from all the previous papers related to that subject . . one more thing is . " ela " ) .