View source for Test ← Test


==Algorithms  & Data Structures ==

<b> Algorithms:</b> 
<ul>
<li>Analysis, Asymptotic notation, Notions of space and time complexity, Worst and 
average case analysis; </li>
<li>Design: Greedy approach, Dynamic programming, Divide-and-conquer; </li>
<li> Tree and graph traversals, Connected components, Spanning trees, Shortest paths; </li>
<li>Hashing, Sorting, Searching. </li>
<li>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. </li> </ul>
<b> Data Structures: </b> <br>
<ul>
<li> Abstract data types, Arrays, Stacks, Queues </li>
<li> Linked Lists </li>
<li>Trees, Binary search trees, Binary heaps. </li>
</ul>
{| class="wikitable"
! style="color: #f7f7f7; background-color: #3b5998;"|
Book
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
Description
|-
| [http://www.aduni.org/courses/algorithms/index.php?view=cw ''Algorithms'']
Shai Simonson, Aduni.org
| Aduni.org: before you do any other thing, the first thing to do is watch these videos, you won’t believe how awesome Shai is.
|-
|[http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/video-lectures/ ''Introduction to Algorithms'']
Leiserson, OCW.MIT
|One of the lecturers is C. Leiserson, The “L” in CLRS..
|-
| [http://nptel.ac.in/video.php?subjectId=106102064  ''Introduction to Data Structures & Algorithms'' ]
NPTEL
| 
|-
|[https://www.coursera.org/course/algs4partI  Coursera Course]
Kevin Wayne, Robert Sedgewick, Princeton University
| Course and slides
|}

==Databases==
<div>
<ul>
<li> ER-model, Relational model (relational algebra, tuple calculus) </li>
<li> Database design (integrity constraints, normal forms) </li>
<li> Query languages (SQL) </li>
<li> File structures (sequential files, indexing, B and B+ trees) </li>
<li> Transactions and concurrency control </li>

</ul></div>
{| class="wikitable"
! style="color: #f7f7f7; background-color: #3b5998;"|
Book
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
Description
|-
| [https://www.youtube.com/playlist?list=PLyvBGMFYV3auVdxQ1-88ivNFpmUEy-U3M ''DBMS NPTEL PPC - IIT KGP'']
NPTEL
| IIT KGP PPC DBMS lecture is good one
|-
| [http://web.stanford.edu/class/cs145/ ''CS145 Introduction to Databases'' ]
Stanford
|Course and slides for DBMS
|}

==Compiler Design==
<div>
<ul>
<li>Lexical analysis, Parsing </li>
<li> Syntax directed translation, Runtime environments </li>
<li>Intermediate and target code generation, Basics of code optimization. </li>
</ul></div>
{| class="wikitable"
! Book
! style="width: 70%;"|
Description
|-
|[https://www.youtube.com/playlist?list=PLFB9EC7B8FE963EB8&feature=plcp ''CS143 Compilers'' ]
Stanford
|Best notes and assignment for Compiler Course, no video
|-
|[http://web.stanford.edu/class/archive/cs/cs143/cs143.1128/ ''Compilers Stanford'' ]
Alex Aiken, Coursera
| Comprehensive
|}

==Operating Systems==
<div>
<ul>
<li> Processes, Threads, Inter-process communication </li>
<li> Concurrency, Synchronization </li>
<li> Deadlock </li>
<li> CPU scheduling </li>
<li> Memory management and virtual memory </li>
<li> File systems, I/O systems, Protection and security. </li>
</ul></div>
{| class="wikitable"
! Book
! style="width: 70%;"|
Description
|-
| [https://www.youtube.com/playlist?list=PLLDC70psjvq5hIT0kfr1sirNuees0NIbG ''Operating Systems'' ]
P.K.Biswas
| Enough for GATE
|-
|[https://www.youtube.com/watch?v=sjs5PtCsVA4&index=1&list=PLEAFEC6160DADC7AA ''Computer Science 162 - Lecture 1'' ]
UCBerkeley
|
|}




==Theory of Computation==
<div>
<ul>
<li>   Regular languages and finite automata </li>
<li>Context free languages and Push-down automata </li> 
<li>Recursively enumerable sets and Turing machines</li>
<li> Undecidability. </li>
</ul></div>
{|class="wikitable"
!Book
! style="width: 70%;"|
Description
|-
|[http://www.aduni.org/courses/theory/index.php?view=cw ''Theory of Computation'' ]
Shai Simonson, Aduni.org
| If you have not seen these videos, don’t do anything go and see the videos immediately, no excuses.
|}

==CO & Architecture==
<div>
<ul>
<li> Machine instructions and addressing modes</li>
<li> ALU and data-path, CPU control design</li>
<li> Memory interface, I/O interface (Interrupt and DMA mode) </li>
<li> Instruction pipelining </li>
<li> Cache and main memory, Secondary storage. </li>
</ul>
</div>
{|class="wikitable"
!Book
! style="width: 70%;"|
Description
|-
|[https://www.youtube.com/course?category=University%2FScience%2FComputer%2520Science%2FComputer%2520Architecture&list=EC1A5A6AE8AFC187B7&feature=edu ''Computer Architecture'' ]
Prof. Anshul Kumar, IIT Delhi, NPTEL
|
|-
|[https://www.youtube.com/course?category=University%2FScience%2FComputer%2520Science%2FComputer%2520Architecture&list=EC1A5A6AE8AFC187B7&feature=edu ''Computer Organization'' ]
Prof. S. Raman, IIT Madras, NPTEL
|
|-
| [https://www.coursera.org/course/comparch ''Computer Architecture'']
David Wentzlaff, Princeton University, Coursera
| Full Course
|}

==Computer Networks==
<div>
<ul>
<li> ISO/OSI stack, LAN technologies (Ethernet, Token ring) </li>
<li> Flow and error control techniques, Routing algorithms, Congestion control </li>
<li> TCP/UDP and sockets, IP(v4), Application layer protocols (icmp, dns, smtp, pop, ftp, http)</li>
<li>Basic concepts of hubs, switches, gateways, and routers</li>
<li> Network security – basic concepts of public key and private key cryptography, digital signature, firewalls </li>
</ul></div>
{|class="wikitable"
!Book
! style="width: 70%;"|
Description
|-
|[http://nptel.ac.in/video.php?subjectId=106105081 ''Computer Networks'']
NPTEL
|
|-
|[http://www.cse.wustl.edu/~jain/cse473-10/index.html ''Introduction to Computer Networks'']
Jain, WUSTL
| 
|}

==Programming==
<div>
<ul>
<li> Programming in C </li>
<li> Functions, Recursion </li>
<li> Parameter passing, Scope, Binding </li>
</ul> </div>
{|class="wikitable"
!Book
! style="width: 70%;"|
Description
|-
|[https://www.youtube.com/watch?v=_eR4rxnM7Lc&list=PL9D558D49CA734A02&index=4 ''Programming Paradigms'']
Jerry Cain, Stanford
| Doesn't cover the entire GATE syllabus in programming but useful
|-
|[https://www.youtube.com/course?category=University%2FEngineering%2FComputer%2520Science%2FData%2520Structures&list=EC4BBB74C7D2A1049C&feature=edu ''Computer Science 61B - Fall 2006'']
UCBerkeley
|For Data structures
|}




==Digital Logic==
<div>
<ul>
<li>Logic functions, Minimization </li>
 <li> Design and synthesis of combinational and sequential circuits </li>
<li> Number representation and computer arithmetic (fixed and floating point) </li>
</ul>
</div>
{|class="wikitable"
!Book
! style="width: 70%;"|
Description
|-
| [https://www.youtube.com/watch?v=CeD2L6KbtVM ''Introduction to Digital Circuits'']
Prof. S. Srinivasan, IIT Madras, NPTEL
| 
|}

==Information Systems and Software Engineering==
<div>
<ul>
<li>Information gathering, requirement and feasibility analysis data flow diagrams </li>
<li>Process specifications, input/output design, process life cycle </li>
<li>Planning and managing the project, design, coding </li>
<li>Testing, implementation, maintenance. </li>
</ul> </div>
{|class="wikitable"
!Book
! style="width: 70%;"|
Description
|-
|[http://nptel.ac.in/courses/106101061/ ''Introduction to Software Engineering Challenges'']
IIT Bombay, NPTEL
| Just see the GATE topics from this bible. |}

==Web technologies==
<div>
<ul>
<li> HTML, XML </li>
<li>Basic concepts of client-server computing </li>
</ul>
</div>
{|class="wikitable"
!Book
! style="width: 70%;"|
Description
|-
|[http://gatecse.in/w/images/0/02/Web-Technologies-Fundamentals-and-HTTP.pptx ''Web Technologies Basics'']
Telerik Academy
| This presentation is enough for GATE. 
|}



== Engineering Mathematics==


===Combinatory & Probability===
'''Combinatory'''
<div>
<ul>
<li>Permutations, Combinations </li>
<li> Counting, Summation </li>
<li> Generating functions, recurrence relations, asymptotics </li>
</ul></div>
'''Probability'''
<div>
<ul>
<li>Conditional Probability </li>
<li>Mean, Median, Mode and Standard Deviation </li>
<li> Random Variables </li>
<li> Distributions; uniform, normal, exponential, Poisson, Binomial. </li>
</ul></div>
{|class="wikitable"
!Book
! style="width: 70%;"|
Description
|-
|[https://www.youtube.com/playlist?list=PL5BC8D7CFBA5732EA ''Sets, Counting, and Probability'']
Harvard
|Covers the basics
|-
|[https://www.youtube.com/playlist?list=PLvjECquwN5_Emuhi-ISxBOk82-zp-6lTf ''Applied Probability'']
MIT
|Advanced course and topics are mostly above GATE syllabus. 
|}

===Mathematical Logic, Set Theory & Algebra=== 


'''Mathematical Logic'''
<div>
<ul>
<li>Propositional Logic </li>
<li> First Order Logic </li>
</ul> </div>
<div>
<ul>
'''Set Theory & Algebra'''
<li> Sets, Relations, Functions </li>
<li> Groups </li>
<li> Partial Orders, Lattice </li>
<li> Boolean Algebra </li>
</ul></div>
{|class="wikitable"
!Book
! style="width: 70%;"|
Description
|-
|[https://www.youtube.com/view_play_list?p=0862D1A947252D20 ''Discrete Mathematical Structures'']
Prof. Kamala Krithivasan, IIT Madras, NPTEL
| Covers Mathematical logic, Set Theory and Algebra syllabus from GATE completely
|}

===Graph Theory===
<div>
<ul>
<li>Connectivity, spanning trees</li>
<li> Cut vertices & edges </li>
<li> Covering, matching, independent sets </li>
<li> Colouring, Planarity, Isomorphism </li>
</ul></div>
{|class="wikitable"
!Book
! style="width: 70%;"|
Description
|-
|[http://www.nptel.ac.in/courses/106108054/1''Graph Theory'']
NPTEL
|Advanced course, just take what you need from GATE syllabus
|}

===Linear Algebra===
<div><ul>
<li>Algebra of matrices, determinants </li>
<li> Systems of linear equations </li>
<li> Eigen values and Eigen vectors </li>
</ul></div>
{|class="wikitable"
!Book
! style="width: 70%;"|
Description
|-
|[http://ocw.mit.edu/courses/mathematics/18-06-linear-algebra-spring-2010/video-lectures/ ''Linear Algebra'']
Gilbert Strang, OCW.MIT
| Straight from the master
|-
|}

===Numerical Methods & Calculus===
'''Numerical Methods'''
<div>
<ul>
<li>LU decomposition for systems of linear equations </li>
<li> Numerical solutions of non-linear algebraic equations by Secant, Bisection and Newton-Raphson Methods </li>
<li> Numerical integration by trapezoidal and Simpson’s rules </li>
</ul></div>

'''Calculus'''
<div>
<ul>
<li> Limit, Continuity & differentiability </li>
<li> Mean value theorems </li>
<li> Theorems of integral calculus, evaluation of definite & improper integrals</li>
<li> Partial derivatives, Total derivatives, maxima & minima </li>
</ul></div>

{|class="wikitable"
!Book
! style="width: 70%;"|
Description
|-
|[http://ocw.mit.edu/courses/mathematics/18-01-single-variable-calculus-fall-2006/video-lectures/ ''Single Variable Calculus'']
David Jerison, OCW.MIT
| Very good videos 
|}

==General Aptitude==
===Numerical Ability===
<div>
<ul>
<li>Numerical computation </li>
<li> Numerical estimation </li>
<li> Numerical reasoning and data interpretation </li>
</ul></div>
 

===Verbal Ability===
<div>
<ul>
<li>English grammar, sentence completion </li>
<li> Verbal analogies, word groups </li>
<li> Instructions, critical reasoning and verbal deduction </li>
</ul></div>
Book	Description
Algorithms Shai Simonson, Aduni.org	Aduni.org: before you do any other thing, the first thing to do is watch these videos, you won’t believe how awesome Shai is.
Introduction to Algorithms Leiserson, OCW.MIT	One of the lecturers is C. Leiserson, The “L” in CLRS..
Introduction to Data Structures & Algorithms NPTEL
Coursera Course Kevin Wayne, Robert Sedgewick, Princeton University	Course and slides
Book	Description
DBMS NPTEL PPC - IIT KGP NPTEL	IIT KGP PPC DBMS lecture is good one
CS145 Introduction to Databases Stanford	Course and slides for DBMS
Book	Description
CS143 Compilers Stanford	Best notes and assignment for Compiler Course, no video
Compilers Stanford Alex Aiken, Coursera	Comprehensive
Book	Description
Operating Systems P.K.Biswas	Enough for GATE
Computer Science 162 - Lecture 1 UCBerkeley
Book	Description
Computer Architecture Prof. Anshul Kumar, IIT Delhi, NPTEL
Computer Organization Prof. S. Raman, IIT Madras, NPTEL
Computer Architecture David Wentzlaff, Princeton University, Coursera	Full Course
Book	Description
Computer Networks NPTEL
Introduction to Computer Networks Jain, WUSTL
Book	Description
Programming Paradigms Jerry Cain, Stanford	Doesn't cover the entire GATE syllabus in programming but useful
Computer Science 61B - Fall 2006 UCBerkeley	For Data structures