Pub. Date:
Data Structures and Abstractions with Java / Edition 4

Data Structures and Abstractions with Java / Edition 4

by Frank M. Carrano, Timothy M. Henry
Current price is , Original price is $176.2. You

Temporarily Out of Stock Online

Please check back later for updated availability.

Item is available through our marketplace sellers.

Product Details

ISBN-13: 9780133744057
Publisher: Pearson
Publication date: 09/04/2014
Edition description: Older Edition
Pages: 936
Product dimensions: 8.35(w) x 10.25(h) x 1.70(d)

About the Author

Frank M. Carrano is a professor emeritus of computer science at the University of Rhode Island. He received the Ph.D. degree in computer science from Syracuse University in 1969. His interests include data structures, computer science education, social issues in computing, and numerical computation. Professor Carrano is particularly interested in the design and delivery of undergraduate courses in computer science. He has authored several well-known computer science textbooks for undergraduates.

Walter Savitchreceived the Ph.D. degree in Mathematics from the University of California at Berkeley in 1969. Since that time he has been on the faculty at the University of California at San Diego and is currently a Professor of Computer Science and director of the Interdisciplinary Ph.D. Program in Cognitive Science. Professor Savitch’s research areas include complexity theory, formal language theory, computational linguistics, and the development of computer science education materials. In addition to writing numerous research articles and involvement in other editorial projects, he has written a number of well-known computer science textbooks, including Pascal, Ada, and C++ CS1 and CS2 textbooks.

Table of Contents

Introduction: Organizing Data

Prelude: Designing Classes

1. Bags

Java Interlude 1 Generics

2. Bag Implementations That Use Arrays

Java Interlude 2 Exceptions

3. A Bag Implementation That Links Data

4. The Efficiency of Algorithms

5. Stacks

6. Stack Implementations

Java Interlude 3 More About Exceptions

7. Queues, Deques, and Priority Queues

8. Queue, Deque, and Priority Queue Implementations

9. Recursion

10. Lists

11. A List Implementation That Uses an Array

12. A List Implementation That Links Data

Java Interlude 4 Iterators

13 Iterators for the ADT List

14. Problem Solving With Recursion

Java Interlude 5 More About Generics

15. An Introduction to Sorting

16. Faster Sorting Methods

Java Interlude 6 Mutable and Immutable Objects

17. Sorted Lists

Java Interlude 7 Inheritance and Polymorphism

18. Inheritance and Lists

19. Searching

Java Interlude 8 Generics Once Again

20. Dictionaries

21. Dictionary Implementations

22. Introducing Hashing

23. Hashing as a Dictionary Implementation

24. Trees

25. Tree Implementations

Java Interlude 9 Cloning

26. A Binary Search Tree Implementation

27. A Heap Implementation

28. Balanced Search Trees

29. Graphs

30. Graph Implementations


A. Documentation and Programming Style

B. Java Classes

C. Creating Classes from Other Classes

Online Supplements

1. Java Basics

2. File Input and Output

3. Glossary

4. Answers to Study Questions

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews