EVERYDAY FREE SHIPPING on $25 & up - Excludes marketplace items & rentals.
EVERYDAY FREE SHIPPING on $25 & up - Excludes marketplace items & rentals.
EVERYDAY FREE SHIPPING on $25 & up - Excludes marketplace items & rentals
Search
Data Structures and Abstractions With Java - Text Only

Data Structures and Abstractions With Java - Text Only - 03 edition

ISBN13: 978-0130174895

Cover of Data Structures and Abstractions With Java - Text Only 03 (ISBN 978-0130174895)
ISBN13: 978-0130174895
ISBN10: 0130174890
Cover type: Hardback
Edition/Copyright: 03
Publisher: Prentice Hall, Inc.
Published: 2003
International: No

List price: $113.00

More Shipping Options

Data Structures and Abstractions With Java - Text Only - 03 edition

ISBN13: 978-0130174895

Frank Carrano and Walter Savitch

ISBN13: 978-0130174895
ISBN10: 0130174890
Cover type: Hardback
Edition/Copyright: 03
Publisher: Prentice Hall, Inc.

Published: 2003
International: No
Summary

For one-semester Introductory courses or two-semester courses in data structures (CS-2) in the departments of Computer Science, Computer Engineering, Business, and Management Information Systems.

This highly anticipated innovative book by two of the leading CS-1/CS-2 authors focuses the design specification and implementation of ADTs. This book was created from the ground up with objects and Java in mind and shows students how to use and implement key data organizations. Its unique object oriented presentation divides the material into short bite size segments that are organized into small chapters. This makes learning easier for the student and allows for teaching flexibility.

Table of Contents

Introduction.

1. Java Classes.

2. Creating Classes from Other Classes.

3. Designing Classes.

4. Lists.

5. List Implementations That Use Arrays.

6. List Implementations That Link Data.

7. Iterators.

8. Java's Iterator Interfaces.

9. The Efficiency of Algorithms.

10. Recursion.

11. An Introduction to Sorting.

12. Faster Sorting Methods.

13. Sorted Lists.

14. Inheritance and Lists.

15. Mutable, Immutable, and Cloneable Objects.

16. Searching.

17. Dictionaries.

18. Dictionary Implementations.

19. Hashing as a Dictionary Implementation.

20. Stacks.

21. Stack Implementations.

22. Queues, Deques, and Priority Queues.

23. Queue, Deque, and Priority Queue Implementations.

24. Trees.

25. Tree Implementations.

26. A Binary Search Tree Implementation.

27. A Heap Implementation.

28. Balanced Search Trees.

29. Graphs.

30. Graph Implementations.

Appendix A: Java Essentials.

Appendix B: Exception Handling.

Appendix C: File I/O.

Appendix D: Documentation and Programming Style.

Appendix E: Java Resources.

Appendix F: Answers to Self-Test Questions.

Inside covers (end papers).

Reserved Words.

Operator Precedence.

Unicode Character Codes.

More Shipping Options