Cantitate/Preț
Produs

The Design and Analysis of Computer Algorithms: Addison-Wesley Series in Computer Science & Information Processing

Autor Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman
en Limba Engleză Paperback – 31 dec 1973
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
Citește tot Restrânge

Preț: 53874 lei

Preț vechi: 67343 lei
-20% Nou

Puncte Express: 808

Preț estimativ în valută:
9532 11121$ 8333£

Carte tipărită la comandă

Livrare economică 16-30 ianuarie 26

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780201000290
ISBN-10: 0201000296
Pagini: 432
Dimensiuni: 158 x 239 x 26 mm
Greutate: 0.69 kg
Ediția:1
Editura: Pearson
Seria Addison-Wesley Series in Computer Science & Information Processing

Locul publicării:Boston, United States

Textul de pe ultima copertă

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

Descriere

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.