Chapter 0 Preface¶
Chapter 1 Object Oriented Programming¶
Chapter 2 Pointers in Java¶
- 2.1. Pointers Chapter Introduction
- 2.2. Basic References
- 2.3. Pointers Syntax
- 2.4. Local Memory
- 2.5. Heap Memory
- 2.6. Link Nodes
- 2.7. Practice Exercises
- 2.7.1. JHAVEPOPEx1
- 2.7.2. JHAVEPOPEx2
- 2.7.3. JHAVEPOPEx3
- 2.7.4. JHAVEPOPEx4
- 2.7.5. JHAVEPOPEx5
- 2.7.6. JHAVEPOPEx6
- 2.7.7. JHAVEPOPEx7
- 2.7.8. JHAVEPOPEx8
- 2.7.9. JHAVEPOPEx9
- 2.7.10. JHAVEPOPEx10
- 2.7.11. JHAVEPOPEx11
- 2.7.12. JHAVEPOPEx12
- 2.7.13. JHAVEPOPEx13
- 2.7.14. JHAVEPOPEx14
- 2.7.15. JHAVEPOPEx15
- 2.7.16. JHAVEPOPEx16
- 2.7.17. JHAVEPOPEx17
- 2.7.18. JHAVEPOPEx18
- 2.8. Additional Practice Exercises
Chapter 3 Recursion¶
- 3.1. Introduction
- 3.2. Writing a recursive function
- 3.3. Code Completion Practice Exercises
- 3.3.1. Introduction
- 3.3.2. Recursion Programming Exercise: Largest
- 3.3.3. Recursion Programming Exercise: Multiply
- 3.3.4. Recursion Programming Exercise: GCD
- 3.3.5. Recursion Programming Exercise: log
- 3.3.6. Recursion Programming Exercise: Cummulative Sum
- 3.3.7. Recursion Programming Exercise: Add odd positions
- 3.3.8. Recursion Programming Exercise: Sum Of the Digits
- 3.3.9. Recursion Programming Exercise: Count Characters
- 3.4. Writing More Sophisticated Recursive Functions
- 3.5. Harder Code Completion Practice Exercises
- 3.6. Writing Practice Exercises
- 3.7. Tracing Recursive Code
- 3.8. Tracing Practice Exercises
- 3.9. Summary Exercises
Chapter 4 Algorithm Analysis¶
- 4.1. Chapter Introduction
- 4.2. Logarithms
- 4.3. Problems, Algorithms, and Programs
- 4.4. Comparing Algorithms
- 4.5. Best, Worst, and Average Cases
- 4.6. Faster Computer, or Faster Algorithm?
- 4.7. Asymptotic Analysis and Upper Bounds
- 4.8. Calculating Program Running Time
- 4.9. Algorithm Analysis Summary Exercises
- 4.10. Space Bounds
Chapter 5 Intro to Data Structures¶
Chapter 6 List Interface and Array based Lists¶
Chapter 7 Linked Lists¶
Chapter 8 Stacks¶
Chapter 9 Queues¶
Chapter 10 Binary Trees¶
- 10.1. Binary Trees Chapter Introduction
- 10.2. Binary Trees
- 10.3. Binary Tree as a Recursive Data Structure
- 10.4. Binary Tree Node Implementations
- 10.5. The Full Binary Tree Theorem
- 10.6. Binary Tree Traversals
- 10.7. Implementing Tree Traversals
- 10.8. Information Flow in Recursive Functions
- 10.8.1. Information Flow in Recursive Functions
- 10.8.2. Binary Tree Set Depth Exercise
- 10.8.3. Collect-and-return
- 10.8.4. Binary Tree Check Sum Exercise
- 10.8.5. Binary Tree Leaf Nodes Count Exercise
- 10.8.6. Binary Tree Sum Nodes Exercise
- 10.8.7. Combining Information Flows
- 10.8.8. Binary Tree Check Value Exercise
- 10.8.9. Combination Problems
- 10.8.10. Binary Tree Height Exercise
- 10.8.11. Binary Tree Get Difference Exercise
- 10.8.12. Binary Tree Has Path Sum Exercise
- 10.9. Composite-based Expression Tree
Chapter 11 Binary Search Trees¶
Chapter 12 Heaps and Priority Queues¶
Chapter 13 Sorting¶
- 13.1. Chapter Introduction: Sorting
- 13.2. Sorting Terminology and Notation
- 13.3. Insertion Sort
- 13.4. Bubble Sort
- 13.5. Selection Sort
- 13.6. The Cost of Exchange Sorting
- 13.7. Optimizing Sort Algorithms with Code Tuning
- 13.8. Mergesort Concepts
- 13.9. Quicksort
- 13.10. Heapsort
- 13.11. Sorting Summary Exercises
- 13.12. An Empirical Comparison of Sorting Algorithms
