Data Structures and Algorithms in Java - page 1
- Data Structures and Algorithms in Java
- Data Structures and Algorithms in Java
- Table of Contents
- Copyright
- Preface
- Intended Audience
- Part I: Object-Oriented Programming
- Chapter 1. Encapsulation
- Section 1.1. Software Development
- Section 1.2. Classes and Objects
- Section 1.3. Using Objects
- Summary
- Vocabulary
- Problems
- Projects
- Chapter 2. Polymorphism
- Section 2.1. Reference Types
- Section 2.2. Arrays
- Section 2.3. Interfaces
- Section 2.4. Overloading
- Summary
- Vocabulary
- Problems
- Projects
- Chapter 3. Inheritance
- Section 3.1. Extending a Class
- Section 3.2. The Object Class
- Section 3.3. Packages and Access Levels
- Summary
- Vocabulary
- Problems
- Projects
- Part II: Linear Structures
- Chapter 4. Stacks and Queues
- Section 4.1. The Stack Interface
- Section 4.2. The Call Stack
- Section 4.3. Exceptions
- Section 4.4. The Queue Interface
- Summary
- Vocabulary
- Problems
- Projects
- Chapter 5. Array-Based Structures
- Section 5.1. Shrinking and Stretching Arrays
- Section 5.2. Implementing Stacks and Queues
- Section 5.3. The List Interface
- Section 5.4. Iterators
- Section 5.5. The Java Collections Framework: A First Look
- Summary
- Vocabulary
- Problems
- Projects
- Chapter 6. Linked Structures
- Section 6.1. List Nodes
- Section 6.2. Stacks and Queues
- Section 6.3. The LinkedList Class
- Section 6.4. The Java Collections Framework Revisited
- Summary
- Vocabulary
- Problems
- Projects
- Part III: Algorithms
- Chapter 7. Analysis of Algorithms
- Section 7.1. Timing
- Section 7.2. Asymptotic Notation
- Section 7.3. Counting Steps
- Section 7.4. Best, Worst, and Average Case
- Section 7.5. Amortized Analysis
- Summary
- Vocabulary
- Problems
- Projects
- Chapter 8. Searching and Sorting
- Section 8.1. Linear Search
- Section 8.2. Binary Search
- Section 8.3. Insertion Sort
- Section 8.4. The Comparable Interface
- Section 8.5. Sorting Linked Lists
- Summary
- Vocabulary
