The Design and Analysis of Computer Algorithms
Product Details: Share this by email:
With this text, you gain an understanding of the fundamental concepts of algorithms, the very heart of computer science. It introduces the basic data structures and programming techniques often used in efficient algorithms. Covers use of lists, push-down stacks, queues, trees, and graphs. Later chapters go into sorting, searching and graphing algorithms, the string-matching algorithms, and the Schonhage-Strassen integer-multiplication algorithm. Provides numerous graded exercises at the end of each chapter.
Table Of Contents
Models of Computation
Design of Efficient Algorithms
Sorting and Order Statistics.
Data Structures for Set Manipulation Problems.
Algorithms on Graphs.
Matrix Multiplication and Related Operations.
The Fast Fourier Transform and its Applications.
Integer and Polynomial Arithmetic.
Some Provably Intractable Problems.
Lower Bound on Numbers of Arithmetic Operations
Other books by Jeffrey D. Ullman
Free Shipping on all orders of Rs.500 and above. Add Rs.30 otherwise. | Delivered in 7 working days
(Cash on delivery available)
Be assured. 7 days Return & Refund Policy.