• 
  오은진 교수

  - 현) 포항공과대학교 컴퓨터공학과 조교수
  - 포항공과대학교 컴퓨터공학과 박사

1. CHAPTER 1
   1. 1주차 소개
   1. 1-1. Computing Fibonacci Numbers
   1. 1-2. Asymptotic Bounds
   1. 1-3. Example: Convex Hulls
   1. 1주차 Quiz
2. CHAPTER 2
   1. 2주차 소개
   1. 2-1. Multiplication
   1. 2-2. Binary Search and Merge Sort
   1. 2-3. Selection
   1. 2주차 Quiz
3. CHAPTER 3
   1. 3주차 소개
   1. 3-1. Graphs
   1. 3-2. Depth-First Search(DFS)
   1. 3-3. Depth-First Search(DFS) 응용 1
   1. 3-4. Depth-First Search(DFS) 응용 2
   1. 3주차 Quiz
4. CHAPTER 4
   1. 4주차 소개
   1. 4-1. Breadth-First Search
   1. 4-2. Dijkstra’s Algorithm (1)
   1. 4-3. Dijkstra’s Algorithm (2)
   1. 4주차 Quiz
5. CHAPTER 5
   1. 5주차 소개
   1. 5-1. Shortest Paths in the Presence of Negative Edges
   1. 5-2. Bellman-Ford Algorithm
   1. 5-3. Detecting a Negative Cycle
   1. 5-4. Bellman-Ford Algorithm for Undirected Graphs
   1. 5주차 Quiz
6. CHAPTER 6
   1. 6주차 소개
   1. 6-1. Interval Scheduling
   1. 6-2. Interval Partitioning
   1. 6-3. Huffman Encoding
   1. 6주차 Quiz
7. CHAPTER 7
   1. 7주차 소개
   1. 7-1. Minimum Spanning Trees
   1. 7-2. Data Structure for Disjoint Sets
   1. 7주차 Quiz

교재: 교재 없음 (강의노트 제공)