Preface¶
Preliminary¶
- 1.1. Command Line Basics
- 1.2. Parsing Command Line Parameters In Your Program
- 1.3. Using Parameters in Eclipse
- 1.4. Random Access Files In Java
- 1.5. Reading Input (from Files or Otherwise)
- 1.6. Common Debugging Methods
- 1.7. Debugging In Eclipse
- 1.8. Installing the Web-CAT Submission Plug-in for Eclipse
- 1.9. JUnit Testing And You
- 1.10. Writing JUnit Tests
- 1.11. Code Coverage In JUnit
- 1.12. Mutation Coverage In JUnit
- 1.13. Mutation Testing Examples
- 1.13.1. Types of Mutants
- 1.13.1.1. Arithmetic Operation Mutant
- 1.13.1.2. Example Code 1: Arithmetic Operation Mutant
- 1.13.1.3. Logical Expression Mutant (Remove Conditionals)
- 1.13.1.4. Example Code 2: Logical Expression Mutant (Remove Conditionals)
- 1.13.1.5. Example Code 3: Multiple Mutants in One (EvenOddCheck)
- 1.13.1.6. Example Code 4: Loop Conditions (optional)
- 1.13.1. Types of Mutants
Introduction¶
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 \(\Theta\) Notation
- 3.8. Calculating Program Running Time
- 3.9. Analyzing Problems
- 3.10. Common Misunderstandings
- 3.11. Multiple Parameters
- 3.12. Space Bounds
- 3.13. Code Tuning and Empirical Analysis
- 3.14. Algorithm Analysis Summary Exercises
Linear Data Structures¶
- 4.1. Chapter Introduction: Lists
- 4.2. The List ADT
- 4.3. Array-Based List Implementation
- 4.4. Linked Lists
- 4.5. Comparison of List Implementations
- 4.6. Doubly Linked Lists
- 4.7. List Element Implementations
- 4.8. Stacks
- 4.9. Linked Stacks
- 4.10. Queues
- 4.11. Linked Queues
- 4.12. Freelists
- 4.13. Implementing Recursion
- 4.14. Linear Structure Summary Exercises
Binary Trees¶
- 5.1. Binary Trees Chapter Introduction
- 5.2. Binary Trees
- 5.3. Binary Tree as a Recursive Data Structure
- 5.4. The Full Binary Tree Theorem
- 5.5. Binary Tree Traversals
- 5.6. Implementing Tree Traversals
- 5.7. Binary Tree Node Implementations
- 5.8. Composite-based Expression Tree
- 5.9. Binary Tree Space Requirements
- 5.10. Binary Search Trees
- 5.11. Dictionary Implementation Using a BST
- 5.12. Binary Tree Guided Information Flow
- 5.13. A Hard Information Flow Problem
- 5.14. Array Implementation for Complete Binary Trees
- 5.15. Heaps and Priority Queues
- 5.16. Heapsort
- 5.17. Huffman Coding Trees
- 5.18. Proof of Optimality for Huffman Coding
- 5.19. Trees versus Tries
- 5.20. Binary Tree Chapter Summary
Sorting¶
- 6.1. Chapter Introduction: Sorting
- 6.2. Sorting Terminology and Notation
- 6.3. Selection Sort
- 6.4. Insertion Sort
- 6.5. Bubble Sort
- 6.6. The Cost of Exchange Sorting
- 6.7. Optimizing Sort Algorithms with Code Tuning
- 6.8. Shellsort
- 6.9. Mergesort Concepts
- 6.10. Implementing Mergesort
- 6.11. Quicksort
- 6.12. Radix Sort
- 6.13. An Empirical Comparison of Sorting Algorithms
- 6.14. Lower Bounds for Sorting
- 6.15. Recursive Sorting
- 6.16. Sorting Summary Exercises
