
Instructor Introduction
-
오은진 교수
- 현) 포항공과대학교 컴퓨터공학과 조교수
- 포항공과대학교 컴퓨터공학과 박사
Lecture plan
강의
-
CHAPTER 1
- 1주차 소개
- 1-1. Computing Fibonacci Numbers
- 1-2. Asymptotic Bounds
- 1-3. Example: Convex Hulls
- 1주차 Quiz
-
CHAPTER 2
- 2주차 소개
- 2-1. Multiplication
- 2-2. Binary Search and Merge Sort
- 2-3. Selection
- 2주차 Quiz
-
CHAPTER 3
- 3주차 소개
- 3-1. Graphs
- 3-2. Depth-First Search(DFS)
- 3-3. Depth-First Search(DFS) 응용 1
- 3-4. Depth-First Search(DFS) 응용 2
- 3주차 Quiz
-
CHAPTER 4
- 4주차 소개
- 4-1. Breadth-First Search
- 4-2. Dijkstra’s Algorithm (1)
- 4-3. Dijkstra’s Algorithm (2)
- 4주차 Quiz
-
CHAPTER 5
- 5주차 소개
- 5-1. Shortest Paths in the Presence of Negative Edges
- 5-2. Bellman-Ford Algorithm
- 5-3. Detecting a Negative Cycle
- 5-4. Bellman-Ford Algorithm for Undirected Graphs
- 5주차 Quiz
-
CHAPTER 6
- 6주차 소개
- 6-1. Interval Scheduling
- 6-2. Interval Partitioning
- 6-3. Huffman Encoding
- 6주차 Quiz
-
CHAPTER 7
- 7주차 소개
- 7-1. Minimum Spanning Trees
- 7-2. Data Structure for Disjoint Sets
- 7주차 Quiz
Additional Info
교재: 교재 없음 (강의노트 제공)