View source for Test ← Test

<html>
<script type="text/javascript">
google_ad_client = "ca-pub-1529295637495038";
/* gatecse */
google_ad_slot = "7029101319";
google_ad_width = 728;
google_ad_height = 90;
</script>
<script async src="//pagead2.googlesyndication.com/pagead/js/adsbygoogle.js"></script>
<!-- gatecse -->
<ins class="adsbygoogle"
     style="display:inline-block;width:728px;height:90px"
     data-ad-client="ca-pub-1529295637495038"
     data-ad-slot="7029101319"></ins>
<script>
(adsbygoogle = window.adsbygoogle || []).push({});
</script>
</html>
==Algorithms==
{| class="wikitable"
! Book
! 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.]
| 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)
|-
| [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]
| 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, Aho, Hopcroft, Ullman]
| Another classic book for algorithms. 
|}

==Databases==
{| class="wikitable"
! Book
! Desciption
|-
| s
| g
|-
| 
| 
|-
| 
| 
|}
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.