{"product_id":"9788192107509","title":"Data Structures and Algorithms for Gate: Solutions to All Previous Gate Questions Since 1991","description":"\u003cbr\u003e\u003cb\u003ePeeling Data Structures and Algorithms for (C\/C++\u003c\/b\u003e\u003cb\u003e):\u003c\/b\u003e\u003cbr\u003e\u003cul\u003e\n\u003cli\u003eGATE Preparation Solutions to all previous GATE questions since 1991 \u003c\/li\u003e\n\u003cli\u003eCampus Preparation \u003c\/li\u003e\n\u003cli\u003eDegree\/Masters Course Preparation \u003c\/li\u003e\n\u003cli\u003eInstructor's \u003c\/li\u003e\n\u003cli\u003eReference Manual for Working People \u003c\/li\u003e\n\u003c\/ul\u003e\u003cb\u003eWhat is unique?\u003c\/b\u003e\u003cp\u003eThis book is aimed for GATE students. We have tried to solve all problems related to and from the last twenty years papers. Each solution has explanation associated with it and this gives the confidence for readers about the correctness of the solutions. As a if you read complete book with good understanding, I am sure you will challenge the interviewers and that is the objective of this book.\u003c\/p\u003e\u003cp\u003e\u003cb\u003eTopics Covered:\u003c\/b\u003e\u003cbr\u003e\u003c\/p\u003e\u003cul\u003e\n\u003cli\u003eIntroduction\u003c\/li\u003e\n\u003cli\u003eRecursion and Backtracking\u003c\/li\u003e\n\u003cli\u003eLinked Lists\u003c\/li\u003e\n\u003cli\u003eStacks\u003c\/li\u003e\n\u003cli\u003eQueues\u003c\/li\u003e\n\u003cli\u003eTrees\u003c\/li\u003e\n\u003cli\u003ePriority Queue and Heaps\u003c\/li\u003e\n\u003cli\u003eDisjoint Sets ADT\u003c\/li\u003e\n\u003cli\u003eGraph Algorithms\u003c\/li\u003e\n\u003cli\u003eSorting \u003c\/li\u003e\n\u003cli\u003eSearching \u003c\/li\u003e\n\u003cli\u003eSelection Algorithms [Medians] \u003c\/li\u003e\n\u003cli\u003eSymbol Tables \u003c\/li\u003e\n\u003cli\u003eHashing \u003c\/li\u003e\n\u003cli\u003eString Algorithms \u003c\/li\u003e\n\u003cli\u003eAlgorithms Design Techniques \u003c\/li\u003e\n\u003cli\u003eGreedy Algorithms \u003c\/li\u003e\n\u003cli\u003eDivide and Conquer Algorithms \u003c\/li\u003e\n\u003cli\u003eDynamic Programming \u003c\/li\u003e\n\u003cli\u003eComplexity Classes \u003c\/li\u003e\n\u003cli\u003eMiscellaneous Concepts \u003c\/li\u003e\n\u003c\/ul\u003e\u003cb\u003eTarget Audience?\u003c\/b\u003e\u003cp\u003eAll GATE aspirants.\u003c\/p\u003e\u003cp\u003e\u003cb\u003eLanguage?\u003c\/b\u003e\u003c\/p\u003e\u003cp\u003eAll code was written in C\/C++. \u003cbr\u003e\u003cb\u003e \u003c\/b\u003e\u003c\/p\u003e","brand":"CareerMonk Publications","offers":[{"title":"Default Title","offer_id":47052660211952,"sku":"9788192107509","price":34.99,"currency_code":"USD","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0737\/7593\/9824\/files\/9788192107509_p0.jpg?v=1763725995","url":"https:\/\/shop-qa.barnesandnoble.com\/products\/9788192107509","provider":"Barnes \u0026 Noble (DEV)","version":"1.0","type":"link"}