Difference between revisions of "Test"

(→‎Mathematical Logic, Set Theory & Algebra)
 
(110 intermediate revisions by the same user not shown)
Line 1: Line 1:
−
<html>
+
 
−
<script type="text/javascript">
+
==Algorithms  & Data Structures ==
−
google_ad_client = "ca-pub-1529295637495038";
+
<div>
−
/* gatecse */
+
<b> Algorithms:</b>  
−
google_ad_slot = "7029101319";
+
<ul>
−
google_ad_width = 728;
+
<li>Analysis, Asymptotic notation, Notions of space and time complexity, Worst and
−
google_ad_height = 90;
+
average case analysis; </li>
−
</script>
+
<li>Design: Greedy approach, Dynamic programming, Divide-and-conquer; </li>
−
<script async src="//pagead2.googlesyndication.com/pagead/js/adsbygoogle.js"></script>
+
<li> Tree and graph traversals, Connected components, Spanning trees, Shortest paths; </li>
−
<!-- gatecse -->
+
<li>Hashing, Sorting, Searching. </li>
−
<ins class="adsbygoogle"
+
<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>
−
    style="display:inline-block;width:728px;height:90px"
+
<div>
−
    data-ad-client="ca-pub-1529295637495038"
+
<b> Data Structures: </b> <br>
−
    data-ad-slot="7029101319"></ins>
+
<ul>
−
<script>
+
<li> Abstract data types, Arrays, Stacks, Queues </li>
−
(adsbygoogle = window.adsbygoogle || []).push({});
+
<li> Linked Lists </li>
−
</script>
+
<li>Trees, Binary search trees, Binary heaps. </li>
−
</html>
+
</ul></div>
−
==Algorithms==
+
{| class="wikitable"
 +
! style="color: #f7f7f7; background-color: #3b5998;"|
 +
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 +
Description
 +
|-
 +
| [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://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==
 +
<div>
 +
<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"
−
! Book
+
! style="color: #f7f7f7; background-color: #3b5998;"|
−
! Description
+
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 +
Description
 
|-
 
|-
−
| [http://www.flipkart.com/introduction-algorithms-english-3rd/p/itmdwxyrafdburzg?pid=9788120340077&otracker=from-search&srno=t_2&query=cormen&ref=510d0180-8463-4da4-aad8-2a9c48597772 Introduction to Algorithms, C.L.R.S.]
+
| [https://www.youtube.com/playlist?list=PLyvBGMFYV3auVdxQ1-88ivNFpmUEy-U3M ''DBMS NPTEL PPC - IIT KGP'']
−
| 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)
+
NPTEL
 +
| IIT KGP PPC DBMS lecture is good one
 
|-
 
|-
−
| [http://www.flipkart.com/fundamentals-computer-algorithms-english-2nd/p/itmeyf6efzzdvfzw?pid=9788173716126&otracker=from-search&srno=t_2&query=Fundamentals+of+Algorithms,+by+Horowitz+,+Sahni+,+Rajasekaran.&ref=a205f320-efd0-49d4-9420-000c3dba7e24 Fundamentals of Computer Algorithms, Rajasekaran, Sahni, Horowitz]
+
| [http://web.stanford.edu/class/cs145/ ''CS145 Introduction to Databases'' ]
−
| This book is Mini version of Cormen’s book , this cover almost everything with short discussions ,which is written in Cormen with more pages. 
+
Stanford
−
Use this book along with NPTEL lecture of Professor Naveen Garg .
+
|Course and slides for DBMS
−
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:
+
|}
 +
 
  
−
[http://ww3.algorithmdesign.net/handouts/ http://ww3.algorithmdesign.net/handouts/]
+
 
 +
 
 +
==Compiler Design==
 +
<div>
 +
<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;"|
 +
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 +
Description
 
|-
 
|-
−
|[http://www.flipkart.com/design-analysis-computer-algorithms-english-1st/p/itmdytssm9frfuqg?pid=9788131702055&otracker=from-search&srno=t_1&query=Alfred+V.Aho,Hopcroft+and+Jeffrey+Ullman.+algorithms&ref=e55b7825-5b49-4c97-935b-789e98ca0b1d Design & Analysis of Computer Algorithms, Aho, Hopcroft, Ullman]
+
|[https://www.youtube.com/playlist?list=PLFB9EC7B8FE963EB8&feature=plcp ''CS143 Compilers'' ]
−
| Another classic book for algorithms.
+
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
 
|}
 
|}
−
==Databases==
+
 
 +
 
 +
 
 +
 
 +
==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"
−
! Book
+
! style="color: #f7f7f7; background-color: #3b5998;"|
−
! Comment
+
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 +
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==
 +
<div>
 +
<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;"|
 +
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 +
Description
 +
|-
 +
|[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==
 +
<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"
 +
! style="color: #f7f7f7; background-color: #3b5998;"|
 +
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 +
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
 +
|
 
|-
 
|-
−
| s
+
|[https://www.youtube.com/course?category=University%2FScience%2FComputer%2520Science%2FComputer%2520Architecture&list=EC1A5A6AE8AFC187B7&feature=edu ''Computer Organization'' ]
−
| g
+
Prof. S. Raman, IIT Madras, NPTEL
 +
|
 
|-
 
|-
 +
| [https://www.coursera.org/course/comparch ''Computer Architecture'']
 +
David Wentzlaff, Princeton University, Coursera
 +
| Full Course
 +
|}
 +
 +
 +
 +
 +
==Computer Networks==
 +
<div>
 +
<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;"|
 +
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 +
Description
 +
|-
 +
|[http://nptel.ac.in/video.php?subjectId=106105081 ''Computer Networks'']
 +
NPTEL
 +
|
 +
|-
 +
|[http://www.cse.wustl.edu/~jain/cse473-10/index.html ''Introduction to Computer Networks'']
 +
Jain, WUSTL
 
|  
 
|  
 +
|}
 +
 +
 +
 +
 +
==Programming==
 +
<div>
 +
<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;"|
 +
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 +
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'']
 +
UCBerkeley
 +
|For Data structures
 +
|}
 +
 +
 +
 +
 +
==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"
 +
! style="color: #f7f7f7; background-color: #3b5998;"|
 +
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 +
Description
 +
|-
 +
| [https://www.youtube.com/watch?v=CeD2L6KbtVM ''Introduction to Digital Circuits'']
 +
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.
 +
|}
 +
 +
 +
 +
== 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"
 +
! style="color: #f7f7f7; background-color: #3b5998;"|
 +
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 +
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.
 +
|}
 +
 +
 +
===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"
 +
! style="color: #f7f7f7; background-color: #3b5998;"|
 +
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 +
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===
 +
<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"
 +
! style="color: #f7f7f7; background-color: #3b5998;"|
 +
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 +
Description
 +
|-
 +
|[http://www.nptel.ac.in/courses/106108054/1''Graph Theory'']
 +
NPTEL
 +
|Advanced course, just take what you need from GATE syllabus
 +
|}
 +
 +
 +
===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"
 +
! style="color: #f7f7f7; background-color: #3b5998;"|
 +
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 +
Description
 +
|-
 +
|[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'''
 +
<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"
 +
! style="color: #f7f7f7; background-color: #3b5998;"|
 +
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 +
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
 +
|}
 +
 +
 +
==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>

Latest revision as of 10:44, 10 October 2014

Algorithms & Data Structures

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

  • 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

  • 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

  • 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

  • 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

  • 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

  • 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

  • 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

  • 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

  • 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

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

Course Videos

Description

Web Technologies Basics

Telerik Academy

This presentation is enough for GATE.


Engineering Mathematics

Combinatory & Probability

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

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

  • 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

  • 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

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

Numerical Ability

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


Verbal Ability

  • English grammar, sentence completion
  • Verbal analogies, word groups
  • Instructions, critical reasoning and verbal deduction
Retrieved from "https://gatecse.in/w/index.php?title=Test&oldid=4437"

Algorithms[edit]

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:

http://ww3.algorithmdesign.net/handouts/

Design & Analysis of Computer Algorithms, Aho, Hopcroft, Ullman Another classic book for algorithms.

Databases[edit]

Book Comment
s g