Difference between revisions of "Test"

(→‎Mathematical Logic, Set Theory & Algebra)
 
(59 intermediate revisions by the same user not shown)
Line 1: Line 1:
  
 
==Algorithms  & Data Structures ==
 
==Algorithms  & Data Structures ==
−
<div><b>GATE Topics: </b><br>
+
<div>
 
<b> Algorithms:</b>  
 
<b> Algorithms:</b>  
 
<ul>
 
<ul>
Line 9: Line 9:
 
<li> Tree and graph traversals, Connected components, Spanning trees, Shortest paths; </li>
 
<li> Tree and graph traversals, Connected components, Spanning trees, Shortest paths; </li>
 
<li>Hashing, Sorting, Searching. </li>
 
<li>Hashing, Sorting, Searching. </li>
−
<li>Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes – P, NP, NP-hard, NP-complete. </li> </ul>
+
<li>Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes – P, NP, NP-hard, NP-complete. </li> </ul></div>
−
</div>
+
<div>
 
<b> Data Structures: </b> <br>
 
<b> Data Structures: </b> <br>
 
<ul>
 
<ul>
Line 16: Line 16:
 
<li> Linked Lists </li>
 
<li> Linked Lists </li>
 
<li>Trees, Binary search trees, Binary heaps. </li>
 
<li>Trees, Binary search trees, Binary heaps. </li>
−
</ul>
+
</ul></div>
 
{| class="wikitable"
 
{| class="wikitable"
−
! Book
+
! style="color: #f7f7f7; background-color: #3b5998;"|
−
! style="width: 70%;"|
+
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 
Description
 
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'']
+
| [http://www.aduni.org/courses/algorithms/index.php?view=cw ''Algorithms'']
−
C.L.R.S
+
Shai Simonson, Aduni.org
−
| 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)
+
| 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://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'' ]
+
| [http://nptel.ac.in/video.php?subjectId=106102064  ''Introduction to Data Structures & Algorithms'' ]
−
Rajasekaran, Sahni, Horowitz
+
NPTEL
−
| 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/ http://ww3.algorithmdesign.net/handouts/]
 
 
|-
 
|-
−
|[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'']
+
|[https://www.coursera.org/course/algs4partI  Coursera Course]
−
Aho, Hopcroft, Ullman
+
Kevin Wayne, Robert Sedgewick, Princeton University
−
| Another classic book for algorithms.
+
| Course and slides
 
|}
 
|}
 +
 +
 +
  
 
==Databases==
 
==Databases==
−
<div><b>GATE Topics: </b><br>
+
<div>
 
<ul>
 
<ul>
 
<li> ER-model, Relational model (relational algebra, tuple calculus) </li>
 
<li> ER-model, Relational model (relational algebra, tuple calculus) </li>
Line 48: Line 52:
 
<li> Transactions and concurrency control </li>
 
<li> Transactions and concurrency control </li>
  
−
</ul>
+
</ul></div>
 
{| class="wikitable"
 
{| class="wikitable"
−
! Book
+
! style="color: #f7f7f7; background-color: #3b5998;"|
−
! style="width: 70%;"|
+
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 
Description
 
Description
 
|-
 
|-
−
| [http://www.flipkart.com/database-systems-models-languages-design-application-programming-models-languages-design-english-6th/p/itmdgt9kundwyaxr?pid=9788131792476&otracker=latest-item ''Database Systems'']
+
| [https://www.youtube.com/playlist?list=PLyvBGMFYV3auVdxQ1-88ivNFpmUEy-U3M ''DBMS NPTEL PPC - IIT KGP'']
−
Elmasri, Navathe
+
NPTEL
−
| Covers entire GATE syllabus and especially good for file structures and normalization
+
| IIT KGP PPC DBMS lecture is good one
−
|-
 
−
| [http://www.flipkart.com/database-systems-practical-approach-design-implementation-management-english-4th/p/itmdwrb2tzvhh956?pid=9788131720257&icmpid=reco_pp_same_book_book_4&ppid=9788177585568 ''Database Systems'' ]
 
−
Connolly, Begg
 
−
| Covers entire GATE syllabus and is easy to understand.
 
−
|-
 
−
| [http://www.flipkart.com/database-management-systems-english-3rd/p/itmdy5c3mgcb78dt?pid=9789339213114&otracker=from-search&srno=t_1&query=database+ragu&ref=8b7451f0-6450-457d-8d91-19eb6d44584a ''Database Management Systems'']
 
−
Raghu Ramakrishnan
 
−
| Another very good book especially for  Transaction management and Normalization.
 
−
|-
 
−
|[http://www.flipkart.com/database-system-complete-book-english-1st/p/itmdytst2qhzfgaa ''Database System'' ]
 
−
Widom, Ullman, Garcia-Molina
 
−
|Another very good book.
 
 
|-
 
|-
−
|[http://www.flipkart.com/database-system-concepts-6e-english-6th/p/itmdx5hyjtjjud7b?pid=9789332901384&otracker=from-search&srno=t_1&query=database+silbershatz&ref=46fc387d-8cd6-4a89-975e-5bc84090dfe ''Database System Concepts'']
+
| [http://web.stanford.edu/class/cs145/ ''CS145 Introduction to Databases'' ]
−
Silberschatz
+
Stanford
−
|Very good book but English is bit high standard
+
|Course and slides for DBMS
 
|}
 
|}
 +
 +
 +
  
 
==Compiler Design==
 
==Compiler Design==
−
<b>Compiler Design:</b><br>
+
<div>
 
<ul>
 
<ul>
 
<li>Lexical analysis, Parsing </li>
 
<li>Lexical analysis, Parsing </li>
 
<li> Syntax directed translation, Runtime environments </li>
 
<li> Syntax directed translation, Runtime environments </li>
 
<li>Intermediate and target code generation, Basics of code optimization. </li>
 
<li>Intermediate and target code generation, Basics of code optimization. </li>
−
</ul>
+
</ul></div>
 
{| class="wikitable"
 
{| class="wikitable"
−
! Book
+
! style="color: #f7f7f7; background-color: #3b5998;"|
−
! style="width: 70%;"|
+
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 
Description
 
Description
 
|-
 
|-
−
|[http://www.flipkart.com/compilers-principles-techniques-tools-english-2nd/p/itmdwu94m9nth2wa?pid=9788131721018&otracker=from-search&srno=t_1&query=compilers+principles%2C+techniques%2C+and+tools&ref=fe5f9819-4e41-4010-9dcb-d8e5303f7f60 ''Compilers : Principles, Techniques, & Tools'' ]
+
|[https://www.youtube.com/playlist?list=PLFB9EC7B8FE963EB8&feature=plcp ''CS143 Compilers'' ]
−
Aho, Sethi, Ulman, Lam
+
Stanford
−
| One and only book. If you find the explanations tough, start looking at the given examples, they are easy to follow
+
|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
 
|}
 
|}
 +
 +
 +
 +
 
==Operating Systems==
 
==Operating Systems==
−
<b>Operating System: </b> <br>
+
<div>
 
<ul>
 
<ul>
 
<li> Processes, Threads, Inter-process communication </li>
 
<li> Processes, Threads, Inter-process communication </li>
Line 100: Line 105:
 
<li> Memory management and virtual memory </li>
 
<li> Memory management and virtual memory </li>
 
<li> File systems, I/O systems, Protection and security. </li>
 
<li> File systems, I/O systems, Protection and security. </li>
−
</ul>
+
</ul></div>
 
{| class="wikitable"
 
{| class="wikitable"
−
! Book
+
! style="color: #f7f7f7; background-color: #3b5998;"|
−
! style="width: 70%;"|
+
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 
Description
 
Description
 
|-
 
|-
−
| [http://www.flipkart.com/operating-system-concepts-english-8th/p/itmey3rhg5xdhpys?pid=9788126520510&ref=55638360-4ceb-49d5-9919-c57784ca43a7&srno=t_2&otracker=from-search&otracker=latest-item&query=slibershatz ''Operating System Concepts'' ]
+
| [https://www.youtube.com/playlist?list=PLLDC70psjvq5hIT0kfr1sirNuees0NIbG ''Operating Systems'' ]
−
Silberschatz, Galvin
+
P.K.Biswas
−
| Very good for learning theory in OS. English is good to understand. Writing style is pretty easy and fun. Enough for GATE
+
| Enough for GATE
 
|-
 
|-
−
|[http://www.flipkart.com/modern-operating-systems-3-e-english-3rd/p/itmdx5gwcf4jhvfj?pid=9788120339040&otracker=from-search&srno=t_1&query=operating+system+tannenbaum&ref=af85287a-4ed1-49a0-96a5-19218fc32145 ''Modern Operating Systems'' ]
+
|[https://www.youtube.com/watch?v=sjs5PtCsVA4&index=1&list=PLEAFEC6160DADC7AA ''Computer Science 162 - Lecture 1'' ]
−
Tanenbaum
+
UCBerkeley
−
|The Book , but if you read Galvin it is ok , read Tanenbaum for more Knowledge. It contains great number of problems. Also includes some of theory that is not included in Galvin’s book.
+
|
 
|}
 
|}
 +
 +
 +
 +
 
==Theory of Computation==
 
==Theory of Computation==
−
<b>Theory of Computation:</b> <br>
+
<div>
 
<ul>
 
<ul>
 
<li>  Regular languages and finite automata </li>
 
<li>  Regular languages and finite automata </li>
Line 121: Line 131:
 
<li>Recursively enumerable sets and Turing machines</li>
 
<li>Recursively enumerable sets and Turing machines</li>
 
<li> Undecidability. </li>
 
<li> Undecidability. </li>
−
</ul>
+
</ul></div>
 
{|class="wikitable"
 
{|class="wikitable"
−
!Book
+
! style="color: #f7f7f7; background-color: #3b5998;"|
−
! style="width: 70%;"|
+
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 
Description
 
Description
 
|-
 
|-
−
|[http://www.flipkart.com/introduction-formal-languages-automata-4th/p/itmdfjfnkvmpnabu?pid=9788173197819&otracker=from-search&srno=t_1&query=an+introduction+to+formal+languages+and+automata+by+peter+linz&ref=cb3b00d6-a770-43df-bc38-a038421d57e3 ''An Introduction To Formal Languages And Automata'' ]
+
|[http://www.aduni.org/courses/theory/index.php?view=cw ''Theory of Computation'' ]
−
Peter Linz
+
Shai Simonson, Aduni.org
−
| Most recommended one for GATE
+
| If you have not seen these videos, don’t do anything go and see the videos immediately, no excuses.
−
|-
 
−
|[http://www.flipkart.com/introduction-theory-computation-2nd-english/p/itmdfcamz8zfkzzz?pid=9788131517505&otracker=from-search&srno=t_1&query=sipser&ref=bb122966-0efa-4f6c-b7b8-9c4b7607cfb3 ''Introduction to Theory of Computation'']  
 
−
Sipser
 
−
| Sipser is a quick and comprehensive guide. It is recommended to be read after you have grip on the subject.
 
−
|-
 
−
| [http://www.flipkart.com/introduction-computer-theory-english-2nd/p/itmeyfnuqk6ehnuf?pid=9788126513345&otracker=from-search&srno=t_1&query=cohen+theory&ref=b41541af-5746-464e-8d22-b9dc365801f9 ''Introduction To Computer Theory'']
 
−
Cohen
 
−
| Cohen can be read if very good detailed analysis is required. SPOON FEEDING !
 
−
|-
 
−
| [http://www.flipkart.com/introduction-automata-theory-languages-computation-english-3rd/p/itmdwuafje6xhdft?pid=9788131764619&ref=0eea7fe0-1ae2-4a95-a28b-e9ff58db68a5&srno=t_1&otracker=from-search&query=hopcroft ''Introduction to Automata Theory, Languages, and Computation'' ]
 
−
Hopcroft
 
−
| In most colleges you will find this book as a  Main book , but believe me  within Cohen or Linz, if you read any one of them , Enough!
 
 
|}
 
|}
 +
 +
 +
  
 
==CO & Architecture==
 
==CO & Architecture==
 
<div>
 
<div>
−
<b>Computer Organization and Architecture: </b> <br>
 
 
<ul>
 
<ul>
 
<li> Machine instructions and addressing modes</li>
 
<li> Machine instructions and addressing modes</li>
Line 156: Line 157:
 
</div>
 
</div>
 
{|class="wikitable"
 
{|class="wikitable"
−
!Book
+
! style="color: #f7f7f7; background-color: #3b5998;"|
−
! style="width: 70%;"|
+
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 
Description
 
Description
 
|-
 
|-
−
|[http://www.flipkart.com/computer-organization-5e-english-5th/p/itmdwxz8ahzhg7zy?pid=9781259005275&otracker=from-search&srno=t_1&query=computer+organisation+by+carl+hamacher&ref=6ebf9153-d4bb-4f55-a8b4-3a01c49727f6 ''Computer Organization'' ]
+
|[https://www.youtube.com/course?category=University%2FScience%2FComputer%2520Science%2FComputer%2520Architecture&list=EC1A5A6AE8AFC187B7&feature=edu ''Computer Architecture'' ]
−
Vranesic, Zaky, Hamacher
+
Prof. Anshul Kumar, IIT Delhi, NPTEL
 
|
 
|
 
|-
 
|-
−
|[http://www.flipkart.com/computer-organization-architecture-designing-performance-english-8th/p/itmey7qwaeuubgg4?pid=9788131732458&otracker=from-search&srno=t_1&query=stallings+william%2C+computer+organization+%26+architecture%2C+pearson+education%2C+8th+ed.%2C+2010&ref=aff593ce-3301-450d-b12c-58babd17b35b ''Computer Organization and Architecture : Designing for Performance'' ]
+
|[https://www.youtube.com/course?category=University%2FScience%2FComputer%2520Science%2FComputer%2520Architecture&list=EC1A5A6AE8AFC187B7&feature=edu ''Computer Organization'' ]
−
Stallings
+
Prof. S. Raman, IIT Madras, NPTEL
 
|
 
|
 
|-
 
|-
−
| [http://www.groupes.polymtl.ca/inf2610/documentation/ComputerSystemBook.pdf Computer Systems: A Programmers perspective]
+
| [https://www.coursera.org/course/comparch ''Computer Architecture'']
−
| This is a really good book in perspective of architecture as a simple view of how the actual hardware is organised is given. Apart from the classical confusing diagrams, this book has simple ones which is quite clear in its meaning. The explanation for pipeline execution and hazards are really good. This book is no longer in print, but you can get its pdf by clicking in the link provided. Highly recommended if you have time as this covers many of the other CS subjects as well.
+
David Wentzlaff, Princeton University, Coursera
 +
| Full Course
 
|}
 
|}
 +
 +
 +
  
 
==Computer Networks==
 
==Computer Networks==
−
<b>Computer Networks: </b> <br>
+
<div>
 
<ul>
 
<ul>
 
<li> ISO/OSI stack, LAN technologies (Ethernet, Token ring) </li>
 
<li> ISO/OSI stack, LAN technologies (Ethernet, Token ring) </li>
Line 180: Line 186:
 
<li>Basic concepts of hubs, switches, gateways, and routers</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>
 
<li> Network security – basic concepts of public key and private key cryptography, digital signature, firewalls </li>
−
</ul>
+
</ul></div>
 
{|class="wikitable"
 
{|class="wikitable"
−
!Book
+
! style="color: #f7f7f7; background-color: #3b5998;"|
−
! style="width: 70%;"|
+
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 
Description
 
Description
 
|-
 
|-
−
|[http://www.flipkart.com/computer-networks/p/itmdxcfuqyqjryxa?pid=DGBDNY382GZTKGNQ&otracker=from-search&srno=t_1&query=davie+networks&ref=47dcd318-fc8e-4b8a-922a-000ea8ee9b96 Computer Networks,  Peterson, Davie]
+
|[http://nptel.ac.in/video.php?subjectId=106105081 ''Computer Networks'']
−
| Most recommended for GATE
+
NPTEL
−
|-
+
|
−
|[http://www.flipkart.com/data-comm-netw-5e-global-ed-english-5th/p/itmdhbyx8cpfhzge?pid=9781259064753&ref=7829042b-d739-4891-a50e-2bbb26b6b223&srno=t_1&otracker=from-search&query=Forouzan+computer+networks Data Communication & Networks, Forouzan]
 
−
| Good book with Basics clear
 
−
|-
 
−
|[http://www.flipkart.com/computer-networks-5th/p/itmdkzrvw2xcanwg?pid=9788131787571&otracker=from-search&srno=t_1&query=computer+networks+tanenbaum&ref=10a83716-8095-4159-bc5b-c32f0f91ca42 Computer Netwroks, Tanenbaum, Wetherall]
 
−
|Kurose is best for Almost all fundamental concept with clear figure and very understandable manners
 
 
|-
 
|-
−
|[http://www.flipkart.com/computer-networking-top-down-approach-english-5th/p/itmdatheqysd3cfn?pid=9788131790540&otracker=from-search&srno=t_1&query=computer+networks+by+kurose&ref=d9a4f1e3-0730-4157-9c45-e7fc3d80defb Computer Networking: A Top-Down Approach, Kurose]
+
|[http://www.cse.wustl.edu/~jain/cse473-10/index.html ''Introduction to Computer Networks'']
−
| One can not neglect the amazing book by tanenbaum. It contains everything in a very well written way. It is amusing and `it deals with issues in a manner you want to do. If you are starting the subject, go with it. It is not recommended for last time reading. Keep making good notes if you read his book.
+
Jain, WUSTL
 +
|  
 
|}
 
|}
 +
 +
 +
  
 
==Programming==
 
==Programming==
−
<b>Programming:</b> <br>
+
<div>
 
<ul>
 
<ul>
 
<li> Programming in C </li>
 
<li> Programming in C </li>
 
<li> Functions, Recursion </li>
 
<li> Functions, Recursion </li>
 
<li> Parameter passing, Scope, Binding </li>
 
<li> Parameter passing, Scope, Binding </li>
−
</ul>
+
</ul> </div>
 
{|class="wikitable"
 
{|class="wikitable"
−
!Book
+
! style="color: #f7f7f7; background-color: #3b5998;"|
−
! style="width: 70%;"|
+
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 
Description
 
Description
 
|-
 
|-
−
|[http://www.flipkart.com/search?q=ritchie&as=off&as-show=off&otracker=start The C Programming Language, Kernighan, Ritchie]
+
|[https://www.youtube.com/watch?v=_eR4rxnM7Lc&list=PL9D558D49CA734A02&index=4 ''Programming Paradigms'']
−
|No comments- This is the best. To really understand the working of C, you must read this book. If you find this book tough, that means you have to correct your concepts by talking to knowledgeable people. Many local books, skips difficult to digest concepts and make easy to read books- but to get everything you have to follow this book.
+
Jerry Cain, Stanford
 +
| Doesn't cover the entire GATE syllabus in programming but useful
 
|-
 
|-
−
|[http://www.flipkart.com/data-structures-using-c-english-1st/p/itmeygjhmkg77xzy?pid=9788131702291&otracker=from-search&srno=t_2&query=tannenbaum+algorithms&ref=a2db40fb-5a65-4c3c-a319-a048634938b5 Data Structures Using C, Aaron M. Tenenbaum]
+
|[https://www.youtube.com/course?category=University%2FEngineering%2FComputer%2520Science%2FData%2520Structures&list=EC4BBB74C7D2A1049C&feature=edu ''Computer Science 61B - Fall 2006'']
−
| For most of the data structure concepts
+
UCBerkeley
 +
|For Data structures
 +
|}
 +
 
 +
 
 +
 
  
−
|}
 
 
==Digital Logic==
 
==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"
 
{|class="wikitable"
−
!Book
+
! style="color: #f7f7f7; background-color: #3b5998;"|
−
! style="width: 70%;"|
+
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 
Description
 
Description
 
|-
 
|-
−
| [http://www.flipkart.com/digital-logic-computer-design-english-1st/p/itmdyughsrncfvsg?pid=9788177584097&otracker=from-search&srno=t_1&query=+by+morris+mano&ref=2dc66827-d61c-489b-9270-467f6954e5b4 Digital Logic & Computer Design, Morris Mano]
+
| [https://www.youtube.com/watch?v=CeD2L6KbtVM ''Introduction to Digital Circuits'']
−
| No Comment… One and only…
+
Prof. S. Srinivasan, IIT Madras, NPTEL
 +
|
 +
|}
 +
 
 +
 
 +
 
  
−
|}
 
 
==Information Systems and Software Engineering==
 
==Information Systems and Software Engineering==
−
<b>Information Systems and Software Engineering </b>  
+
<div>
 
<ul>
 
<ul>
 
<li>Information gathering, requirement and feasibility analysis data flow diagrams </li>
 
<li>Information gathering, requirement and feasibility analysis data flow diagrams </li>
Line 235: Line 259:
 
<li>Planning and managing the project, design, coding </li>
 
<li>Planning and managing the project, design, coding </li>
 
<li>Testing, implementation, maintenance. </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>
 
</ul>
 +
</div>
 
{|class="wikitable"
 
{|class="wikitable"
−
!Book
+
! style="color: #f7f7f7; background-color: #3b5998;"|
−
! style="width: 70%;"|
+
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 
Description
 
Description
 
|-
 
|-
−
|[http://www.flipkart.com/software-engineering-english-6th/p/itmdx925vgduvhzs?pid=9780070701137&otracker=from-search&srno=t_1&query=software+engineering+by+pressman&ref=7a20efc8-6a93-494b-9de1-93e250b26fab Software Engineering, Pressman]
+
|[http://gatecse.in/w/images/0/02/Web-Technologies-Fundamentals-and-HTTP.pptx ''Web Technologies Basics'']
−
| Just see the GATE topics from this bible.  
+
Telerik Academy
 +
| This presentation is enough for GATE.  
 
|}
 
|}
−
==Web technologies==
+
 
 +
 
 +
 
 
== Engineering Mathematics==
 
== Engineering Mathematics==
−
===Mathematical Logic===  
+
 
−
===Probability===
+
 
 +
===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"
−
!Book
+
! style="color: #f7f7f7; background-color: #3b5998;"|
−
! style="width: 70%;"|
+
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 
Description
 
Description
 
|-
 
|-
−
|[http://www.flipkart.com/first-course-probability-english-9th/p/itmeyhmrscqsytep?pid=9789332519077&otracker=from-search&srno=t_1&query=ross+probability&ref=a6c054ef-d7e6-4e19-a26b-8f1a45e83955 A First Course in Probability, Ross]
+
|[https://www.youtube.com/playlist?list=PL5BC8D7CFBA5732EA ''Sets, Counting, and Probability'']
−
|Sheldon ross’s book (1st course in Probability) is undoubtedly very good.But you have to read this book very deeply page by page.
+
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.  
 
|}
 
|}
−
===Set Theory & Algebra===  
+
 
 +
 
 +
===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"
 
{|class="wikitable"
−
!Book
+
! style="color: #f7f7f7; background-color: #3b5998;"|
−
! style="width: 70%;"|
+
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 
Description
 
Description
 
|-
 
|-
−
|[http://www.flipkart.com/discrete-mathematics-its-applications-combinatorics-graph-theory-english-7th/p/itmdwxxszhczjrnf?pid=9780070681880&otracker=from-search&srno=t_1&query=discrete+mathematics+and+its+applications+by+kenneth+h.rosen&ref=d9721371-0168-4553-a128-c337b7c0cbe7 Discrete Mathematics and Its Applications with Combinatorics and Graph Theory, Rosen]
+
|[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
 
|}
 
|}
−
===Combinatory===
+
 
 
===Graph Theory===
 
===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"
 
{|class="wikitable"
−
!Book
+
! style="color: #f7f7f7; background-color: #3b5998;"|
−
! style="width: 70%;"|
+
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 
Description
 
Description
 
|-
 
|-
−
|[http://www.flipkart.com/graph-theory-applications-engineering-computer-science-english-new/p/itmdytcjrqqcyxgm?pid=9788120301450&ref=a48bd004-a410-4e6a-9581-570a3f31b5c4&srno=t_1&otracker=from-search&query=graph+theory+narsingh+deo Graph Theory With Applications To Engineering And Computer Science, Deo]  
+
|[http://www.nptel.ac.in/courses/106108054/1''Graph Theory'']
−
|
+
NPTEL
 +
|Advanced course, just take what you need from GATE syllabus
 
|}
 
|}
 +
 +
 
===Linear Algebra===
 
===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"
 
{|class="wikitable"
−
!Book
+
! style="color: #f7f7f7; background-color: #3b5998;"|
−
! style="width: 70%;"|
+
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 
Description
 
Description
 
|-
 
|-
−
|[http://www.flipkart.com/linear-algebra-its-applications-english-4th/p/itmey7qhzmragaty?pid=9788131501726&otracker=from-search&srno=t_1&query=gilbert+strang&ref=35d0c899-dc36-4bb1-ae4d-92cf055fbf5e Linear Algebra and its Applications, Gilbert Strang]
+
|[http://ocw.mit.edu/courses/mathematics/18-06-linear-algebra-spring-2010/video-lectures/ ''Linear Algebra'']
−
|
+
Gilbert Strang, OCW.MIT
 +
| Straight from the master
 
|-
 
|-
−
|[http://www.flipkart.com/higher-engineering-mathematics-english-43rd/p/itmczyhpmhhtqnsa?pid=9788174091956&ref=04f4284d-0b23-4ee9-8ec8-575200059f10&srno=t_1&otracker=from-search&query=bs+grewal+engineering+mathematics Higher Engineering Mathematics , Grewal]
 
−
|
 
 
|}
 
|}
−
===Numerical Methods===
+
 
−
===Calculus===
+
 
−
==General Aptitude==
+
===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"
 
{|class="wikitable"
−
!Book
+
! style="color: #f7f7f7; background-color: #3b5998;"|
−
! style="width: 70%;"|
+
Course Videos
 +
! style="width: 70%;color:#f7f7f7; background-color: #3b5998;"|
 
Description
 
Description
 
|-
 
|-
−
|[http://www.flipkart.com/quantitative-aptitude-competitive-examinations-english-17th/p/itmdytga2sgpggmg?pid=9788121924986&ref=fa36fcb4-078c-4280-b9c8-d849701e4a98&srno=t_1&otracker=from-search&query=agrewal+aptitude Quantitative Aptitude For Competitive Examinations, Aggarwal]
+
|[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 & Data Structures[edit]

GATE Topics:

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

GATE Topics:
  • 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
Book

Description

Database Systems

Elmasri, Navathe

Covers entire GATE syllabus and especially good for file structures and normalization
Database Systems

Connolly, Begg

Covers entire GATE syllabus and is easy to understand.
Database Management Systems

Raghu Ramakrishnan

Another very good book especially for Transaction management and Normalization.
Database System

Widom, Ullman, Garcia-Molina

Another very good book.
Database System Concepts

Silberschatz

Very good book but English is bit high standard

Compiler Design[edit]

Compiler Design:

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

Description

Compilers : Principles, Techniques, & Tools

Aho, Sethi, Ulman, Lam

One and only book. If you find the explanations tough, start looking at the given examples, they are easy to follow

Operating Systems[edit]

Operating System:

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

Description

Operating System Concepts

Silberschatz, Galvin

Very good for learning theory in OS. English is good to understand. Writing style is pretty easy and fun. Enough for GATE
Modern Operating Systems

Tanenbaum

The Book , but if you read Galvin it is ok , read Tanenbaum for more Knowledge. It contains great number of problems. Also includes some of theory that is not included in Galvin’s book.

Theory of Computation[edit]

Theory of Computation:

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

Description

An Introduction To Formal Languages And Automata

Peter Linz

Most recommended one for GATE
Introduction to Theory of Computation

Sipser

Sipser is a quick and comprehensive guide. It is recommended to be read after you have grip on the subject.
Introduction To Computer Theory

Cohen

Cohen can be read if very good detailed analysis is required. SPOON FEEDING !
Introduction to Automata Theory, Languages, and Computation

Hopcroft

In most colleges you will find this book as a Main book , but believe me within Cohen or Linz, if you read any one of them , Enough!

CO & Architecture[edit]

Computer Organization and 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.
Book

Description

Computer Organization

Vranesic, Zaky, Hamacher

Computer Organization and Architecture : Designing for Performance

Stallings

Computer Systems: A Programmers perspective This is a really good book in perspective of architecture as a simple view of how the actual hardware is organised is given. Apart from the classical confusing diagrams, this book has simple ones which is quite clear in its meaning. The explanation for pipeline execution and hazards are really good. This book is no longer in print, but you can get its pdf by clicking in the link provided. Highly recommended if you have time as this covers many of the other CS subjects as well.

Computer Networks[edit]

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
Book

Description

Computer Networks, Peterson, Davie Most recommended for GATE
Data Communication & Networks, Forouzan Good book with Basics clear
Computer Netwroks, Tanenbaum, Wetherall Kurose is best for Almost all fundamental concept with clear figure and very understandable manners
Computer Networking: A Top-Down Approach, Kurose One can not neglect the amazing book by tanenbaum. It contains everything in a very well written way. It is amusing and `it deals with issues in a manner you want to do. If you are starting the subject, go with it. It is not recommended for last time reading. Keep making good notes if you read his book.

Programming[edit]

Programming:

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

Description

The C Programming Language, Kernighan, Ritchie No comments- This is the best. To really understand the working of C, you must read this book. If you find this book tough, that means you have to correct your concepts by talking to knowledgeable people. Many local books, skips difficult to digest concepts and make easy to read books- but to get everything you have to follow this book.
Data Structures Using C, Aaron M. Tenenbaum For most of the data structure concepts

Digital Logic[edit]

Book

Description

Digital Logic & Computer Design, Morris Mano No Comment… One and only…

Information Systems and Software Engineering[edit]

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

Description

Software Engineering, Pressman Just see the GATE topics from this bible.

Web technologies[edit]

Engineering Mathematics[edit]

Mathematical Logic[edit]

Probability[edit]

Book

Description

A First Course in Probability, Ross Sheldon ross’s book (1st course in Probability) is undoubtedly very good.But you have to read this book very deeply page by page.

Set Theory & Algebra[edit]

Book

Description

Discrete Mathematics and Its Applications with Combinatorics and Graph Theory, Rosen

Combinatory[edit]

Graph Theory[edit]

Book

Description

Graph Theory With Applications To Engineering And Computer Science, Deo

Linear Algebra[edit]

Book

Description

Linear Algebra and its Applications, Gilbert Strang
Higher Engineering Mathematics , Grewal

Numerical Methods[edit]

Calculus[edit]

General Aptitude[edit]

Book

Description

Quantitative Aptitude For Competitive Examinations, Aggarwal