Revision as of 18:12, 29 July 2015

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

Algorithms: Webpage for Algorithms

Data Structures:
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. Plese 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..
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

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

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

Combinatory Webpage for Combinatory

Probability 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

Mathematical Logic Webpage for Mathematical logic

Set Theory & Algebra Webpage for 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

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

@@ Line 11: / Line 11: @@
 ==Algorithms  & Data Structures ==
-<div>
 <b> Algorithms:</b>
-<ul>
+[http://www.gatecse.org/algorithms/ Webpage for Algorithms]
-<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></div>
-<div>
 <b> Data Structures: </b> <br>
-<ul>
+[http://www.gatecse.org/data-structures/ Webpage for Data structures]
-<li> Abstract data types, Arrays, Stacks, Queues </li>
-<li> Linked Lists </li>
-<li>Trees, Binary search trees, Binary heaps. </li>
-</ul></div>
 {| class="wikitable"
 ! style="color: #f7f7f7; background-color: #3b5998;"|
@@ Line 51: / Line 43: @@
 ==Databases==
-<div>
+[http://www.gatecse.org/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"
 ! style="color: #f7f7f7; background-color: #3b5998;"|
@@ Line 79: / Line 64: @@
 ==Compiler Design==
-<div>
+[http://www.gatecse.org/compiler-design/ 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"
 ! style="color: #f7f7f7; background-color: #3b5998;"|
@@ Line 101: / Line 82: @@
 ==Operating Systems==
-<div>
+[http://www.gatecse.org/operating-systems/ Webpage for Operating systems]
-<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"
 ! style="color: #f7f7f7; background-color: #3b5998;"|
@@ Line 129: / Line 103: @@
 ==Theory of Computation==
-<div>
+[http://www.gatecse.org/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"
 ! style="color: #f7f7f7; background-color: #3b5998;"|
@@ Line 148: / Line 117: @@
 ==CO & Architecture==
-<div>
+[http://www.gatecse.org/co-architecture/ Webpage for CO & Architecture]
-<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"
 ! style="color: #f7f7f7; background-color: #3b5998;"|
@@ Line 180: / Line 142: @@
 ==Computer Networks==
-<div>
+[http://www.gatecse.org/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"
 ! style="color: #f7f7f7; background-color: #3b5998;"|
@@ Line 207: / Line 163: @@
 ==Programming==
-<div>
+[http://www.gatecse.org/programming/Webpage for Programming]
-<ul>
-<li> Programming in C </li>
-<li> Functions, Recursion </li>
-<li> Parameter passing, Scope, Binding </li>
-</ul> </div>
 {|class="wikitable"
 ! style="color: #f7f7f7; background-color: #3b5998;"|
@@ Line 232: / Line 184: @@
 ==Digital Logic==
-<div>
+[http://www.gatecse.org/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"
 ! style="color: #f7f7f7; background-color: #3b5998;"|
@@ Line 248: / Line 195: @@
 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"
-! 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>
-</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.
 |}
@@ Line 300: / Line 204: @@
 ===Combinatory & Probability===
 '''Combinatory'''
-<div>
+[http://www.gatecse.org/combinatory/ Webpage for Combinatory]
-<ul>
-<li>Permutations, Combinations </li>
-<li> Counting, Summation </li>
-<li> Generating functions, recurrence relations, asymptotics </li>
-</ul></div>
 '''Probability'''
-<div>
+[http://www.gatecse.org/probability/ Webpage for Probability]
-<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"
 ! style="color: #f7f7f7; background-color: #3b5998;"|
@@ Line 334: / Line 229: @@
 '''Mathematical Logic'''
-<div>
+[http://www.gatecse.org/mathematical-logic/ Webpage for Mathematical logic]
-<ul>
-<li>Propositional Logic </li>
-<li> First Order Logic </li>
-</ul> </div>
-<div>
+'''Set Theory & Algebra'''
+[http://www.gatecse.org/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"
 ! style="color: #f7f7f7; background-color: #3b5998;"|
@@ Line 361: / Line 246: @@
 ===Graph Theory===
-<div>
+[http://www.gatecse.org/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"
 ! style="color: #f7f7f7; background-color: #3b5998;"|
@@ Line 381: / Line 261: @@
 ===Linear Algebra===
-<div><ul>
+[http://www.gatecse.org/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"
 ! style="color: #f7f7f7; background-color: #3b5998;"|
@@ Line 399: / Line 276: @@
-===Numerical Methods & Calculus===
+=== Calculus===
-'''Numerical Methods'''
+[http://www.gatecse.org/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"
@@ Line 431: / Line 294: @@
 ==General Aptitude==
 ===Numerical Ability===
-<div>
+[http://www.gatecse.org/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===
-<div>
+[http://www.gatecse.org/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>

Difference between revisions of "Best video lectures for CSE"

Revision as of 18:12, 29 July 2015

Contents

Best Video Lectures for GATE in CSE

Algorithms & Data Structures

Databases

Compiler Design

Operating Systems

Theory of Computation

CO & Architecture

Computer Networks

Programming

Digital Logic

Engineering Mathematics

Combinatory & Probability

Mathematical Logic, Set Theory & Algebra

Graph Theory

Linear Algebra

Calculus

General Aptitude

Numerical Ability

Verbal Ability

Contents

Best Video Lectures for GATE in CSE[edit]

Algorithms & Data Structures[edit]

Databases[edit]

Compiler Design[edit]

Operating Systems[edit]

Theory of Computation[edit]

CO & Architecture[edit]

Computer Networks[edit]

Programming[edit]

Digital Logic[edit]

Engineering Mathematics[edit]

Combinatory & Probability[edit]

Mathematical Logic, Set Theory & Algebra[edit]

Graph Theory[edit]

Linear Algebra[edit]

Calculus[edit]

General Aptitude[edit]

Numerical Ability[edit]

Verbal Ability[edit]