"VV Square"building, Plot.No.TS 710/1b1 & 2B1, CMC Ward No 18, Moka road, Gandhinagar, Ballari-583 101. 583101 Bellari IN
Kendriya Vidyalaya Ballari
"VV Square"building, Plot.No.TS 710/1b1 & 2B1, CMC Ward No 18, Moka road, Gandhinagar, Ballari-583 101. Bellari, IN
+918050151380 https://www.trendypaper.com/s/5b1a00c581a9afd8ff765190/ms.settings/5256837ccc4abf1d39000001/5b928defbda50e15d4c76434-480x480.png" [email protected]
9789352743117- 5fc6509dffa8de031c3d677a Design and Analysis of Algorithms? https://www.trendypaper.com/s/5b1a00c581a9afd8ff765190/5fc6509fffa8de031c3d67e0/obasog4.jpg This book is intended for the students of B.Tech & BE (CSE/IT), M.Tech & ME (CSE/IT), MCA, M.Sc (CS/IT). This book includes: Fundamental Concepts on Algorithms. Framework for Algorithm Analysis. Asymptotic Notations. Sorting Algorithms. Recurrences. Divide and Conquer Approach. Dynamic Programming Approach. Greedy Algorithm, Graph Algorithms, Back Tracking, String Matching, NP-Completeness, NP-Complete Problems (with proofs), Approximation Algorithms.Salient Features:Complete and Focused Coverage of Syllabus in Very Simple Language. Expanded Coverage on Sorting Algorithms in Chapter-4. Expanded Coverage on NP-Completeness and Approximation Algorithms in Chapter-17. More than 250 Solved Examples. A Quick Reference Table for Time Complexity of Algorithms in Appendix-II. Last 3 Years Solved University Question Papers in Appendix-III. Chapter-wise Short Type Questions with Answers in Appendix-IV. Solved GATE Question Papers in Appendix-V. 9789352743117-
out of stock INR 575
Laxmi Publications Pvt. Ltd
1 1
Design and Analysis of Algorithms?

Design and Analysis of Algorithms?

Be the first to review this product

Author: S.R.Jena, S.Patro

Brand: Laxmi Publications Pvt. Ltd

ISBN: 9789352743117-
₹575
Sold Out
Sold By: trendypaper

Description of product

This book is intended for the students of B.Tech & BE (CSE/IT), M.Tech & ME (CSE/IT), MCA, M.Sc (CS/IT). This book includes: Fundamental Concepts on Algorithms. Framework for Algorithm Analysis. Asymptotic Notations. Sorting Algorithms. Recurrences. Divide and Conquer Approach. Dynamic Programming Approach. Greedy Algorithm, Graph Algorithms, Back Tracking, String Matching, NP-Completeness, NP-Complete Problems (with proofs), Approximation Algorithms.Salient Features:Complete and Focused Coverage of Syllabus in Very Simple Language. Expanded Coverage on Sorting Algorithms in Chapter-4. Expanded Coverage on NP-Completeness and Approximation Algorithms in Chapter-17. More than 250 Solved Examples. A Quick Reference Table for Time Complexity of Algorithms in Appendix-II. Last 3 Years Solved University Question Papers in Appendix-III. Chapter-wise Short Type Questions with Answers in Appendix-IV. Solved GATE Question Papers in Appendix-V.

Renting Guidelines

Specification of Products

BrandLaxmi Publications Pvt. Ltd

Related products

User reviews

  0/5