{"product_id":"design-analysis-of-algorithms","title":"Design \u0026 Analysis of Algorithms","description":"\u003cp data-start=\"0\" data-end=\"224\"\u003eBook Details:\u003cbr\u003e• Author: Biswajit Bhowmik\u003cbr data-start=\"40\" data-end=\"43\"\u003e• Publisher: S.K. Kataria \u0026amp; Sons\u003cbr data-start=\"75\" data-end=\"78\"\u003e• Edition: 2012\u003cbr data-start=\"93\" data-end=\"96\"\u003e• Language: English\u003cbr data-start=\"115\" data-end=\"118\"\u003e• Number of Pages: 475\u003cbr data-start=\"140\" data-end=\"143\"\u003e• Binding: Paperback\u003cbr data-start=\"163\" data-end=\"166\"\u003e• Release Date: 01 December 2012\u003cbr data-start=\"198\" data-end=\"201\"\u003e• ISBN: 9789350141359\u003c\/p\u003e\n\u003cp data-start=\"226\" data-end=\"565\"\u003eAbout the Book:\u003cbr\u003eThis book is a comprehensive guide to algorithms and data structure problem-solving techniques, specially designed for computer science and information technology students. Written by Biswajit Bhowmik, the book explains algorithm design strategies and computational problem-solving methods in a clear and systematic manner.\u003c\/p\u003e\n\u003cp data-start=\"567\" data-end=\"1167\"\u003eThe book covers important topics including asymptotic notations, recursion and recurrence relations, divide and conquer paradigm, dynamic programming, greedy algorithms, backtracking, branch and bound, graph traversal algorithms, matrix manipulation algorithms, NP-completeness, approximation algorithms, file compression, topological sorting, strongly connected components, Dijkstra’s algorithm, and large integer multiplication. It also includes GATE questions, solved model papers, previous years’ examination papers, bibliography, and index for academic preparation and competitive exam practice.\u003c\/p\u003e\n\u003cp data-start=\"1169\" data-end=\"1433\"\u003eWith well-organized chapters and easy-to-understand explanations, this book serves as an excellent academic and reference resource for university studies, programming practice, competitive examinations, and professional learning in algorithms and computer science.\u003c\/p\u003e","brand":"S.K. Kataria \u0026 Sons","offers":[{"title":"Default Title","offer_id":66754638676272,"sku":"DRG.SKKataria_ 9789350141359","price":482.0,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0690\/9968\/4144\/files\/41mGECgGSPL.jpg?v=1778490452","url":"https:\/\/www.retailmaharaj.com\/products\/design-analysis-of-algorithms","provider":"Retail Maharaj","version":"1.0","type":"link"}