Chapter 0 Preface¶
Chapter 1 Introduction¶
Chapter 2 Object Oriented Programming¶
Chapter 3 Programming Tutorials¶
- 1. Command Line Basics
- 2. Parsing Command Line Parameters In Your Progam
- 3. Using Parameters in Eclipse
- 4. Installing the Web-CAT Submission Plug-in for Eclipse
- 5. Common Debugging Methods
- 6. Debugging In Eclipse
- 7. Reading Input (from Files or Otherwise)
- 8. Random Access Files In Java
- 9. JUnit Testing And You
- 10. Writing JUnit Tests
- 11. Code Coverage In JUnit
- 12. Testing
- 13. Testing for Code Coverage
- 14. Another Example
- 15. Bowling Example
Chapter 4 Mathematical Background¶
Chapter 5 Algorithm Analysis¶
- 1. Chapter Introduction
- 2. Problems, Algorithms, and Programs
- 3. Comparing Algorithms
- 4. Best, Worst, and Average Cases
- 5. Faster Computer, or Faster Algorithm?
- 6. Asymptotic Analysis and Upper Bounds
- 7. Lower Bounds and Θ Notation
- 8. Calculating Program Running Time
- 9. Analyzing Problems
- 10. Common Misunderstandings
- 11. Multiple Parameters
- 12. Space Bounds
- 13. Code Tuning and Empirical Analysis
- 14. Algorithm Analysis Summary Exercises
Chapter 6 Introduction to Pointers in Java¶
Chapter 7 Linear Structures¶
- 1. Chapter Introduction: Lists
- 2. The List ADT
- 3. Array-Based List Implementation
- 4. Linked Lists
- 5. Comparison of List Implementations
- 6. Doubly Linked Lists
- 7. List Element Implementations
- 8. Stacks
- 9. Linked Stacks
- 10. Freelists
- 11. Implementing Recursion
- 12. Queues
- 13. Linked Queues
- 14. Linear Structure Summary Exercises
Chapter 8 Recursion¶
- 1. Introduction
- 2. Writing a recursive function
- 3. Code Completion Practice Exercises
- 3.1. Introduction
- 3.2. Recursion Programming Exercise: Largest
- 3.3. Recursion Programming Exercise: Multiply
- 3.4. Recursion Programming Exercise: GCD
- 3.5. Recursion Programming Exercise: log
- 3.6. Recursion Programming Exercise: Cummulative Sum
- 3.7. Recursion Programming Exercise: Add odd values
- 3.8. Recursion Programming Exercise: Sum Of the Digits
- 3.9. Recursion Programming Exercise: Count Characters
- 4. Writing More Sophisticated Recursive Functions
- 5. Harder Code Completion Practice Exercises
- 6. Writing Practice Exercises
- 7. Tracing Recursive Code
- 8. Tracing Practice Exercises
- 9. Summary Exercises
Chapter 9 Design¶
Chapter 10 Binary Trees¶
- 1. Binary Trees Chapter Introduction
- 2. Binary Trees
- 3. Binary Tree as a Recursive Data Structure
- 4. The Full Binary Tree Theorem
- 5. Binary Tree Traversals
- 6. Implementing Tree Traversals
- 7. Information Flow in Recursive Functions
- 7.1. Information Flow in Recursive Functions
- 7.2. Binary Tree Set Depth Exercise
- 7.3. Collect-and-return
- 7.4. Binary Tree Check Sum Exercise
- 7.5. Binary Tree Leaf Nodes Count Exercise
- 7.6. Binary Tree Sum Nodes Exercise
- 7.7. Combining Information Flows
- 7.8. Binary Tree Check Value Exercise
- 7.9. Combination Problems
- 7.10. Binary Tree Height Exercise
- 7.11. Binary Tree Get Difference Exercise
- 7.12. Binary Tree Has Path Sum Exercise
- 8. Binary Tree Node Implementations
- 9. Composite-based Expression Tree
- 10. Binary Tree Space Requirements
- 11. Binary Search Trees
- 12. Dictionary Implementation Using a BST
- 13. Binary Tree Guided Information Flow
- 14. Multiple Binary Trees
- 15. A Hard Information Flow Problem
- 16. Array Implementation for Complete Binary Trees
- 17. Heaps and Priority Queues
- 18. Huffman Coding Trees
- 19. Trees versus Tries
- 20. Proof of Optimality for Huffman Coding
- 21. Binary Tree Chapter Summary
Chapter 11 Sorting¶
- 1. Chapter Introduction: Sorting
- 2. Sorting Terminology and Notation
- 3. Insertion Sort
- 4. Bubble Sort
- 5. Selection Sort
- 6. The Cost of Exchange Sorting
- 7. Optimizing Sort Algorithms with Code Tuning
- 8. Shellsort
- 9. Mergesort Concepts
- 10. Implementing Mergesort
- 11. Quicksort
- 12. Heapsort
- 13. Binsort
- 14. Radix Sort
- 15. An Empirical Comparison of Sorting Algorithms
- 16. Lower Bounds for Sorting
- 17. Sorting Summary Exercises
