Final Exam Information
Date: June 19, 2025 (Tuesday)
Time: 3–5 PM (2 hours)
Coverage: The final exam will cover the following chapters from the textbook:
Location: Jung Woonoh IT & General Education Center, Room 406
- Chapter 1: Introduction
- Chapter 2: Getting Started
- Chapter 3: Characterizing Running Times
- Chapter 4: Divide-and-Conquer
- Chapter 5: Probabilistic Analysis and Randomized Algorithms
- Chapter 6: Heapsort
- Chapter 7: Quicksort
- Chapter 8: Sorting in Linear Time
- Chapter 9: Medians and Order Statistics
- Chapter 10: Elementary Data Structures
- Chapter 11: Hash Tables
- Chapter 12: Binary Search Trees
- Chapter 14: Dynamic Programming
- Chapter 15: Greedy Algorithms
- Chapter 20: Elementary Graph Algorithms
- Chapter 22: Single-Source Shortest Paths
- Chapter 34: NP-Completeness