Chapter 0 Preface¶
Chapter 1 Unit 1 - Data Structures and Lists¶
Chapter 2 Unit 2 - Linked Data Structures¶
- 2.1. Pointers Chapter Introduction
- 2.2. Basic References Part 1
- 2.3. Basic References Part 2
- 2.4. Pointers Syntax
- 2.5. Local Memory
- 2.6. Heap Memory
- 2.7. Link Nodes
- 2.8. Link Nodes Practice Exercises
- 2.9. Additional Practice Exercises
- 2.10. Stacks
- 2.11. Linked Stacks
- 2.12. Queues
- 2.13. Linked Queues
Chapter 3 Unit 3 - Algorithm Analysis¶
- 3.1. Chapter Introduction
- 3.2. Problems, Algorithms, and Programs
- 3.3. Comparing Algorithms
- 3.4. Best, Worst, and Average Cases
- 3.5. Faster Computer, or Faster Algorithm?
- 3.6. Asymptotic Analysis and Upper Bounds
- 3.7. Lower Bounds and Θ Notation
- 3.8. Calculating Program Running Time
- 3.9. Algorithm Analysis Summary Exercises
Chapter 4 Unit 4 - Recursion¶
- 4.1. Introduction
- 4.2. Writing a recursive function
- 4.3. Code Completion Practice Exercises
- 4.3.1. Introduction
- 4.3.2. Recursion Programming Exercise: Largest
- 4.3.3. Recursion Programming Exercise: Multiply
- 4.3.4. Recursion Programming Exercise: GCD
- 4.3.5. Recursion Programming Exercise: log
- 4.3.6. Recursion Programming Exercise: Cummulative Sum
- 4.3.7. Recursion Programming Exercise: Add odd values
- 4.3.8. Recursion Programming Exercise: Sum Of the Digits
- 4.3.9. Recursion Programming Exercise: Count Characters
- 4.4. Writing More Sophisticated Recursive Functions
- 4.5. Harder Code Completion Practice Exercises
- 4.6. Writing Practice Exercises
- 4.7. Tracing Recursive Code
- 4.8. Tracing Practice Exercises
- 4.9. Chapter Introduction: Sorting
- 4.10. Sorting Terminology and Notation
- 4.11. Insertion Sort
- 4.12. Mergesort Concepts
- 4.13. Quicksort
- 4.14. Heapsort
- 4.15. An Empirical Comparison of Sorting Algorithms
- 4.16. Lower Bounds for Sorting
- 4.17. Sorting Summary Exercises
- 4.18. Summary Exercises
Chapter 5 Unit 5 - Linear Structures¶
Chapter 6 Unit 6 - Binary Trees¶
- 6.1. Binary Trees Chapter Introduction
- 6.2. Binary Trees
- 6.3. Binary Tree as a Recursive Data Structure
- 6.4. Binary Tree Traversals
- 6.5. Binary Search Trees
- 6.6. Heaps and Priority Queues
- 6.7. Implementing Tree Traversals
- 6.8. Information Flow in Recursive Functions
- 6.8.1. Information Flow in Recursive Functions
- 6.8.2. Binary Tree Set Depth Exercise
- 6.8.3. Collect-and-return
- 6.8.4. Binary Tree Check Sum Exercise
- 6.8.5. Binary Tree Leaf Nodes Count Exercise
- 6.8.6. Binary Tree Sum Nodes Exercise
- 6.8.7. Combining Information Flows
- 6.8.8. Binary Tree Check Value Exercise
- 6.8.9. Combination Problems
- 6.8.10. Binary Tree Height Exercise
- 6.8.11. Binary Tree Get Difference Exercise
- 6.8.12. Binary Tree Has Path Sum Exercise
- 6.9. Binary Tree Node Implementations
- 6.10. Binary Tree Space Requirements
- 6.11. Dictionary Implementation Using a BST
- 6.12. Binary Tree Chapter Summary
Chapter 7 Unit 7 - Hashing¶
Chapter 8 Sorting¶
Chapter 9 Mathematical Background¶
Chapter 10 Design II¶
Chapter 11 Programming Tutorials¶
- 11.1. Command Line Basics
- 11.2. Parsing Command Line Parameters In Your Progam
- 11.3. Using Parameters in Eclipse
- 11.4. Installing the Web-CAT Submission Plug-in for Eclipse
- 11.5. Common Debugging Methods
- 11.6. Debugging In Eclipse
- 11.7. Reading Input (from Files or Otherwise)
- 11.8. Random Access Files In Java
- 11.9. JUnit Testing And You
- 11.10. Writing JUnit Tests
- 11.11. Code Coverage In JUnit
- 11.12. Testing
- 11.13. Testing for Code Coverage
- 11.14. Another Example
- 11.15. Bowling Example
