The Design and Analysis of Computer Algorithms
| AUTHOR | Ullman, Jeffrey; Hopcroft, John; Aho, Alfred et al. |
| PUBLISHER | Pearson (01/01/1974) |
| PRODUCT TYPE | Paperback (Paperback) |
Description
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. 0201000296B04062001
Show More
Product Format
Product Details
ISBN-13:
9780201000290
ISBN-10:
0201000296
Binding:
Paperback or Softback (Trade Paperback (Us))
Content Language:
English
More Product Details
Page Count:
480
Carton Quantity:
18
Product Dimensions:
6.24 x 1.04 x 9.40 inches
Weight:
1.51 pound(s)
Feature Codes:
Price on Product
Country of Origin:
US
Subject Information
BISAC Categories
Computers | Programming - Algorithms
Computers | Questions & Answers
Computers | Computer Science
Dewey Decimal:
001.642
Descriptions, Reviews, Etc.
jacket back
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.
0201000296B04062001
Show More
publisher marketing
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. 0201000296B04062001
Show More
List Price $104.99
Your Price
$103.94