Difference between revisions of "Best video lectures for CSE"

 
(19 intermediate revisions by 2 users not shown)
Line 2: Line 2:
 
<!--<gdoc id="1EnS54bTqAm2vAJB_TllpfEzWC8uGxJjGRS1yVHAGLuE" />-->
 
<!--<gdoc id="1EnS54bTqAm2vAJB_TllpfEzWC8uGxJjGRS1yVHAGLuE" />-->
 
__NOTITLE__
 
__NOTITLE__
 +
 +
 
=Best Video Lectures for GATE in CSE=
 
=Best Video Lectures for GATE in CSE=
 +
 
{{alert| These courses are recommended for a good understanding of Computer Science subjects which is very essential for GATE. Most of the courses here are graduate level meant exclusively for GATE|alert-danger}}
 
{{alert| These courses are recommended for a good understanding of Computer Science subjects which is very essential for GATE. Most of the courses here are graduate level meant exclusively for GATE|alert-danger}}
 +
 +
Please see [[Best_books_for_CSE| Books for GATE]] for books
 +
 
==Algorithms  & Data Structures ==
 
==Algorithms  & Data Structures ==
−
<div>
+
 
−
<b> Algorithms:</b>
+
[http://www.gatecse.in/algorithms/ Webpage for Algorithms]
−
<ul>
+
 
−
<li>Analysis, Asymptotic notation, Notions of space and time complexity, Worst and
+
[http://www.gatecse.in/data-structures/ Webpage for Data structures]
−
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></div>
 
−
<div>
 
−
<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></div>
 
 
{| class="wikitable"
 
{| class="wikitable"
 
! style="color: #f7f7f7; background-color: #3b5998;"|
 
! style="color: #f7f7f7; background-color: #3b5998;"|
Line 29: Line 24:
 
| [http://www.aduni.org/courses/algorithms/index.php?view=cw ''Algorithms'']
 
| [http://www.aduni.org/courses/algorithms/index.php?view=cw ''Algorithms'']
 
Shai Simonson, Aduni.org
 
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.
+
| 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. Please see this link if .rm file doesn't work for you https://www.youtube.com/playlist?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm
 
|-
 
|-
 
|[http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/video-lectures/ ''Introduction to Algorithms'']
 
|[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
 
Leiserson, OCW.MIT
 
|One of the lecturers is C. Leiserson, The “L” in CLRS..
 
|One of the lecturers is C. Leiserson, The “L” in CLRS..
 +
|-
 +
| [https://www.coursera.org/course/algo2  ''Algorithms: Design & Analysis'' ]
 +
Coursera
 +
|
 
|-
 
|-
 
| [http://nptel.ac.in/video.php?subjectId=106102064  ''Introduction to Data Structures & Algorithms'' ]
 
| [http://nptel.ac.in/video.php?subjectId=106102064  ''Introduction to Data Structures & Algorithms'' ]
 
NPTEL
 
NPTEL
 
|  
 
|  
 +
 +
 
|-
 
|-
 
|[https://www.coursera.org/course/algs4partI  Coursera Course]
 
|[https://www.coursera.org/course/algs4partI  Coursera Course]
Line 43: Line 44:
 
| Course and slides
 
| Course and slides
 
|}
 
|}
−
 
−
 
−
 
  
 
==Databases==
 
==Databases==
−
<div>
+
[http://www.gatecse.in/databases/ Webpage for Databases]
−
<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"
 
{| class="wikitable"
 
! style="color: #f7f7f7; background-color: #3b5998;"|
 
! style="color: #f7f7f7; background-color: #3b5998;"|
Line 76: Line 67:
  
 
==Compiler Design==
 
==Compiler Design==
−
<div>
+
[http://www.gatecse.in/compiler-design/ Webpage for Compiler Design]
−
<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"
 
{| class="wikitable"
 
! style="color: #f7f7f7; background-color: #3b5998;"|
 
! style="color: #f7f7f7; background-color: #3b5998;"|
Line 90: Line 77:
 
|[https://www.youtube.com/playlist?list=PLFB9EC7B8FE963EB8&feature=plcp ''CS143 Compilers'' ]
 
|[https://www.youtube.com/playlist?list=PLFB9EC7B8FE963EB8&feature=plcp ''CS143 Compilers'' ]
 
Stanford
 
Stanford
−
|Best notes and assignment for Compiler Course, no video
+
|Comprehensive
 
|-
 
|-
 
|[http://web.stanford.edu/class/archive/cs/cs143/cs143.1128/ ''Compilers Stanford'' ]
 
|[http://web.stanford.edu/class/archive/cs/cs143/cs143.1128/ ''Compilers Stanford'' ]
 
Alex Aiken, Coursera
 
Alex Aiken, Coursera
−
| Comprehensive
+
| Best notes and assignment for Compiler Course, no video
 
|}
 
|}
  
 +
==Operating Systems==
 +
[http://www.gatecse.in/operating-systems/ Webpage for Operating systems]
  
−
 
−
 
−
==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"
 
{| class="wikitable"
 
! style="color: #f7f7f7; background-color: #3b5998;"|
 
! style="color: #f7f7f7; background-color: #3b5998;"|
Line 129: Line 106:
  
 
==Theory of Computation==
 
==Theory of Computation==
−
<div>
+
[http://www.gatecse.in/theory-of-computation/ Webpage for Theory of Computation]
−
<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"
 
{|class="wikitable"
 
! style="color: #f7f7f7; background-color: #3b5998;"|
 
! style="color: #f7f7f7; background-color: #3b5998;"|
Line 144: Line 116:
 
|[http://www.aduni.org/courses/theory/index.php?view=cw ''Theory of Computation'' ]
 
|[http://www.aduni.org/courses/theory/index.php?view=cw ''Theory of Computation'' ]
 
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. See the below link if .rm files doesn't work for you. https://www.youtube.com/playlist?list=PL601FC994BDD963E4
 
|}
 
|}
  
 +
==CO & Architecture==
 +
[http://www.gatecse.in/co-architecture/ Webpage for CO & Architecture]
  
−
 
−
 
−
==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"
 
{|class="wikitable"
 
! style="color: #f7f7f7; background-color: #3b5998;"|
 
! style="color: #f7f7f7; background-color: #3b5998;"|
Line 166: Line 128:
 
Description
 
Description
 
|-
 
|-
−
|[https://www.youtube.com/course?category=University%2FScience%2FComputer%2520Science%2FComputer%2520Architecture&list=EC1A5A6AE8AFC187B7&feature=edu ''Computer Architecture'' ]
+
|[https://www.youtube.com/watch?v=4TzMyXmzL8M&list=PLw0fM2uDN4J5f1juGVzOGVWGGNMm2Znhn ''Computer Architecture'' ]
 
Prof. Anshul Kumar, IIT Delhi, NPTEL
 
Prof. Anshul Kumar, IIT Delhi, NPTEL
 
|
 
|
Line 183: Line 145:
  
 
==Computer Networks==
 
==Computer Networks==
−
<div>
+
[http://www.gatecse.in/computer-networks/ Webpage for Computer Networks]
−
<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"
 
{|class="wikitable"
 
! style="color: #f7f7f7; background-color: #3b5998;"|
 
! style="color: #f7f7f7; background-color: #3b5998;"|
Line 210: Line 166:
  
 
==Programming==
 
==Programming==
−
<div>
+
[http://www.gatecse.in/programming/ Webpage for Programming]
−
<ul>
+
 
−
<li> Programming in C </li>
 
−
<li> Functions, Recursion </li>
 
−
<li> Parameter passing, Scope, Binding </li>
 
−
</ul> </div>
 
 
{|class="wikitable"
 
{|class="wikitable"
 
! style="color: #f7f7f7; background-color: #3b5998;"|
 
! style="color: #f7f7f7; background-color: #3b5998;"|
Line 235: Line 187:
  
 
==Digital Logic==
 
==Digital Logic==
−
<div>
+
[http://www.gatecse.in/digital-logic/ Webpage for Digital logic]
−
<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="color: #f7f7f7; background-color: #3b5998;"|
Line 255: Line 202:
  
  
 +
== Engineering Mathematics==
  
−
==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"
 
−
! 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
 
−
|
 
−
|}
 
  
 +
===Combinatory & Probability===
  
 +
[http://www.gatecse.in/combinatory/ Webpage for Combinatory]
  
  
−
==Web technologies==
+
[http://www.gatecse.in/probability/ Webpage for Probability]
−
<div>
 
−
<ul>
 
−
<li> HTML, XML </li>
 
−
<li>Basic concepts of client-server computing </li>
 
−
</ul>
 
−
</div>
 
−
{|class="wikitable"
 
−
! style="color: #f7f7f7; background-color: #3b5998;"|
 
−
Course Videos
 
−
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 
−
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"
 
{|class="wikitable"
 
! style="color: #f7f7f7; background-color: #3b5998;"|
 
! style="color: #f7f7f7; background-color: #3b5998;"|
Line 336: Line 231:
  
  
−
'''Mathematical Logic'''
+
[http://www.gatecse.in/mathematical-logic/ Webpage for Mathematical logic]
−
<div>
+
 
−
<ul>
 
−
<li>Propositional Logic </li>
 
−
<li> First Order Logic </li>
 
−
</ul> </div>
 
−
<div>
 
  
 +
[http://www.gatecse.in/set-theory-algebra/ Webpage for Set Theory & Algebra]
  
−
'''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="color: #f7f7f7; background-color: #3b5998;"|
Line 357: Line 241:
 
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 
Description
 
Description
 +
|-
 +
|[http://aduni.org/courses/discrete/index.php?view=cw "Shai Simonson"]
 +
| From Aduni series- really good
 
|-
 
|-
 
|[https://www.youtube.com/view_play_list?p=0862D1A947252D20 ''Discrete Mathematical Structures'']
 
|[https://www.youtube.com/view_play_list?p=0862D1A947252D20 ''Discrete Mathematical Structures'']
Line 364: Line 251:
  
 
===Graph Theory===
 
===Graph Theory===
−
<div>
+
[http://www.gatecse.in/graph-theory/ Webpage for Graph theory]
−
<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="color: #f7f7f7; background-color: #3b5998;"|
Line 384: Line 266:
  
 
===Linear Algebra===
 
===Linear Algebra===
−
<div><ul>
+
[http://www.gatecse.in/linear-algebra/ Webpage for Linear Algebra]
−
<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="color: #f7f7f7; background-color: #3b5998;"|
Line 402: Line 281:
  
  
−
===Numerical Methods & Calculus===
+
=== Calculus===
−
'''Numerical Methods'''
+
[http://www.gatecse.in/calculus/ Webpage for Calculus]
−
<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"
Line 434: Line 299:
 
==General Aptitude==
 
==General Aptitude==
 
===Numerical Ability===
 
===Numerical Ability===
−
<div>
+
[http://www.gatecse.in/numerical-ability/ Webpage for Numerical Ability]
−
<ul>
 
−
<li>Numerical computation </li>
 
−
<li> Numerical estimation </li>
 
−
<li> Numerical reasoning and data interpretation </li>
 
−
</ul></div>
 
 
   
 
   
  
 
===Verbal Ability===
 
===Verbal Ability===
−
<div>
+
[http://www.gatecse.in/verbal-ability/ Webpage for Verbal Ability]
−
<ul>
 
−
<li>English grammar, sentence completion </li>
 
−
<li> Verbal analogies, word groups </li>
 
−
<li> Instructions, critical reasoning and verbal deduction </li>
 
−
</ul></div>
 
  
  

Latest revision as of 18:30, 18 April 2016


Best Video Lectures for GATE in CSE

Heads Up! These courses are recommended for a good understanding of Computer Science subjects which is very essential for GATE. Most of the courses here are graduate level meant exclusively for GATE
Please see  Books for GATE for books

Algorithms & Data Structures

Webpage for Algorithms

Webpage for 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. Please see this link if .rm file doesn't work for you https://www.youtube.com/playlist?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm
Introduction to Algorithms

Leiserson, OCW.MIT

One of the lecturers is C. Leiserson, The “L” in CLRS..
Algorithms: Design & Analysis

Coursera

Introduction to Data Structures & Algorithms

NPTEL


Coursera Course

Kevin Wayne, Robert Sedgewick, Princeton University

Course and slides

Databases

Webpage for Databases

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



Compiler Design

Webpage for Compiler Design

Course Videos

Description

CS143 Compilers

Stanford

Comprehensive
Compilers Stanford

Alex Aiken, Coursera

Best notes and assignment for Compiler Course, no video

Operating Systems

Webpage for Operating systems

Course Videos

Description

Operating Systems

P.K.Biswas

Enough for GATE
Computer Science 162 - Lecture 1

UCBerkeley



Theory of Computation

Webpage for Theory of Computation

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. See the below link if .rm files doesn't work for you. https://www.youtube.com/playlist?list=PL601FC994BDD963E4

CO & Architecture

Webpage for CO & Architecture

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



Computer Networks

Webpage for Computer Networks

Course Videos

Description

Computer Networks

NPTEL

Introduction to Computer Networks

Jain, WUSTL



Programming

Webpage for Programming

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



Digital Logic

Webpage for Digital logic

Course Videos

Description

Introduction to Digital Circuits

Prof. S. Srinivasan, IIT Madras, NPTEL


Engineering Mathematics

Combinatory & Probability

Webpage for Combinatory


Webpage for 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

Webpage for Mathematical logic


Webpage for Set Theory & Algebra

Course Videos

Description

"Shai Simonson" From Aduni series- really good
Discrete Mathematical Structures

Prof. Kamala Krithivasan, IIT Madras, NPTEL

Covers Mathematical logic, Set Theory and Algebra syllabus from GATE completely

Graph Theory

Webpage for Graph theory

Course Videos

Description

Graph Theory

NPTEL

Advanced course, just take what you need from GATE syllabus


Linear Algebra

Webpage for Linear Algebra

Course Videos

Description

Linear Algebra

Gilbert Strang, OCW.MIT

Straight from the master


Calculus

Webpage for Calculus


Course Videos

Description

Single Variable Calculus

David Jerison, OCW.MIT

Very good videos


General Aptitude

Numerical Ability

Webpage for Numerical Ability


Verbal Ability

Webpage for Verbal Ability




blog comments powered by Disqus
Retrieved from "https://gatecse.in/w/index.php?title=Best_video_lectures_for_CSE&oldid=5637"

Best Video Lectures for GATE in CSE[edit]

Heads Up! These courses are recommended for a good understanding of Computer Science subjects which is very essential for GATE. Most of the courses here are graduate level meant exclusively for GATE

Algorithms & Data Structures[edit]

Algorithms:

  • Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis;
  • Design: Greedy approach, Dynamic programming, Divide-and-conquer;
  • Tree and graph traversals, Connected components, Spanning trees, Shortest paths;
  • Hashing, Sorting, Searching.
  • 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.

Data Structures:

  • Abstract data types, Arrays, Stacks, Queues
  • Linked Lists
  • Trees, Binary search trees, Binary heaps.

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



Databases[edit]

  • ER-model, Relational model (relational algebra, tuple calculus)
  • Database design (integrity constraints, normal forms)
  • Query languages (SQL)
  • File structures (sequential files, indexing, B and B+ trees)
  • Transactions and concurrency control

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



Compiler Design[edit]

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

Course Videos

Description

CS143 Compilers

Stanford

Best notes and assignment for Compiler Course, no video
Compilers Stanford

Alex Aiken, Coursera

Comprehensive



Operating Systems[edit]

  • Processes, Threads, Inter-process communication
  • Concurrency, Synchronization
  • Deadlock
  • CPU scheduling
  • Memory management and virtual memory
  • File systems, I/O systems, Protection and security.

Course Videos

Description

Operating Systems

P.K.Biswas

Enough for GATE
Computer Science 162 - Lecture 1

UCBerkeley



Theory of Computation[edit]

  • Regular languages and finite automata
  • Context free languages and Push-down automata
  • Recursively enumerable sets and Turing machines
  • Undecidability.

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.



CO & Architecture[edit]

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

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



Computer Networks[edit]

  • 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, and routers
  • Network security – basic concepts of public key and private key cryptography, digital signature, firewalls

Course Videos

Description

Computer Networks

NPTEL

Introduction to Computer Networks

Jain, WUSTL



Programming[edit]

  • Programming in C
  • Functions, Recursion
  • Parameter passing, Scope, Binding

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



Digital Logic[edit]

  • Logic functions, Minimization
  • Design and synthesis of combinational and sequential circuits
  • Number representation and computer arithmetic (fixed and floating point)

Course Videos

Description

Introduction to Digital Circuits

Prof. S. Srinivasan, IIT Madras, NPTEL



Information Systems and Software Engineering[edit]

  • Information gathering, requirement and feasibility analysis data flow diagrams
  • Process specifications, input/output design, process life cycle
  • Planning and managing the project, design, coding
  • Testing, implementation, maintenance.

Course Videos

Description

Introduction to Software Engineering Challenges

IIT Bombay, NPTEL



Web technologies[edit]

  • HTML, XML
  • Basic concepts of client-server computing

Course Videos

Description

Web Technologies Basics

Telerik Academy

This presentation is enough for GATE.


Engineering Mathematics[edit]

Combinatory & Probability[edit]

Combinatory

  • Permutations, Combinations
  • Counting, Summation
  • Generating functions, recurrence relations, asymptotics

Probability

  • Conditional Probability
  • Mean, Median, Mode and Standard Deviation
  • Random Variables
  • Distributions; uniform, normal, exponential, Poisson, Binomial.

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[edit]

Mathematical Logic

  • Propositional Logic
  • First Order Logic


Set Theory & Algebra

  • Sets, Relations, Functions
  • Groups
  • Partial Orders, Lattice
  • Boolean Algebra

Course Videos

Description

Discrete Mathematical Structures

Prof. Kamala Krithivasan, IIT Madras, NPTEL

Covers Mathematical logic, Set Theory and Algebra syllabus from GATE completely

Graph Theory[edit]

  • Connectivity, spanning trees
  • Cut vertices & edges
  • Covering, matching, independent sets
  • Colouring, Planarity, Isomorphism

Course Videos

Description

Graph Theory

NPTEL

Advanced course, just take what you need from GATE syllabus


Linear Algebra[edit]

  • Algebra of matrices, determinants
  • Systems of linear equations
  • Eigen values and Eigen vectors

Course Videos

Description

Linear Algebra

Gilbert Strang, OCW.MIT

Straight from the master


Numerical Methods & Calculus[edit]

Numerical Methods

  • LU decomposition for systems of linear equations
  • Numerical solutions of non-linear algebraic equations by Secant, Bisection and Newton-Raphson Methods
  • Numerical integration by trapezoidal and Simpson’s rules

Calculus

  • Limit, Continuity & differentiability
  • Mean value theorems
  • Theorems of integral calculus, evaluation of definite & improper integrals
  • Partial derivatives, Total derivatives, maxima & minima

Course Videos

Description

Single Variable Calculus

David Jerison, OCW.MIT

Very good videos


General Aptitude[edit]

Numerical Ability[edit]

  • Numerical computation
  • Numerical estimation
  • Numerical reasoning and data interpretation


Verbal Ability[edit]

  • English grammar, sentence completion
  • Verbal analogies, word groups
  • Instructions, critical reasoning and verbal deduction




blog comments powered by Disqus