Chapter 0 Preface¶
Chapter 1 Introduction¶
Chapter 2 Object Oriented Programming¶
Chapter 3 List Interface & Array based Lists¶
Chapter 4 Mathematical Background¶
Chapter 5 Algorithm Analysis¶
Chapter 6 Introduction to Pointers in Java¶
- 6.1. Pointers Chapter Introduction
- 6.2. Basic References Part 1
- 6.3. Basic References Part 2
- 6.4. Pointers Syntax
- 6.5. Local Memory
- 6.6. Heap Memory
- 6.7. Link Nodes
- 6.8. Link Nodes Practice Exercises
- 6.9. Pointers Concepts Summary
- 6.10. Additional Practice Exercises
- 6.11. More Practice Exercises
- 6.11.1. AddNodeAfterRef7
- 6.11.2. ChangeHeadNodeValue
- 6.11.3. ConcatenateTwoLists
- 6.11.4. DeleteNode
- 6.11.5. FirstNodeEqualsValue
- 6.11.6. InsertListAfterRef13
- 6.11.7. InsertListInMiddle
- 6.11.8. LastNodeParam5
- 6.11.9. LastNodeRef1
- 6.11.10. LoopInChain15
- 6.11.11. MiddleNodeRef3
- 6.11.12. ReferenceSecondLastNode
- 6.11.13. ReferenceValueNode
- 6.11.14. RemoveRefNext9
- 6.11.15. ReverseUpToRef11
Chapter 7 Linked Lists¶
Chapter 8 Stacks¶
Chapter 9 Graphs¶
Chapter 10 Queues¶
Chapter 11 Recursion¶
- 11.1. Introduction
- 11.2. Writing a recursive function
- 11.3. Code Completion Practice Exercises
- 11.3.1. Introduction
- 11.3.2. Recursion Programming Exercise: Largest
- 11.3.3. Recursion Programming Exercise: Multiply
- 11.3.4. Recursion Programming Exercise: GCD
- 11.3.5. Recursion Programming Exercise: log
- 11.3.6. Recursion Programming Exercise: Cummulative Sum
- 11.3.7. Recursion Programming Exercise: Add odd values
- 11.3.8. Recursion Programming Exercise: Sum Of the Digits
- 11.3.9. Recursion Programming Exercise: Count Characters
- 11.4. Writing More Sophisticated Recursive Functions
- 11.5. Harder Code Completion Practice Exercises
- 11.6. Writing Practice Exercises
- 11.7. Tracing Recursive Code
- 11.8. Tracing Practice Exercises
- 11.9. Summary Exercises
Chapter 12 Binary Trees¶
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. Shellsort
- 13.9. Mergesort Concepts
- 13.10. Implementing Mergesort
- 13.11. Quicksort
- 13.12. Heapsort
- 13.13. Binsort
- 13.14. Radix Sort
- 13.15. An Empirical Comparison of Sorting Algorithms
- 13.16. Lower Bounds for Sorting
- 13.17. Sorting Summary Exercises
Chapter 14 Indexing¶
Chapter 15 Hashing¶
Chapter 16 Programming Tutorials¶
- 16.1. Command Line Basics
- 16.2. Parsing Command Line Parameters In Your Program
- 16.3. Using Parameters in Eclipse
- 16.4. Installing the Web-CAT Submission Plug-in for Eclipse
- 16.5. Common Debugging Methods
- 16.6. Debugging In Eclipse
- 16.7. Reading Input (from Files or Otherwise)
- 16.8. Random Access Files In Java
- 16.9. JUnit Testing And You
- 16.10. Writing JUnit Tests
- 16.11. Code Coverage In JUnit
- 16.12. Testing
- 16.13. Testing for Code Coverage
- 16.14. Another Example
- 16.15. Bowling Example
