Data Structures And Algorithm Analysis In Java - Couverture rigide

Weiss, Mark-Allen

Couverture rigide

ISBN 10 : 0201357542 ISBN 13 : 9780201357547

Editeur : Pearson, 1998

Synopsis

Mark Allen Weiss provides a proven approach to algorithms and data structures using the exciting Java programming language as the implementation tool. With Java he highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time. Dr. Weiss also distinguishes this text with a logical organization of topics, his engaging writing style and an extensive use of figures and examples showing the successive stages of an algorithm. Included are algorithm and design techniques and amortized analysis, plus a new chapter on advanced data structures and their implementation.

A propos du livre

À propos de l?auteur

Mark Allen Weiss is a Professor in the School of Computer Science at Florida International University. He received his Ph.D. in Computer Science from Princeton University where he studied under Robert Sedgewick. Dr.Weiss has received FIU's Excellence in Research Award, as well as the Teaching Incentive Program Award, which was established by the Florida Legislature to recognize teaching excellence. Mark Allen Weiss is on the Advanced Placement Computer Science Development Committee. He is the successful author of Algorithms, Data Structures, and Problem Solving with C++ and the series Data Structures and Algorithm Analysis in Pascal, Ada, C, and C++, with Addison-Wesley.

0201357542AB04062001

À propos de la quatrième de couverture

Mark Allen Weiss provides a proven approach to algorithms and data structures using the exciting Java programming language as the implementation tool. With Java he highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time. Dr. Weiss also distinguishes this text with a logical organization of topics, his engaging writing style, and an extensive use of figures and examples showing the successive stages of an algorithm.

Features

• Contains extensive sample code using Java 1.2, which is available over the Internet.
• Covers the Java Collections Library in an appendix.
• Includes a chapter on algorithm and design techniques that covers greedy algorithms, divide-and-conquer algorithms, dynamic programming,
• randomized algorithms, and backtracking.
• Presents current topics and new data structures such as Fibonacci heaps, skew heaps, binomial queues, skip lists, and splay trees.
• Offers a chapter on amortized analysis that examines the advanced data structures presented earlier in the book.
• Provides a chapter on advanced data structures and their implementation, covering red-black trees, top-down splay trees, treaps, k-d trees, pairing heaps, and more.

0201357542B04062001

Détails de l'édition

• Éditeur: Pearson
• Date d'édition: 1998
• Langue: anglais
• ISBN 10: 0201357542
• ISBN 13: 9780201357547
• Reliure: Relié
• Numéro d'édition: 1
• Nombre de pages: 576
• Coordonnées du fabricant: non disponible
• Personne responsable: Riccardo Bacigalupo; riccardo.bacigalupo@sanoma.it; ; Sanoma Italia Via Arconati, 1 �; Milano; 20135; Italie