Data structures and algorithms
Author(s)
Bibliographic Information
Data structures and algorithms
(Series on software engineering and knowledge engineering, v.13)
World Scientific, c2013
Available at / 1 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes index
Description and Table of Contents
Description
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 www.cs.pitt.edu/~jung/GrowingBook/, so that both teachers and students can benefit from their expertise.
Table of 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).
by "Nielsen BookData"