
Download App
>> | LShop | >> | Book | >> | Reference, Informati... | >> | Encyclopaedias & Ref... | >> | Fundamentals Of Comp... |
ISBN
:
9788173716126
Publisher
:
Universities Press
Subject
:
Encyclopaedias & Reference Works
Binding
:
Paperback
Pages
:
808
Year
:
2008
₹
795.0
₹
795.0
Buy Now
Shipping charges are applicable for books below Rs. 101.0
View DetailsEstimated Shipping Time : 5-7 Business Days
View DetailsDescription
This is the 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 thisclassic 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. About The Author Ellis Horowitz is Professor of Computer Science and Electrical Engineering at the University of Southern California. Dr Horowitz is the author of ten books and numerous journal articles and refereed conference proceedings. Sartaj Sahni is a Distinguished Professor and Chair of Computer and Information Sciences and Engineering at the University of Florida. Dr Sahni has published over 300 research papers and written 15 textbooks. Sanguthevar Rajasekaran is the UTC Chair Professor of Computer Science and Engineering at the University of Connecticut. He has published over 150 articles in journals and conferences, co-authored two textbooks and co-edited four books. Table Of Contents Preface Introduction Elementary Data Structures Divide-and-Conquer The Greedy Method Dynamic Programming Basic Traversal and Search Techniques Backtracking Branch and Bound Algebraic Problems Lower Bound Theory NP-Hard and NP-Complete Problems Approximation Algorithms Pram Algorithms Mesh Algorithms Hypercube Algorithms Index
Related Items
-
of
Data Structures, Algorithms and Applications in C++
Sartaj Sahni
Starts At
539.0
650.0
17% OFF
Establishing Academic Structures in Computer Science at Herat University
Alexandra Balschun
Starts At
1169.0
1601.79
27% OFF
Fundamentals Of Modern Manufacturing: Materials Processes, And Systems, 2Nd Ed
Mikell P. Groover
Starts At
669.0
769.0
13% OFF
Multi-Objective Optimization Using Evolutionary Algorithms
Kalyanmoy Deb
Starts At
675.0
768.0
12% OFF
Fundamentals Of Queueing Theory, 3Rd Ed
Carl M. Harris Donald Gross
Starts At
600.0
682.0
12% OFF
Are you sure you want to remove the item from your Bag?
Yes
No
Added to Your Wish List
OK
Your Shopping Bag
- 2 Items
Item
Delivery
Unit Price
Quantity
Sub Total
Order Summary