The design and analysis of computer algorithms

By: Aho, Alfred VContributor(s): Hopcroft, John E | Ullman, Jeffrey DMaterial type: TextTextSeries: Addison-Wesley series in computer science and information processingPublication details: Delhi : Addison-Wesley Pub. Co., [1974]Description: x, 470 p. : illustrationsISBN: 9788178081038; 0201000296Subject(s): Computer programming | Computer algorithmsDDC classification: 005.1
Contents:
1. Models of Computation -- 2. Design of Efficient Algorithms -- 3. Sorting and Order Statistics -- 4. Data Structures for Set Manipulation Problems -- 5. Algorithms on Graphs -- 6. Matrix Multiplication and Related Operations -- 7.The Fast Fourier Transform and its Applications -- 8. Integer and Polynomial Arithmetic -- 9. Pattern-Matching Algorithms -- 10. NP-Complete Problems -- 11. Some Provably Intractable Problems -- 12. Lower Bounds on Numbers of Arithmetic Operations.
Summary: The Design and Analysis of Computer Algorithms introduces the basic data structures and programming techniques often used in efficient algorithms. It covers the use of lists, push-down stacks, queues, trees, and graphs.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
Reference Books Reference Books Main Library
Reference 		Reference 005.1 AHO (Browse shelf(Opens below)) Available 008834
Reference Books Reference Books Main Library
Reference 		Reference 005.1 AHO (Browse shelf(Opens below)) Available 008262
Lending Books Lending Books Main Library
Stacks 		Reference 005.1 AHO (Browse shelf(Opens below)) Available 005487
Total holds: 0

Includes index.

1. Models of Computation --
2. Design of Efficient Algorithms --
3. Sorting and Order Statistics --
4. Data Structures for Set Manipulation Problems --
5. Algorithms on Graphs --
6. Matrix Multiplication and Related Operations --
7.The Fast Fourier Transform and its Applications --
8. Integer and Polynomial Arithmetic --
9. Pattern-Matching Algorithms --
10. NP-Complete Problems --
11. Some Provably Intractable Problems --
12. Lower Bounds on Numbers of Arithmetic Operations.

The Design and Analysis of Computer Algorithms introduces the basic data structures and programming techniques often used in efficient algorithms. It covers the use of lists, push-down stacks, queues, trees, and graphs.

There are no comments on this title.

to post a comment.

Click on an image to view it in the image viewer

© University of Vavuniya

---