Data Structures and Algorithms For GATE: Solutions to all previous GATE questions since 1991 Paperback – December 30, 2011
The Amazon Book Review
Book recommendations, author interviews, editors' picks, and more. Read it now.
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
From the Author
Objective of this book is to present the ideas for solving data-structure and algorithmic problems. I request to go through the first chapter as it describes when do we (situations) get different complexities like O(logn), O(n^2), O(loglogn), O(nlogn), O(2^n) etc.. Once you understand them, remaining chapters looks easy as we refer these complexities at every place.
Also, give one complete reading of the book before trying compiling (at places we skipped boundary conditions).
About the Author
- Item Weight : 2.01 pounds
- Paperback : 392 pages
- ISBN-13 : 978-1468152975
- ISBN-10 : 1468152971
- Publisher : CreateSpace Independent Publishing Platform (December 30, 2011)
- Dimensions : 8.5 x 0.89 x 11 inches
- Language: : English
- Best Sellers Rank: #7,972,735 in Books (See Top 100 in Books)
- Customer Reviews: