Intended as a second course on programming with data structures, this book is based on the notion of an abstract data type which is defined as an abstract mathematical model with a defined set of operations. The specification of data types and their corresponding operations are presented in a form directly representable in a Pascal-like language. Part 1 begins by examining the time and space requirements of computer algorithms and develops a notation which is used in the remainder of the book to compare various implementations of abstract data types. Part 2 further describes many algorithms and common techniques for developing efficient algorithms using abstract data types. Programming paradigms such as divide and conquer, dynamic programming, graph searching, tabulation techniques and radomized algorithms are discussed.
Reihe
Auflage
Sprache
Verlagsort
Basingstoke
Großbritannien
Zielgruppe
Für höhere Schule und Studium
Für Beruf und Forschung
Editions-Typ
Illustrationen
Maße
Höhe: 234 mm
Breite: 156 mm
Gewicht
ISBN-13
978-0-333-51209-8 (9780333512098)
Copyright in bibliographic data is held by Nielsen Book Services Limited or its licensors: all rights reserved.
Schweitzer Klassifikation
Part 1 Design and analysis of data types: the complexity of algorithms; abstract data types and program design; elementary (Linear) ADTs; non-linear ADTs - trees; abstract data type sets -I; abstract data type sets - II; non-linear ADTs - graphs. Part 2 Algorithm design with abstract data types: techniques for developing efficient algorithms; sorting - an algorithm on the ADT list; graph traversals and algorithms; string-searching algorithms; "Hard" problems and NP-completeness.
