Arjun Suresh (talk | contribs) (→CO & Architecture) |
Arjun Suresh (talk | contribs) (→Mathematical Logic, Set Theory & Algebra) |
||
(13 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
==Algorithms & Data Structures == | ==Algorithms & Data Structures == | ||
− | + | <div> | |
<b> Algorithms:</b> | <b> Algorithms:</b> | ||
<ul> | <ul> | ||
Line 9: | 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> | ||
Line 15: | Line 16: | ||
<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="color: #f7f7f7; background-color: #3b5998;"| | ||
− | + | Course Videos | |
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"| | ! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"| | ||
Description | Description | ||
Line 38: | Line 39: | ||
| Course and slides | | Course and slides | ||
|} | |} | ||
+ | |||
+ | |||
+ | |||
==Databases== | ==Databases== | ||
Line 51: | Line 55: | ||
{| class="wikitable" | {| class="wikitable" | ||
! style="color: #f7f7f7; background-color: #3b5998;"| | ! style="color: #f7f7f7; background-color: #3b5998;"| | ||
− | + | Course Videos | |
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"| | ! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"| | ||
Description | Description | ||
Line 63: | Line 67: | ||
|Course and slides for DBMS | |Course and slides for DBMS | ||
|} | |} | ||
+ | |||
+ | |||
+ | |||
==Compiler Design== | ==Compiler Design== | ||
Line 72: | Line 79: | ||
</ul></div> | </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 | ||
|- | |- | ||
Line 84: | Line 92: | ||
| Comprehensive | | Comprehensive | ||
|} | |} | ||
+ | |||
+ | |||
+ | |||
==Operating Systems== | ==Operating Systems== | ||
Line 96: | Line 107: | ||
</ul></div> | </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 | ||
|- | |- | ||
Line 121: | Line 133: | ||
</ul></div> | </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 | ||
|- | |- | ||
Line 128: | Line 141: | ||
Shai Simonson, Aduni.org | Shai Simonson, Aduni.org | ||
| If you have not seen these videos, don’t do anything go and see the videos immediately, no excuses. | | If you have not seen these videos, don’t do anything go and see the videos immediately, no excuses. | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
|} | |} | ||
Line 156: | 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 | ||
|- | |- | ||
Line 172: | Line 174: | ||
| Full Course | | Full Course | ||
|} | |} | ||
+ | |||
+ | |||
+ | |||
==Computer Networks== | ==Computer Networks== | ||
Line 183: | Line 188: | ||
</ul></div> | </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 | |
− | + | | | |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | | | ||
|} | |} | ||
Line 215: | Line 213: | ||
</ul> </div> | </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 | ||
|- | |- | ||
Line 240: | Line 239: | ||
</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/watch?v=CeD2L6KbtVM ''Introduction to Digital Circuits''] |
− | + | Prof. S. Srinivasan, IIT Madras, NPTEL | |
− | | | + | | |
− | |||
|} | |} | ||
Line 262: | Line 261: | ||
</ul> </div> | </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/courses/106101061/ ''Introduction to Software Engineering Challenges''] |
− | + | IIT Bombay, NPTEL | |
− | | | + | | |
|} | |} | ||
Line 282: | Line 282: | ||
</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 | ||
|- | |- | ||
Line 294: | Line 295: | ||
== Engineering Mathematics== | == Engineering Mathematics== | ||
− | + | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
===Combinatory & Probability=== | ===Combinatory & Probability=== | ||
Line 327: | Line 314: | ||
</ul></div> | </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 | ||
|- | |- | ||
Line 341: | Line 329: | ||
− | ===Set Theory & Algebra=== | + | ===Mathematical Logic, Set Theory & Algebra=== |
+ | |||
+ | |||
+ | '''Mathematical Logic''' | ||
<div> | <div> | ||
+ | <ul> | ||
+ | <li>Propositional Logic </li> | ||
+ | <li> First Order Logic </li> | ||
+ | </ul> </div> | ||
+ | <div> | ||
+ | |||
+ | |||
+ | '''Set Theory & Algebra''' | ||
<ul> | <ul> | ||
<li> Sets, Relations, Functions </li> | <li> Sets, Relations, Functions </li> | ||
Line 350: | Line 349: | ||
</ul></div> | </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 |
|} | |} | ||
Line 368: | Line 368: | ||
</ul></div> | </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 | |
− | |||
− | |||
− | |||
− | | | ||
|} | |} | ||
Line 389: | Line 386: | ||
</ul></div> | </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 & Calculus=== | ===Numerical Methods & Calculus=== | ||
Line 422: | Line 417: | ||
{|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://ocw.mit.edu/courses/mathematics/18-01-single-variable-calculus-fall-2006/video-lectures/ ''Single Variable Calculus''] | |
− | + | David Jerison, OCW.MIT | |
− | + | | Very good videos | |
− | |||
− | |[http://ocw.mit.edu/ | ||
− | |||
− | | | ||
|} | |} | ||
+ | |||
==General Aptitude== | ==General Aptitude== | ||
Line 443: | Line 436: | ||
<li> Numerical reasoning and data interpretation </li> | <li> Numerical reasoning and data interpretation </li> | ||
</ul></div> | </ul></div> | ||
− | + | ||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
===Verbal Ability=== | ===Verbal Ability=== | ||
Line 460: | Line 445: | ||
<li> Instructions, critical reasoning and verbal deduction </li> | <li> Instructions, critical reasoning and verbal deduction </li> | ||
</ul></div> | </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 |
Algorithms:
Data Structures:
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 |
---|---|
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. |
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! |
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
Peterson, Davie |
Most recommended for GATE |
Data Communication & Networks
Forouzan |
Good book with Basics clear |
Computer Netwroks
Tanenbaum, Wetherall |
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. |
Computer Networking: A Top-Down Approach
Kurose |
Kurose is best for Almost all fundamental concept with clear figure and very understandable manners |
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 |
Book |
Description |
---|---|
Digital Logic & Computer Design
Morris Mano |
No Comment… One and only… |
Book |
Description |
---|---|
Software Engineering
Pressman |
Just see the GATE topics from this bible. |
Book |
Description |
---|---|
Web Technologies Basics
Telerik Academy |
This presentation is enough for GATE. |
Book |
Description |
---|---|
Mathematical Introduction to Logic
Enderton |
Buy only if needed. The GATE topic is only till first order logic and these questions can be solved just by practising previous year papers. But NEVER ignore this topic. |
Combinatory
Probability
Book |
Description |
---|---|
Sets, Counting, and Probability
Harvard |
Covers the basics |
Applied Probability
MIT |
Advanced course and topics are mostly above GATE syllabus. |
Book |
Description |
---|---|
Discrete Mathematics and Its Applications with Combinatorics and Graph Theory
Rosen |
Best book for Discrete Mathematics. Even covers Graph Theory. |
Book |
Description |
---|---|
Introduction to Graph Theory
Douglas B. West |
First 4 chapters are important for GATE |
Graph Theory With Applications To Engineering And Computer Science
Deo |
Good and concise books. If you have followed this book during bachelors, then it is enough for GATE. |
Book |
Description |
---|---|
Higher Engineering Mathematics
Grewal |
Grewal's book is sufficient for Linear Algebra in GATE (it is needed for other mathematical subjects) |
Linear Algebra and its Applications
Gilbert Strang |
This is the best book for Linear algebra |
Numerical Methods
Calculus
Book |
Description |
---|---|
Higher Engineering Mathematics
Grewal |
Enough for GATE |
Calculus
Gilbert Strang |
If you have time, go through the book and videos in this link. |
Book |
Description |
---|---|
Quantitative Aptitude For Competitive Examinations
Aggarwal |
Those having good aptitude skills can do without this book. But do refresh the problems in progression, cost-selling price etc. Questions in aptitude are easy but scoring in this topic is very important to the final GATE score. |
Book |
Description |
---|---|
A Modern Approach to Verbal Reasoning
Aggarwal |
If your English is good enough no need to buy this book. But I recommend giving a little importance to this topic. |