Price Range
Rs. 10.00 - Rs. 1,000.00
Data Analysis
{"id":562478350380,"title":"Analysis and Design of Algorithms","handle":"analysis-and-design-of-algorithms-a-beginners-hope","description":"\u003cp\u003eThe book has been written in such a way that the concepts and working of algorithms are explained in detail, with adequate examples. To make clarity on the topic, diagrams, calculation of complexity, algorithms are given extensively throughout. Many examples are provided which are helpful in understanding the algorithms by various strategies. This content is user-focused and has been highly updated including algorithms and their real-world examples.\u003c\/p\u003e\n\u003cp\u003e\u003cstrong\u003eKey features\u003c\/strong\u003e \u003c\/p\u003e\n\u003cul\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eThis book is especially designed for beginners, and explains all aspects of algorithm and its analysis in a simple and systematic manner.\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eAlgorithms and their working are explained in detail with the help of several illustrative examples.\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eImportant features like greedy algorithm, dynamic algorithm, string matching algorithm, branch and bound algorithm, NP hard and NP complete problems are suitably highlighted.\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eSolved and frequently asked questions in the various competitive examinations, sample papers of the past examinations are provided which will serve as a useful reference source.\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eThe book would serve as an extremely useful text for BCA, MCA, M. Sc. (Computer Science), PGDCA, BE (Information Technology) and B. Tech. and M. Tech. students.\u003c\/li\u003e\n\u003c\/ul\u003e\n\u003cp\u003e\u003cstrong\u003e \u003c\/strong\u003e\u003cstrong\u003eContents\u003c\/strong\u003e \u003c\/p\u003e\n\u003cul\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eAlgorithm \u0026amp; Algorithmic Strategy\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eComplexity of Algorithms\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eDivide-and-Conquer Algorithms\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eGreedy Algorithm\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eDynamic Programming\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eGraph Theory\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eBacktracking Algorithms\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eBranch and Bound Algorithms\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eString-Matching Algorithms\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eP and NP Problems\u003c\/li\u003e\n\u003c\/ul\u003e","published_at":"2018-02-17T11:33:13+05:30","created_at":"2018-02-17T11:38:10+05:30","vendor":"Shefali Singhal, Neha Garg","type":"Book","tags":["Algorithms","analysis","BPB","design"],"price":32400,"price_min":32400,"price_max":32400,"available":true,"price_varies":false,"compare_at_price":36000,"compare_at_price_min":36000,"compare_at_price_max":36000,"compare_at_price_varies":false,"variants":[{"id":7092424605740,"title":"Default Title","option1":"Default Title","option2":null,"option3":null,"sku":"ADA10","requires_shipping":true,"taxable":false,"featured_image":null,"available":true,"name":"Analysis and Design of Algorithms","public_title":null,"options":["Default Title"],"price":32400,"weight":200,"compare_at_price":36000,"inventory_quantity":58,"inventory_management":"shopify","inventory_policy":"deny","barcode":"9789386551894"}],"images":["\/\/cdn.shopify.com\/s\/files\/1\/2228\/7547\/products\/image002.jpg?v=1556955635"],"featured_image":"\/\/cdn.shopify.com\/s\/files\/1\/2228\/7547\/products\/image002.jpg?v=1556955635","options":["Title"],"media":[{"alt":null,"id":970120134700,"position":1,"preview_image":{"aspect_ratio":0.649,"height":770,"width":500,"src":"https:\/\/cdn.shopify.com\/s\/files\/1\/2228\/7547\/products\/image002.jpg?v=1569151708"},"aspect_ratio":0.649,"height":770,"media_type":"image","src":"https:\/\/cdn.shopify.com\/s\/files\/1\/2228\/7547\/products\/image002.jpg?v=1569151708","width":500}],"content":"\u003cp\u003eThe book has been written in such a way that the concepts and working of algorithms are explained in detail, with adequate examples. To make clarity on the topic, diagrams, calculation of complexity, algorithms are given extensively throughout. Many examples are provided which are helpful in understanding the algorithms by various strategies. This content is user-focused and has been highly updated including algorithms and their real-world examples.\u003c\/p\u003e\n\u003cp\u003e\u003cstrong\u003eKey features\u003c\/strong\u003e \u003c\/p\u003e\n\u003cul\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eThis book is especially designed for beginners, and explains all aspects of algorithm and its analysis in a simple and systematic manner.\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eAlgorithms and their working are explained in detail with the help of several illustrative examples.\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eImportant features like greedy algorithm, dynamic algorithm, string matching algorithm, branch and bound algorithm, NP hard and NP complete problems are suitably highlighted.\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eSolved and frequently asked questions in the various competitive examinations, sample papers of the past examinations are provided which will serve as a useful reference source.\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eThe book would serve as an extremely useful text for BCA, MCA, M. Sc. (Computer Science), PGDCA, BE (Information Technology) and B. Tech. and M. Tech. students.\u003c\/li\u003e\n\u003c\/ul\u003e\n\u003cp\u003e\u003cstrong\u003e \u003c\/strong\u003e\u003cstrong\u003eContents\u003c\/strong\u003e \u003c\/p\u003e\n\u003cul\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eAlgorithm \u0026amp; Algorithmic Strategy\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eComplexity of Algorithms\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eDivide-and-Conquer Algorithms\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eGreedy Algorithm\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eDynamic Programming\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eGraph Theory\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eBacktracking Algorithms\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eBranch and Bound Algorithms\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eString-Matching Algorithms\u003c\/li\u003e\n\u003cli\u003e\n\u003cspan\u003e \u003c\/span\u003eP and NP Problems\u003c\/li\u003e\n\u003c\/ul\u003e"}
You may also like:
Analysis and Design of Algorithms
Rs. 360
Rs. 324
The book has been written in such a way that the concepts and working of algorithms are explained in detail,...
