Series on Software Engineering and Knowledge Engineering - Vol. 13
DATA STRUCTURES AND ALGORITHMS
edited by Shi-Kuo Chang (University of Pittsburgh, USA)
This is an excellent, up-to-date and easy-to-use text on data structures and algorithms that is intended for undergraduates in computer science and information science. The thirteen chapters, written by an international group of experienced teachers, cover the fundamental concepts of algorithms and most of the important data structures as well as the concept of interface design. The book contains many examples and diagrams. Whenever appropriate, program codes are included to facilitate learning.
This book is supported by an international group of authors who are experts on data structures and algorithms, through its website at http://www.cs.pitt.edu/~jung/GrowingBook/, so that both teachers and students can benefit from their expertise.
Contents:
- Introduction to the Fundamentals of Algorithms (P Maresca)
-
The Running Time of an Algorithm (P Maresca)
- The Execution Time of an Algorithm: Advanced Considerations (P Maresca)
- Abstract Data Types (T Arndt)
- Stacks, Recursion and Backtracking (F Thulin)
- Queues (A Guercio)
- Lists (R Huang & J Ma)
- Searching (T K Shih)
- Sorting (Q Jin)
- Tables (C R Dow)
- Binary Trees (S Kim)
- Graph Algorithms (G Tortora & R Francese)
- Analysing the Interface (S Levialdi)
Readership: Undergraduates in computer science and information
science.
“This is an up-to-date and easy-to-use text on data structures and algorithms that is intended for undergraduates in computer science and information science ... This textbook is entirely self-contained and can be used by itself.”
| 360pp |
Pub. date: Oct 2003 |
|
