Arjun Suresh (talk | contribs) |
Arjun Suresh (talk | contribs) (→Mathematical Logic, Set Theory & Algebra) |
||
(61 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
==Algorithms & Data Structures == | ==Algorithms & Data Structures == | ||
− | <div><b> | + | <div> |
+ | <b> Algorithms:</b> | ||
<ul> | <ul> | ||
<li>Analysis, Asymptotic notation, Notions of space and time complexity, Worst and | <li>Analysis, Asymptotic notation, Notions of space and time complexity, Worst and | ||
Line 8: | Line 9: | ||
<li> Tree and graph traversals, Connected components, Spanning trees, Shortest paths; </li> | <li> Tree and graph traversals, Connected components, Spanning trees, Shortest paths; </li> | ||
<li>Hashing, Sorting, Searching. </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> | + | <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></div> |
− | < | + | <div> |
− | <b> Data Structures </b> <br> | + | <b> Data Structures: </b> <br> |
<ul> | <ul> | ||
<li> Abstract data types, Arrays, Stacks, Queues </li> | <li> Abstract data types, Arrays, Stacks, Queues </li> | ||
<li> Linked Lists </li> | <li> Linked Lists </li> | ||
<li>Trees, Binary search trees, Binary heaps. </li> | <li>Trees, Binary search trees, Binary heaps. </li> | ||
− | </ul> | + | </ul></div> |
{| class="wikitable" | {| class="wikitable" | ||
− | ! | + | ! style="color: #f7f7f7; background-color: #3b5998;"| |
− | ! style="width: 70%;"| | + | Course Videos |
+ | ! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"| | ||
Description | Description | ||
|- | |- | ||
− | | [http://www. | + | | [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:// | + | | [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== | ==Databases== | ||
− | <div | + | <div> |
<ul> | <ul> | ||
<li> ER-model, Relational model (relational algebra, tuple calculus) </li> | <li> ER-model, Relational model (relational algebra, tuple calculus) </li> | ||
Line 47: | Line 52: | ||
<li> Transactions and concurrency control </li> | <li> Transactions and concurrency control </li> | ||
− | </ul> | + | </ul></div> |
{| class="wikitable" | {| class="wikitable" | ||
− | ! | + | ! style="color: #f7f7f7; background-color: #3b5998;"| |
− | ! style="width: 70%;"| | + | Course Videos |
+ | ! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"| | ||
Description | 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:// | + | | [http://web.stanford.edu/class/cs145/ ''CS145 Introduction to Databases'' ] |
− | + | Stanford | |
− | | | + | |Course and slides for DBMS |
|} | |} | ||
+ | |||
+ | |||
+ | |||
==Compiler Design== | ==Compiler Design== | ||
− | < | + | <div> |
<ul> | <ul> | ||
<li>Lexical analysis, Parsing </li> | <li>Lexical analysis, Parsing </li> | ||
<li> Syntax directed translation, Runtime environments </li> | <li> Syntax directed translation, Runtime environments </li> | ||
<li>Intermediate and target code generation, Basics of code optimization. </li> | <li>Intermediate and target code generation, Basics of code optimization. </li> | ||
− | </ul> | + | </ul></div> |
{| class="wikitable" | {| class="wikitable" | ||
− | ! | + | ! style="color: #f7f7f7; background-color: #3b5998;"| |
− | ! style="width: 70%;"| | + | Course Videos |
+ | ! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"| | ||
Description | 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== | ==Operating Systems== | ||
− | < | + | <div> |
<ul> | <ul> | ||
<li> Processes, Threads, Inter-process communication </li> | <li> Processes, Threads, Inter-process communication </li> | ||
Line 99: | Line 105: | ||
<li> Memory management and virtual memory </li> | <li> Memory management and virtual memory </li> | ||
<li> File systems, I/O systems, Protection and security. </li> | <li> File systems, I/O systems, Protection and security. </li> | ||
− | </ul> | + | </ul></div> |
{| class="wikitable" | {| class="wikitable" | ||
− | ! | + | ! style="color: #f7f7f7; background-color: #3b5998;"| |
− | ! style="width: 70%;"| | + | Course Videos |
+ | ! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"| | ||
Description | 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== | ==Theory of Computation== | ||
− | < | + | <div> |
<ul> | <ul> | ||
<li> Regular languages and finite automata </li> | <li> Regular languages and finite automata </li> | ||
Line 120: | Line 131: | ||
<li>Recursively enumerable sets and Turing machines</li> | <li>Recursively enumerable sets and Turing machines</li> | ||
<li> Undecidability. </li> | <li> Undecidability. </li> | ||
− | </ul> | + | </ul></div> |
{|class="wikitable" | {|class="wikitable" | ||
− | ! | + | ! style="color: #f7f7f7; background-color: #3b5998;"| |
− | ! style="width: 70%;"| | + | Course Videos |
+ | ! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"| | ||
Description | Description | ||
|- | |- | ||
− | |[http://www. | + | |[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== | ==CO & Architecture== | ||
<div> | <div> | ||
− | |||
<ul> | <ul> | ||
<li> Machine instructions and addressing modes</li> | <li> Machine instructions and addressing modes</li> | ||
Line 155: | Line 157: | ||
</div> | </div> | ||
{|class="wikitable" | {|class="wikitable" | ||
− | ! | + | ! style="color: #f7f7f7; background-color: #3b5998;"| |
− | ! style="width: 70%;"| | + | Course Videos |
+ | ! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"| | ||
Description | 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== | ==Computer Networks== | ||
− | < | + | <div> |
<ul> | <ul> | ||
<li> ISO/OSI stack, LAN technologies (Ethernet, Token ring) </li> | <li> ISO/OSI stack, LAN technologies (Ethernet, Token ring) </li> | ||
Line 179: | Line 186: | ||
<li>Basic concepts of hubs, switches, gateways, and routers</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> | <li> Network security – basic concepts of public key and private key cryptography, digital signature, firewalls </li> | ||
− | </ul> | + | </ul></div> |
{|class="wikitable" | {|class="wikitable" | ||
− | ! | + | ! style="color: #f7f7f7; background-color: #3b5998;"| |
− | ! style="width: 70%;"| | + | Course Videos |
+ | ! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"| | ||
Description | Description | ||
|- | |- | ||
− | |[http:// | + | |[http://nptel.ac.in/video.php?subjectId=106105081 ''Computer Networks''] |
− | + | NPTEL | |
− | + | | | |
− | |||
− | |||
− | |||
− | |||
− | | | ||
|- | |- | ||
− | |[http://www. | + | |[http://www.cse.wustl.edu/~jain/cse473-10/index.html ''Introduction to Computer Networks''] |
− | | | + | Jain, WUSTL |
+ | | | ||
|} | |} | ||
+ | |||
+ | |||
+ | |||
==Programming== | ==Programming== | ||
− | < | + | <div> |
<ul> | <ul> | ||
<li> Programming in C </li> | <li> Programming in C </li> | ||
<li> Functions, Recursion </li> | <li> Functions, Recursion </li> | ||
<li> Parameter passing, Scope, Binding </li> | <li> Parameter passing, Scope, Binding </li> | ||
− | </ul> | + | </ul> </div> |
{|class="wikitable" | {|class="wikitable" | ||
− | ! | + | ! style="color: #f7f7f7; background-color: #3b5998;"| |
− | ! style="width: 70%;"| | + | Course Videos |
+ | ! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"| | ||
Description | 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''] |
− | | For | + | UCBerkeley |
+ | |For Data structures | ||
+ | |} | ||
+ | |||
+ | |||
+ | |||
− | |||
==Digital Logic== | ==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" | {|class="wikitable" | ||
− | ! | + | ! style="color: #f7f7f7; background-color: #3b5998;"| |
− | ! style="width: 70%;"| | + | Course Videos |
+ | ! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"| | ||
Description | Description | ||
|- | |- | ||
− | | [ | + | | [https://www.youtube.com/watch?v=CeD2L6KbtVM ''Introduction to Digital Circuits''] |
− | | | + | Prof. S. Srinivasan, IIT Madras, NPTEL |
+ | | | ||
+ | |} | ||
+ | |||
+ | |||
+ | |||
− | |||
==Information Systems and Software Engineering== | ==Information Systems and Software Engineering== | ||
− | < | + | <div> |
<ul> | <ul> | ||
<li>Information gathering, requirement and feasibility analysis data flow diagrams </li> | <li>Information gathering, requirement and feasibility analysis data flow diagrams </li> | ||
Line 234: | Line 259: | ||
<li>Planning and managing the project, design, coding </li> | <li>Planning and managing the project, design, coding </li> | ||
<li>Testing, implementation, maintenance. </li> | <li>Testing, implementation, maintenance. </li> | ||
+ | </ul> </div> | ||
+ | {|class="wikitable" | ||
+ | ! style="color: #f7f7f7; background-color: #3b5998;"| | ||
+ | Course Videos | ||
+ | ! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"| | ||
+ | Description | ||
+ | |- | ||
+ | |[http://nptel.ac.in/courses/106101061/ ''Introduction to Software Engineering Challenges''] | ||
+ | IIT Bombay, NPTEL | ||
+ | | | ||
+ | |} | ||
+ | |||
+ | |||
+ | |||
+ | |||
+ | ==Web technologies== | ||
+ | <div> | ||
+ | <ul> | ||
+ | <li> HTML, XML </li> | ||
+ | <li>Basic concepts of client-server computing </li> | ||
</ul> | </ul> | ||
+ | </div> | ||
{|class="wikitable" | {|class="wikitable" | ||
− | ! | + | ! style="color: #f7f7f7; background-color: #3b5998;"| |
− | ! style="width: 70%;"| | + | Course Videos |
+ | ! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"| | ||
Description | Description | ||
|- | |- | ||
− | |[http:// | + | |[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== | == 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" | {|class="wikitable" | ||
− | ! | + | ! style="color: #f7f7f7; background-color: #3b5998;"| |
− | ! style="width: 70%;"| | + | Course Videos |
+ | ! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"| | ||
Description | 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. | ||
|} | |} | ||
− | ===Set Theory & Algebra=== | + | |
+ | |||
+ | ===Mathematical Logic, Set Theory & Algebra=== | ||
+ | |||
+ | |||
+ | '''Mathematical Logic''' | ||
+ | <div> | ||
+ | <ul> | ||
+ | <li>Propositional Logic </li> | ||
+ | <li> First Order Logic </li> | ||
+ | </ul> </div> | ||
+ | <div> | ||
+ | |||
+ | |||
+ | '''Set Theory & Algebra''' | ||
+ | <ul> | ||
+ | <li> Sets, Relations, Functions </li> | ||
+ | <li> Groups </li> | ||
+ | <li> Partial Orders, Lattice </li> | ||
+ | <li> Boolean Algebra </li> | ||
+ | </ul></div> | ||
{|class="wikitable" | {|class="wikitable" | ||
− | ! | + | ! style="color: #f7f7f7; background-color: #3b5998;"| |
− | ! style="width: 70%;"| | + | Course Videos |
+ | ! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"| | ||
Description | 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=== | ===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" | {|class="wikitable" | ||
− | ! | + | ! style="color: #f7f7f7; background-color: #3b5998;"| |
− | ! style="width: 70%;"| | + | Course Videos |
+ | ! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"| | ||
Description | Description | ||
|- | |- | ||
− | |[http://www. | + | |[http://www.nptel.ac.in/courses/106108054/1''Graph Theory''] |
− | | | + | NPTEL |
+ | |Advanced course, just take what you need from GATE syllabus | ||
|} | |} | ||
+ | |||
+ | |||
===Linear Algebra=== | ===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" | {|class="wikitable" | ||
− | ! | + | ! style="color: #f7f7f7; background-color: #3b5998;"| |
− | ! style="width: 70%;"| | + | Course Videos |
+ | ! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"| | ||
Description | Description | ||
|- | |- | ||
− | |[http:// | + | |[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=== | + | |
− | + | ||
− | + | ===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" | {|class="wikitable" | ||
− | ! | + | ! style="color: #f7f7f7; background-color: #3b5998;"| |
− | ! style="width: 70%;"| | + | Course Videos |
+ | ! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"| | ||
Description | Description | ||
|- | |- | ||
− | |[http:// | + | |[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> |
Algorithms:
Data Structures:
Course Videos |
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 |
Course Videos |
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 |
Course Videos |
Description |
---|---|
CS143 Compilers
Stanford |
Best notes and assignment for Compiler Course, no video |
Compilers Stanford
Alex Aiken, Coursera |
Comprehensive |
Course Videos |
Description |
---|---|
Operating Systems
P.K.Biswas |
Enough for GATE |
Computer Science 162 - Lecture 1
UCBerkeley |
Course Videos |
Description |
---|---|
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. |
Course Videos |
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 |
Course Videos |
Description |
---|---|
Computer Networks
NPTEL |
|
Introduction to Computer Networks
Jain, WUSTL |
Course Videos |
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 |
Course Videos |
Description |
---|---|
Introduction to Digital Circuits
Prof. S. Srinivasan, IIT Madras, NPTEL |
Course Videos |
Description |
---|---|
Introduction to Software Engineering Challenges
IIT Bombay, NPTEL |
Course Videos |
Description |
---|---|
Web Technologies Basics
Telerik Academy |
This presentation is enough for GATE. |
Combinatory
Probability
Course Videos |
Description |
---|---|
Sets, Counting, and Probability
Harvard |
Covers the basics |
Applied Probability
MIT |
Advanced course and topics are mostly above GATE syllabus. |
Mathematical Logic
Set Theory & Algebra
Course Videos |
Description |
---|---|
Discrete Mathematical Structures
Prof. Kamala Krithivasan, IIT Madras, NPTEL |
Covers Mathematical logic, Set Theory and Algebra syllabus from GATE completely |
Course Videos |
Description |
---|---|
Graph Theory
NPTEL |
Advanced course, just take what you need from GATE syllabus |
Course Videos |
Description |
---|---|
Linear Algebra
Gilbert Strang, OCW.MIT |
Straight from the master |
Numerical Methods
Calculus
Course Videos |
Description |
---|---|
Single Variable Calculus
David Jerison, OCW.MIT |
Very good videos |
Data Structures
Book |
Description |
---|---|
Introduction to Algorithms
C.L.R.S |
Cormen covers entire GATE syllabus (and much more) in Algorithms as well as Data Structures. Language is simple for most part but some mathematics is required to understand the analysis parts. (This book is only for learning algorithms and theory of data structures and there is no sample programs given in it) |
Fundamentals of Computer Algorithms
Rajasekaran, Sahni, Horowitz |
This book is Mini version of Cormen’s book , this cover almost everything with short discussions ,which is written in Cormen with more pages.
Use this book along with NPTEL lecture of Professor Naveen Garg . Actually if u see prof Garg’s Nptel upon DS you will find slides are taken from this book. Slides are available online in the following link: |
Design & Analysis of Computer Algorithms
Aho, Hopcroft, Ullman |
Another classic book for algorithms. |
Book |
Description |
---|---|
Database Systems
Elmasri, Navathe |
Covers entire GATE syllabus and especially good for file structures and normalization |
Database Systems
Connolly, Begg |
Covers entire GATE syllabus and is easy to understand. |
Database Management Systems
Raghu Ramakrishnan |
Another very good book especially for Transaction management and Normalization. |
Database System
Widom, Ullman, Garcia-Molina |
Another very good book. |
Database System Concepts
Silberschatz |
Very good book but English is bit high standard |
Compiler Design:
Book |
Description |
---|---|
Compilers : Principles, Techniques, & Tools
Aho, Sethi, Ulman, Lam |
One and only book. If you find the explanations tough, start looking at the given examples, they are easy to follow |
Operating System:
Book |
Description |
---|---|
Operating System Concepts
Silberschatz, Galvin |
Very good for learning theory in OS. English is good to understand. Writing style is pretty easy and fun. Enough for GATE |
Modern Operating Systems
Tanenbaum |
The Book , but if you read Galvin it is ok , read Tanenbaum for more Knowledge. It contains great number of problems. Also includes some of theory that is not included in Galvin’s book. |
Theory of Computation:
Book |
Description |
---|---|
An Introduction To Formal Languages And Automata
Peter Linz |
Most recommended one for GATE |
Introduction to Theory of Computation
Sipser |
Sipser is a quick and comprehensive guide. It is recommended to be read after you have grip on the subject. |
Introduction To Computer Theory
Cohen |
Cohen can be read if very good detailed analysis is required. SPOON FEEDING ! |
Introduction to Automata Theory, Languages, and Computation
Hopcroft |
In most colleges you will find this book as a Main book , but believe me within Cohen or Linz, if you read any one of them , Enough! |
Computer Organization and Architecture:
Book |
Description |
---|---|
Computer Organization
Vranesic, Zaky, Hamacher |
|
Computer Organization and Architecture : Designing for Performance
Stallings |
|
Computer Systems: A Programmers perspective | This is a really good book in perspective of architecture as a simple view of how the actual hardware is organised is given. Apart from the classical confusing diagrams, this book has simple ones which is quite clear in its meaning. The explanation for pipeline execution and hazards are really good. This book is no longer in print, but you can get its pdf by clicking in the link provided. Highly recommended if you have time as this covers many of the other CS subjects as well. |
Computer Networks:
Book |
Description |
---|---|
Computer Networks, Peterson, Davie | Most recommended for GATE |
Data Communication & Networks, Forouzan | Good book with Basics clear |
Computer Netwroks, Tanenbaum, Wetherall | Kurose is best for Almost all fundamental concept with clear figure and very understandable manners |
Computer Networking: A Top-Down Approach, Kurose | One can not neglect the amazing book by tanenbaum. It contains everything in a very well written way. It is amusing and `it deals with issues in a manner you want to do. If you are starting the subject, go with it. It is not recommended for last time reading. Keep making good notes if you read his book. |
Programming:
Book |
Description |
---|---|
The C Programming Language, Kernighan, Ritchie | No comments- This is the best. To really understand the working of C, you must read this book. If you find this book tough, that means you have to correct your concepts by talking to knowledgeable people. Many local books, skips difficult to digest concepts and make easy to read books- but to get everything you have to follow this book. |
Data Structures Using C, Aaron M. Tenenbaum | For most of the data structure concepts |
Book |
Description |
---|---|
Digital Logic & Computer Design, Morris Mano | No Comment… One and only… |
Information Systems and Software Engineering
Book |
Description |
---|---|
Software Engineering, Pressman | Just see the GATE topics from this bible. |
Book |
Description |
---|---|
A First Course in Probability, Ross | Sheldon ross’s book (1st course in Probability) is undoubtedly very good.But you have to read this book very deeply page by page. |
Book |
Description |
---|---|
Discrete Mathematics and Its Applications with Combinatorics and Graph Theory, Rosen |
Book |
Description |
---|---|
Graph Theory With Applications To Engineering And Computer Science, Deo |
Book |
Description |
---|---|
Linear Algebra and its Applications, Gilbert Strang | |
Higher Engineering Mathematics , Grewal |
Book |
Description |
---|---|
Quantitative Aptitude For Competitive Examinations, Aggarwal |