Fundamentals of computer algorithms Horowitz, Ellis
Series: Computer software engineering seriesPublication details: Hyderabad University Press 2008 Edition: 2nd edDescription: xx, 773 pISBN:- 9788173716126
- 519.92
Item type | Current library | Call number | Status | Date due | Barcode | Item holds | |
---|---|---|---|---|---|---|---|
Book | Ahmedabad | 519.92 H6F8/2008 (Browse shelf(Opens below)) | Available | 166556 |
Browsing Ahmedabad shelves Close shelf browser (Hides shelf browser)
This is the thoroughly revised and updated edition of the programming language-independent text that helped establish computer algorithms as a discipline of computer science. The text incorporates the latest research and state-of-the-art applications, bringing this classic to the forefront of modern computer science education. A major strength of this text is its focus on design techniques rather than on individual algorithms. This book is appropriate as a core text for upper-and graduate-level courses in algorithms. The second edition of Fundamentals of Computer Algorithms emphasizes: Design techniques: Divide and conquer, the greedy method, dynamic programming, backtracking and branch and bound are illustrated with several examples. Each algorithm is completely analyzed. Examples: A wide range of examples provides students with the actual implementation of correct design. The latest research: A thorough treatment of probabilistic and parallel algorithms is included. Full integration of randomized algorithms: Performance with nonrandomized algorithms is thoroughly compared.
There are no comments on this title.