Home Page Icon
Home Page
Table of Contents for
Title Page
Close
Title Page
by William J. Collins
Data Structures and the Java Collections Framework, Third Edition
Cover Page
Title Page
Copyright
Dedication
Brief Contents
Contents
PREFACE
WHAT'S NEW IN THE THIRD EDITION
THE JAVA COLLECTIONS FRAMEWORK
OTHER IMPLEMENTATIONS CONSIDERED
JUNIT AND TEST-FIRST DEVELOPMENT
PEDAGOGICAL FEATURES
SUPPORT MATERIAL
SYNOPSES OF THE CHAPTERS
APPENDIXES
ORGANIZATION OF THE LABS
ACKNOWLEDGEMENTS
CHAPTER 0: Introduction to Java
CHAPTER OBJECTIVES
0.1 Java Fundamentals
0.2 Classes
0.3 Arrays
0.4 Arguments and Parameters
0.5 Output Formatting
CROSSWORD PUZZLE
PROGRAMMING EXERCISES
CHAPTER 1: Object-Oriented Concepts
CHAPTER OBJECTIVES
1.1 Data Abstraction
1.2 Abstract Methods and Interfaces
1.3 Inheritance
1.4 Information Hiding
1.5 Polymorphism
1.6 The Unified Modeling Language
SUMMARY
CROSSWORD PUZZLE
CONCEPT EXERCISES
PROGRAMMING EXERCISES
CHAPTER 2: Additional Features of Programming and Java
CHAPTER OBJECTIVES
2.1 Static Variables, Constants and Methods
2.2 Method Testing
2.3 Exception Handling
2.4 File Output
2.5 System Testing
2.6 The Java Virtual Machine
2.7 Packages
2.8 Overriding the Object Class's equals Method
SUMMARY
CROSSWORD PUZZLE
CONCEPT EXERCISES
PROGRAMMING EXERCISES
CHAPTER 3: Analysis of Algorithms
CHAPTER OBJECTIVES
3.1 Estimating the Efficiency of Methods
3.2 Run-Time Analysis
SUMMARY
CROSSWORD PUZZLE
CONCEPT EXERCISES
PROGRAMMING EXERCISES
CHAPTER 4: The Java Collections Framework
CHAPTER OBJECTIVES
4.1 Collections
4.2 Some Details of the Java Collections Framework
SUMMARY
CROSSWORD PUZZLE
CONCEPT EXERCISES
PROGRAMMING EXERCISES
CHAPTER 5: Recursion
CHAPTER OBJECTIVES
5.1 Introduction
5.2 Factorials
5.3 Decimal to Binary
5.4 Towers of Hanoi
5.5 Searching an Array
5.6 Backtracking
5.7 Indirect Recursion
5.8 The Cost of Recursion
SUMMARY
CROSSWORD PUZZLE
CONCEPT EXERCISES
PROGRAMMING EXERCISES
CHAPTER 6: Array-Based Lists
CHAPTER OBJECTIVES
6.1 The List Interface
6.2 The ArrayList Class
6.3 Application: High-Precision Arithmetic
SUMMARY
CROSSWORD PUZZLE
CONCEPT EXERCISES
PROGRAMMING EXERCISES
CHAPTER 7: Linked Lists
CHAPTER OBJECTIVES
7.1 What is a Linked List?
7.2 The SinglyLinkedList Class—A Singly-Linked, Toy Class!
7.3 Doubly-Linked Lists
7.4 Application: A Line Editor
SUMMARY
CROSSWORD PUZZLE
CONCEPT EXERCISES
PROGRAMMING EXERCISES
CHAPTER 8: Stacks and Queues
CHAPTER OBJECTIVES
8.1 Stacks
8.2 Queues
SUMMARY
CROSSWORD PUZZLE
CONCEPT EXERCISES
PROGRAMMING EXERCISES
CHAPTER 9: Binary Trees
CHAPTER OBJECTIVES
9.1 Definition of Binary Tree
9.2 Properties of Binary Trees
9.3 The Binary Tree Theorem
9.4 External Path Length
9.5 Traversals of a Binary Tree
SUMMARY
CROSSWORD PUZZLE
CONCEPT EXERCISES
CHAPTER 10: Binary Search Trees
CHAPTER OBJECTIVES
10.1 Binary Search Trees
10.2 Balanced Binary Search Trees
SUMMARY
CROSSWORD PUZZLE
CONCEPT EXERCISES
PROGRAMMING EXERCISES
CHAPTER 11: Sorting
CHAPTER OBJECTIVES
11.1 Introduction
11.2 Simple Sorts
11.3 The Comparator Interface
11.4 How Fast Can we Sort?
11.5 Radix Sort
SUMMARY
CROSSWORD PUZZLE
CONCEPT EXERCISES
PROGRAMMING EXERCISES
CHAPTER 12: Tree Maps and Tree Sets
CHAPTER OBJECTIVES
12.1 Red-Black Trees
12.2 The Map Interface
12.3 The TreeMap Implementation of the SortedMap Interface
12.4 Application of the TreeMap Class: a Simple Thesaurus
12.5 The TreeSet Class
SUMMARY
CROSSWORD PUZZLE
CONCEPT EXERCISES
PROGRAMMING EXERCISES
CHAPTER 13: Priority Queues
CHAPTER OBJECTIVES
13.1 Introduction
13.2 The PriorityQueue Class
13.3 Implementation Details of the PriorityQueue Class
13.4 The heapSort Method
13.5 Application: Huffman Codes
SUMMARY
CROSSWORD PUZZLE
CONCEPT EXERCISES
PROGRAMMING EXERCISES
CHAPTER 14: Hashing
CHAPTER OBJECTIVES
14.1 A Framework to Analyze Searching
14.2 Review of Searching
14.3 The HashMap Implementation of the Map Interface
14.4 The HashSet Class
14.5 Open-Address Hashing (optional)
SUMMARY
CROSSWORD PUZZLE
CONCEPT EXERCISES
PROGRAMMING EXERCISES
CHAPTER 15: Graphs, Trees, and Networks
CHAPTER OBJECTIVES
15.1 Undirected Graphs
15.2 Directed Graphs
15.3 Trees
15.4 Networks
15.5 Graph Algorithms
15.6 A Network Class
15.7 Backtracking Through A Network
SUMMARY
CROSSWORD PUZZLE
CONCEPT EXERCISES
PROGRAMMING EXERCISES
APPENDIX 1: Additional Features of the JAVA Collections Framework
A1.1 Introduction
A1.2 Serialization
A1.3 Fail-Fast Iterators
APPENDIX 2: Mathematical Background
A2.1 Introduction
A2.2 Functions and Sequences
A2.3 Sums and Products
A2.4 Logarithms
A2.5 Mathematical Induction
A2.6 Induction and Recursion
CONCEPT EXERCISES
APPENDIX 3: Choosing a Data Structure
A3.1 Introduction
A3.2 Time-Based Ordering
A3.3 Index-Based Ordering
A3.4 Comparison-Based Ordering
A3.5 Hash-Based Ordering
A3.6 Space Considerations
A3.7 The Best Data Structure?
REFERENCES
INDEX
Search in book...
Toggle Font Controls
Playlists
Add To
Create new playlist
Name your new playlist
Playlist description (optional)
Cancel
Create playlist
Sign In
Email address
Password
Forgot Password?
Create account
Login
or
Continue with Facebook
Continue with Google
Sign Up
Full Name
Email address
Confirm Email Address
Password
Login
Create account
or
Continue with Facebook
Continue with Google
Prev
Previous Chapter
Cover Page
Next
Next Chapter
Copyright
Add Highlight
No Comment
..................Content has been hidden....................
You can't read the all page of ebook, please click
here
login for view all page.
Day Mode
Cloud Mode
Night Mode
Reset