Chapter 0 Preface¶
Chapter 1 Introduction¶
Chapter 2 Object-Oriented Programming¶
Chapter 3 Programming Tutorials¶
- 3.1. Command Line Basics
- 3.2. Parsing Command Line Parameters In Your Progam
- 3.3. Using Parameters in Eclipse
- 3.4. Using/Installing VT Development Tools
- 3.5. Common Debugging Methods
- 3.6. Debugging In Eclipse
- 3.7. Reading Input (from Files or Otherwise)
- 3.8. Random Access Files In Java
- 3.9. JUnit Testing And You
- 3.10. Writing JUnit Tests
- 3.11. Code Coverage In JUnit
Chapter 4 Mathematical Background¶
Chapter 5 Algorithm Analysis¶
- 5.1. Chapter Introduction
- 5.2. Problems, Algorithms, and Programs
- 5.3. Comparing Algorithms
- 5.4. Best, Worst, and Average Cases
- 5.5. Faster Computer, or Faster Algorithm?
- 5.6. Asymptotic Analysis and Upper Bounds
- 5.7. Lower Bounds and \(\Theta\) Notation
- 5.8. Calculating Program Running Time
- 5.9. Analyzing Problems
- 5.10. Common Misunderstandings
- 5.11. Multiple Parameters
- 5.12. Space Bounds
- 5.13. Code Tuning and Empirical Analysis
- 5.14. Algorithm Analysis Summary Exercises
Chapter 6 Linear Structures¶
- 6.1. Chapter Introduction: Lists
- 6.2. The List ADT
- 6.3. Array-Based List Implementation
- 6.4. Linked Lists
- 6.5. Comparison of List Implementations
- 6.6. Doubly Linked Lists
- 6.7. List Element Implementations
- 6.8. Stacks
- 6.9. Linked Stacks
- 6.10. Freelists
- 6.11. Implementing Recursion
- 6.12. Queues
- 6.13. Linked Queues
- 6.14. Linear Structure Summary Exercises
Chapter 7 Recursion¶
- 7.1. Introduction
- 7.2. Writing a recursive function
- 7.3. Code Completion Practice Exercises
- 7.3.1. Programming Exercise: Largest
- 7.3.2. Programming Exercise: Multiply
- 7.3.3. Programming Exercise: GCD
- 7.3.4. Programming Exercise: Logs
- 7.3.5. Programming Exercise: Cummulative Sum
- 7.3.6. Programming Exercise: Array Sum
- 7.3.7. Programming Exercise: Digits Sum
- 7.3.8. Programming Exercise: Characters
- 7.4. Writing More Sophisticated Recursive Functions
- 7.5. Harder Code Completion Practice Exercises
- 7.6. Writing Practice Exercises
- 7.7. Tracing Recursive Code
- 7.8. Tracing Practice Exercises
- 7.9. Summary Exercises
Chapter 8 Design¶
Chapter 9 Binary Trees¶
- 9.1. Binary Trees Chapter Introduction
- 9.2. Binary Trees
- 9.3. Binary Tree as a Recursive Data Structure
- 9.4. The Full Binary Tree Theorem
- 9.5. Binary Tree Traversals
- 9.6. Implementing Tree Traversals
- 9.7. Information Flow in Recursive Functions
- 9.8. Binary Tree Node Implementations
- 9.9. Composite-based Expression Tree
- 9.10. Binary Tree Space Requirements
- 9.11. Binary Search Trees
- 9.12. Dictionary Implementation Using a BST
- 9.13. Binary Tree Guided Information Flow
- 9.14. Multiple Binary Trees
- 9.15. A Hard Information Flow Problem
- 9.16. Array Implementation for Complete Binary Trees
- 9.17. Heaps and Priority Queues
- 9.18. Huffman Coding Trees
- 9.19. Trees versus Tries
- 9.20. Proof of Optimality for Huffman Coding
- 9.21. Binary Tree Chapter Summary
Chapter 10 Sorting¶
- 10.1. Chapter Introduction: Sorting
- 10.2. Sorting Terminology and Notation
- 10.3. Insertion Sort
- 10.4. Bubble Sort
- 10.5. Selection Sort
- 10.6. The Cost of Exchange Sorting
- 10.7. Optimizing Sort Algorithms with Code Tuning
- 10.8. Shellsort
- 10.9. Mergesort Concepts
- 10.10. Implementing Mergesort
- 10.11. Quicksort
- 10.12. Heapsort
- 10.13. Binsort
- 10.14. Radix Sort
- 10.15. An Empirical Comparison of Sorting Algorithms
- 10.16. Lower Bounds for Sorting
- 10.17. Sorting Summary Exercises
