Abstract data types and algorithms
Author(s)
Bibliographic Information
Abstract data types and algorithms
（Macmillan computer science series）
Macmillan education, c1990
2nd ed
- pbk
Available at / 6 libraries
-
No Libraries matched.
- Remove all filters.
Note
Previous ed.: Basingstoke : Macmillan Education, 1988
Description and Table of Contents
Description
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.
Table of Contents
- 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.
by "Nielsen BookData"