<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>https://gatecse.in/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Prashant+Gupta</id>
		<title>GATECSE - User contributions [en]</title>
		<link rel="self" type="application/atom+xml" href="https://gatecse.in/w/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Prashant+Gupta"/>
		<link rel="alternate" type="text/html" href="https://gatecse.in/wiki/Special:Contributions/Prashant_Gupta"/>
		<updated>2026-04-16T12:16:25Z</updated>
		<subtitle>User contributions</subtitle>
		<generator>MediaWiki 1.27.0</generator>

	<entry>
		<id>https://gatecse.in/w/index.php?title=Best_video_lectures_for_CSE&amp;diff=4592</id>
		<title>Best video lectures for CSE</title>
		<link rel="alternate" type="text/html" href="https://gatecse.in/w/index.php?title=Best_video_lectures_for_CSE&amp;diff=4592"/>
				<updated>2014-10-27T16:58:46Z</updated>
		
		<summary type="html">&lt;p&gt;Prashant Gupta: /* Compiler Design */&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;&amp;lt;metadesc&amp;gt;Best video lectures for GATE preparation in Computer Science (CS)&amp;lt;/metadesc&amp;gt;&lt;br /&gt;
&amp;lt;!--&amp;lt;gdoc id=&amp;quot;1EnS54bTqAm2vAJB_TllpfEzWC8uGxJjGRS1yVHAGLuE&amp;quot; /&amp;gt;--&amp;gt;&lt;br /&gt;
__NOTITLE__&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=Best Video Lectures for GATE in CSE=&lt;br /&gt;
&lt;br /&gt;
{{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}}&lt;br /&gt;
&lt;br /&gt;
 Please see [[Best_books_for_CSE| Books for GATE]] for books&lt;br /&gt;
&lt;br /&gt;
==Algorithms  &amp;amp; Data Structures ==&lt;br /&gt;
&amp;lt;div&amp;gt;&lt;br /&gt;
&amp;lt;b&amp;gt; Algorithms:&amp;lt;/b&amp;gt; &lt;br /&gt;
&amp;lt;ul&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;Analysis, Asymptotic notation, Notions of space and time complexity, Worst and &lt;br /&gt;
average case analysis; &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;Design: Greedy approach, Dynamic programming, Divide-and-conquer; &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;Hashing, Sorting, Searching. &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;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. &amp;lt;/li&amp;gt; &amp;lt;/ul&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&amp;lt;div&amp;gt;&lt;br /&gt;
&amp;lt;b&amp;gt; Data Structures: &amp;lt;/b&amp;gt; &amp;lt;br&amp;gt;&lt;br /&gt;
&amp;lt;ul&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Abstract data types, Arrays, Stacks, Queues &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Linked Lists &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;Trees, Binary search trees, Binary heaps. &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;/ul&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;color: #f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Course Videos&lt;br /&gt;
! style=&amp;quot;width: 70%;color:#f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Description&lt;br /&gt;
|-&lt;br /&gt;
| [http://www.aduni.org/courses/algorithms/index.php?view=cw &amp;#039;&amp;#039;Algorithms&amp;#039;&amp;#039;]&lt;br /&gt;
Shai Simonson, Aduni.org&lt;br /&gt;
| 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&amp;#039;t work for you https://www.youtube.com/playlist?list=PLFDnELG9dpVxQCxuD-9BSy2E7BWY3t5Sm&lt;br /&gt;
|-&lt;br /&gt;
|[http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-046j-introduction-to-algorithms-sma-5503-fall-2005/video-lectures/ &amp;#039;&amp;#039;Introduction to Algorithms&amp;#039;&amp;#039;]&lt;br /&gt;
Leiserson, OCW.MIT&lt;br /&gt;
|One of the lecturers is C. Leiserson, The “L” in CLRS..&lt;br /&gt;
|-&lt;br /&gt;
| [http://nptel.ac.in/video.php?subjectId=106102064  &amp;#039;&amp;#039;Introduction to Data Structures &amp;amp; Algorithms&amp;#039;&amp;#039; ]&lt;br /&gt;
NPTEL&lt;br /&gt;
| &lt;br /&gt;
|-&lt;br /&gt;
|[https://www.coursera.org/course/algs4partI  Coursera Course]&lt;br /&gt;
Kevin Wayne, Robert Sedgewick, Princeton University&lt;br /&gt;
| Course and slides&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Databases==&lt;br /&gt;
&amp;lt;div&amp;gt;&lt;br /&gt;
&amp;lt;ul&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; ER-model, Relational model (relational algebra, tuple calculus) &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Database design (integrity constraints, normal forms) &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Query languages (SQL) &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; File structures (sequential files, indexing, B and B+ trees) &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Transactions and concurrency control &amp;lt;/li&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;lt;/ul&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;color: #f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Course Videos&lt;br /&gt;
! style=&amp;quot;width: 70%;color:#f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Description&lt;br /&gt;
|-&lt;br /&gt;
| [https://www.youtube.com/playlist?list=PLyvBGMFYV3auVdxQ1-88ivNFpmUEy-U3M &amp;#039;&amp;#039;DBMS NPTEL PPC - IIT KGP&amp;#039;&amp;#039;]&lt;br /&gt;
NPTEL&lt;br /&gt;
| IIT KGP PPC DBMS lecture is good one&lt;br /&gt;
|-&lt;br /&gt;
| [http://web.stanford.edu/class/cs145/ &amp;#039;&amp;#039;CS145 Introduction to Databases&amp;#039;&amp;#039; ]&lt;br /&gt;
Stanford&lt;br /&gt;
|Course and slides for DBMS&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
[https://www.youtube.com/playlist?list=PLEbnTDJUr_IcPtUXFy2b1sGRPsLFMghhS]==Compiler Design==&lt;br /&gt;
&amp;lt;div&amp;gt;&lt;br /&gt;
&amp;lt;ul&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;Lexical analysis, Parsing &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Syntax directed translation, Runtime environments &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;Intermediate and target code generation, Basics of code optimization. &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;/ul&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;color: #f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Course Videos&lt;br /&gt;
! style=&amp;quot;width: 70%;color:#f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Description&lt;br /&gt;
|-&lt;br /&gt;
|[https://www.youtube.com/playlist?list=PLFB9EC7B8FE963EB8&amp;amp;feature=plcp &amp;#039;&amp;#039;CS143 Compilers&amp;#039;&amp;#039; ]&lt;br /&gt;
Stanford&lt;br /&gt;
|Best notes and assignment for Compiler Course, no video&lt;br /&gt;
|-&lt;br /&gt;
|[http://web.stanford.edu/class/archive/cs/cs143/cs143.1128/ &amp;#039;&amp;#039;Compilers Stanford&amp;#039;&amp;#039; ]&lt;br /&gt;
Alex Aiken, Coursera&lt;br /&gt;
| Comprehensive&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==Operating Systems==&lt;br /&gt;
&amp;lt;div&amp;gt;&lt;br /&gt;
&amp;lt;ul&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Processes, Threads, Inter-process communication &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Concurrency, Synchronization &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Deadlock &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; CPU scheduling &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Memory management and virtual memory &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; File systems, I/O systems, Protection and security. &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;/ul&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
{| class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;color: #f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Course Videos&lt;br /&gt;
! style=&amp;quot;width: 70%;color:#f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Description&lt;br /&gt;
|-&lt;br /&gt;
| [https://www.youtube.com/playlist?list=PLLDC70psjvq5hIT0kfr1sirNuees0NIbG &amp;#039;&amp;#039;Operating Systems&amp;#039;&amp;#039; ]&lt;br /&gt;
P.K.Biswas&lt;br /&gt;
| Enough for GATE&lt;br /&gt;
|-&lt;br /&gt;
|[https://www.youtube.com/watch?v=sjs5PtCsVA4&amp;amp;index=1&amp;amp;list=PLEAFEC6160DADC7AA &amp;#039;&amp;#039;Computer Science 162 - Lecture 1&amp;#039;&amp;#039; ]&lt;br /&gt;
UCBerkeley&lt;br /&gt;
|&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Theory of Computation==&lt;br /&gt;
&amp;lt;div&amp;gt;&lt;br /&gt;
&amp;lt;ul&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;   Regular languages and finite automata &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;Context free languages and Push-down automata &amp;lt;/li&amp;gt; &lt;br /&gt;
&amp;lt;li&amp;gt;Recursively enumerable sets and Turing machines&amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Undecidability. &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;/ul&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;color: #f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Course Videos&lt;br /&gt;
! style=&amp;quot;width: 70%;color:#f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Description&lt;br /&gt;
|-&lt;br /&gt;
|[http://www.aduni.org/courses/theory/index.php?view=cw &amp;#039;&amp;#039;Theory of Computation&amp;#039;&amp;#039; ]&lt;br /&gt;
Shai Simonson, Aduni.org&lt;br /&gt;
| 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&amp;#039;t work for you. https://www.youtube.com/playlist?list=PL601FC994BDD963E4&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
==CO &amp;amp; Architecture==&lt;br /&gt;
&amp;lt;div&amp;gt;&lt;br /&gt;
&amp;lt;ul&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Machine instructions and addressing modes&amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; ALU and data-path, CPU control design&amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Memory interface, I/O interface (Interrupt and DMA mode) &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Instruction pipelining &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Cache and main memory, Secondary storage. &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;/ul&amp;gt;&lt;br /&gt;
&amp;lt;/div&amp;gt;&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;color: #f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Course Videos&lt;br /&gt;
! style=&amp;quot;width: 70%;color:#f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Description&lt;br /&gt;
|-&lt;br /&gt;
|[https://www.youtube.com/course?category=University%2FScience%2FComputer%2520Science%2FComputer%2520Architecture&amp;amp;list=EC1A5A6AE8AFC187B7&amp;amp;feature=edu &amp;#039;&amp;#039;Computer Architecture&amp;#039;&amp;#039; ]&lt;br /&gt;
Prof. Anshul Kumar, IIT Delhi, NPTEL&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|[https://www.youtube.com/course?category=University%2FScience%2FComputer%2520Science%2FComputer%2520Architecture&amp;amp;list=EC1A5A6AE8AFC187B7&amp;amp;feature=edu &amp;#039;&amp;#039;Computer Organization&amp;#039;&amp;#039; ]&lt;br /&gt;
Prof. S. Raman, IIT Madras, NPTEL&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
| [https://www.coursera.org/course/comparch &amp;#039;&amp;#039;Computer Architecture&amp;#039;&amp;#039;]&lt;br /&gt;
David Wentzlaff, Princeton University, Coursera&lt;br /&gt;
| Full Course&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Computer Networks==&lt;br /&gt;
&amp;lt;div&amp;gt;&lt;br /&gt;
&amp;lt;ul&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; ISO/OSI stack, LAN technologies (Ethernet, Token ring) &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Flow and error control techniques, Routing algorithms, Congestion control &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; TCP/UDP and sockets, IP(v4), Application layer protocols (icmp, dns, smtp, pop, ftp, http)&amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;Basic concepts of hubs, switches, gateways, and routers&amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Network security – basic concepts of public key and private key cryptography, digital signature, firewalls &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;/ul&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;color: #f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Course Videos&lt;br /&gt;
! style=&amp;quot;width: 70%;color:#f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Description&lt;br /&gt;
|-&lt;br /&gt;
|[http://nptel.ac.in/video.php?subjectId=106105081 &amp;#039;&amp;#039;Computer Networks&amp;#039;&amp;#039;]&lt;br /&gt;
NPTEL&lt;br /&gt;
|&lt;br /&gt;
|-&lt;br /&gt;
|[http://www.cse.wustl.edu/~jain/cse473-10/index.html &amp;#039;&amp;#039;Introduction to Computer Networks&amp;#039;&amp;#039;]&lt;br /&gt;
Jain, WUSTL&lt;br /&gt;
| &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Programming==&lt;br /&gt;
&amp;lt;div&amp;gt;&lt;br /&gt;
&amp;lt;ul&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Programming in C &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Functions, Recursion &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Parameter passing, Scope, Binding &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;/ul&amp;gt; &amp;lt;/div&amp;gt;&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;color: #f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Course Videos&lt;br /&gt;
! style=&amp;quot;width: 70%;color:#f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Description&lt;br /&gt;
|-&lt;br /&gt;
|[https://www.youtube.com/watch?v=_eR4rxnM7Lc&amp;amp;list=PL9D558D49CA734A02&amp;amp;index=4 &amp;#039;&amp;#039;Programming Paradigms&amp;#039;&amp;#039;]&lt;br /&gt;
Jerry Cain, Stanford&lt;br /&gt;
| Doesn&amp;#039;t cover the entire GATE syllabus in programming but useful&lt;br /&gt;
|-&lt;br /&gt;
|[https://www.youtube.com/course?category=University%2FEngineering%2FComputer%2520Science%2FData%2520Structures&amp;amp;list=EC4BBB74C7D2A1049C&amp;amp;feature=edu &amp;#039;&amp;#039;Computer Science 61B - Fall 2006&amp;#039;&amp;#039;]&lt;br /&gt;
UCBerkeley&lt;br /&gt;
|For Data structures&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Digital Logic==&lt;br /&gt;
&amp;lt;div&amp;gt;&lt;br /&gt;
&amp;lt;ul&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;Logic functions, Minimization &amp;lt;/li&amp;gt;&lt;br /&gt;
 &amp;lt;li&amp;gt; Design and synthesis of combinational and sequential circuits &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Number representation and computer arithmetic (fixed and floating point) &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;/ul&amp;gt;&lt;br /&gt;
&amp;lt;/div&amp;gt;&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;color: #f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Course Videos&lt;br /&gt;
! style=&amp;quot;width: 70%;color:#f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Description&lt;br /&gt;
|-&lt;br /&gt;
| [https://www.youtube.com/watch?v=CeD2L6KbtVM &amp;#039;&amp;#039;Introduction to Digital Circuits&amp;#039;&amp;#039;]&lt;br /&gt;
Prof. S. Srinivasan, IIT Madras, NPTEL&lt;br /&gt;
| &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Information Systems and Software Engineering==&lt;br /&gt;
&amp;lt;div&amp;gt;&lt;br /&gt;
&amp;lt;ul&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;Information gathering, requirement and feasibility analysis data flow diagrams &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;Process specifications, input/output design, process life cycle &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;Planning and managing the project, design, coding &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;Testing, implementation, maintenance. &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;/ul&amp;gt; &amp;lt;/div&amp;gt;&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;color: #f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Course Videos&lt;br /&gt;
! style=&amp;quot;width: 70%;color:#f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Description&lt;br /&gt;
|-&lt;br /&gt;
|[http://nptel.ac.in/courses/106101061/ &amp;#039;&amp;#039;Introduction to Software Engineering Challenges&amp;#039;&amp;#039;]&lt;br /&gt;
IIT Bombay, NPTEL&lt;br /&gt;
| &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==Web technologies==&lt;br /&gt;
&amp;lt;div&amp;gt;&lt;br /&gt;
&amp;lt;ul&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; HTML, XML &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;Basic concepts of client-server computing &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;/ul&amp;gt;&lt;br /&gt;
&amp;lt;/div&amp;gt;&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;color: #f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Course Videos&lt;br /&gt;
! style=&amp;quot;width: 70%;color:#f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Description&lt;br /&gt;
|-&lt;br /&gt;
|[http://gatecse.in/w/images/0/02/Web-Technologies-Fundamentals-and-HTTP.pptx &amp;#039;&amp;#039;Web Technologies Basics&amp;#039;&amp;#039;]&lt;br /&gt;
Telerik Academy&lt;br /&gt;
| This presentation is enough for GATE. &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Engineering Mathematics==&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Combinatory &amp;amp; Probability===&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Combinatory&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&amp;lt;div&amp;gt;&lt;br /&gt;
&amp;lt;ul&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;Permutations, Combinations &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Counting, Summation &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Generating functions, recurrence relations, asymptotics &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;/ul&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Probability&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&amp;lt;div&amp;gt;&lt;br /&gt;
&amp;lt;ul&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;Conditional Probability &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;Mean, Median, Mode and Standard Deviation &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Random Variables &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Distributions; uniform, normal, exponential, Poisson, Binomial. &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;/ul&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;color: #f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Course Videos&lt;br /&gt;
! style=&amp;quot;width: 70%;color:#f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Description&lt;br /&gt;
|-&lt;br /&gt;
|[https://www.youtube.com/playlist?list=PL5BC8D7CFBA5732EA &amp;#039;&amp;#039;Sets, Counting, and Probability&amp;#039;&amp;#039;]&lt;br /&gt;
Harvard&lt;br /&gt;
|Covers the basics&lt;br /&gt;
|-&lt;br /&gt;
|[https://www.youtube.com/playlist?list=PLvjECquwN5_Emuhi-ISxBOk82-zp-6lTf &amp;#039;&amp;#039;Applied Probability&amp;#039;&amp;#039;]&lt;br /&gt;
MIT&lt;br /&gt;
|Advanced course and topics are mostly above GATE syllabus. &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Mathematical Logic, Set Theory &amp;amp; Algebra=== &lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Mathematical Logic&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&amp;lt;div&amp;gt;&lt;br /&gt;
&amp;lt;ul&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;Propositional Logic &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; First Order Logic &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;/ul&amp;gt; &amp;lt;/div&amp;gt;&lt;br /&gt;
&amp;lt;div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Set Theory &amp;amp; Algebra&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&amp;lt;ul&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Sets, Relations, Functions &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Groups &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Partial Orders, Lattice &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Boolean Algebra &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;/ul&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;color: #f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Course Videos&lt;br /&gt;
! style=&amp;quot;width: 70%;color:#f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Description&lt;br /&gt;
|-&lt;br /&gt;
|[https://www.youtube.com/view_play_list?p=0862D1A947252D20 &amp;#039;&amp;#039;Discrete Mathematical Structures&amp;#039;&amp;#039;]&lt;br /&gt;
Prof. Kamala Krithivasan, IIT Madras, NPTEL&lt;br /&gt;
| Covers Mathematical logic, Set Theory and Algebra syllabus from GATE completely&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
===Graph Theory===&lt;br /&gt;
&amp;lt;div&amp;gt;&lt;br /&gt;
&amp;lt;ul&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;Connectivity, spanning trees&amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Cut vertices &amp;amp; edges &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Covering, matching, independent sets &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Colouring, Planarity, Isomorphism &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;/ul&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;color: #f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Course Videos&lt;br /&gt;
! style=&amp;quot;width: 70%;color:#f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Description&lt;br /&gt;
|-&lt;br /&gt;
|[http://www.nptel.ac.in/courses/106108054/1&amp;#039;&amp;#039;Graph Theory&amp;#039;&amp;#039;]&lt;br /&gt;
NPTEL&lt;br /&gt;
|Advanced course, just take what you need from GATE syllabus&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Linear Algebra===&lt;br /&gt;
&amp;lt;div&amp;gt;&amp;lt;ul&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;Algebra of matrices, determinants &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Systems of linear equations &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Eigen values and Eigen vectors &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;/ul&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;color: #f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Course Videos&lt;br /&gt;
! style=&amp;quot;width: 70%;color:#f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Description&lt;br /&gt;
|-&lt;br /&gt;
|[http://ocw.mit.edu/courses/mathematics/18-06-linear-algebra-spring-2010/video-lectures/ &amp;#039;&amp;#039;Linear Algebra&amp;#039;&amp;#039;]&lt;br /&gt;
Gilbert Strang, OCW.MIT&lt;br /&gt;
| Straight from the master&lt;br /&gt;
|-&lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
===Numerical Methods &amp;amp; Calculus===&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Numerical Methods&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&amp;lt;div&amp;gt;&lt;br /&gt;
&amp;lt;ul&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;LU decomposition for systems of linear equations &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Numerical solutions of non-linear algebraic equations by Secant, Bisection and Newton-Raphson Methods &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Numerical integration by trapezoidal and Simpson’s rules &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;/ul&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&amp;#039;&amp;#039;&amp;#039;Calculus&amp;#039;&amp;#039;&amp;#039;&lt;br /&gt;
&amp;lt;div&amp;gt;&lt;br /&gt;
&amp;lt;ul&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Limit, Continuity &amp;amp; differentiability &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Mean value theorems &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Theorems of integral calculus, evaluation of definite &amp;amp; improper integrals&amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Partial derivatives, Total derivatives, maxima &amp;amp; minima &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;/ul&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
{|class=&amp;quot;wikitable&amp;quot;&lt;br /&gt;
! style=&amp;quot;color: #f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Course Videos&lt;br /&gt;
! style=&amp;quot;width: 70%;color:#f7f7f7; background-color: #3b5998;&amp;quot;|&lt;br /&gt;
Description&lt;br /&gt;
|-&lt;br /&gt;
|[http://ocw.mit.edu/courses/mathematics/18-01-single-variable-calculus-fall-2006/video-lectures/ &amp;#039;&amp;#039;Single Variable Calculus&amp;#039;&amp;#039;]&lt;br /&gt;
David Jerison, OCW.MIT&lt;br /&gt;
| Very good videos &lt;br /&gt;
|}&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
==General Aptitude==&lt;br /&gt;
===Numerical Ability===&lt;br /&gt;
&amp;lt;div&amp;gt;&lt;br /&gt;
&amp;lt;ul&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;Numerical computation &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Numerical estimation &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Numerical reasoning and data interpretation &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;/ul&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
 &lt;br /&gt;
&lt;br /&gt;
===Verbal Ability===&lt;br /&gt;
&amp;lt;div&amp;gt;&lt;br /&gt;
&amp;lt;ul&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt;English grammar, sentence completion &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Verbal analogies, word groups &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;li&amp;gt; Instructions, critical reasoning and verbal deduction &amp;lt;/li&amp;gt;&lt;br /&gt;
&amp;lt;/ul&amp;gt;&amp;lt;/div&amp;gt;&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
{{Template:FBD}}&lt;br /&gt;
&lt;br /&gt;
[[Category:GATE]]&lt;/div&gt;</summary>
		<author><name>Prashant Gupta</name></author>	</entry>

	</feed>