Go to login Go to sub menu Go to text

Course summary

  • Type MOOC course
  • Period Always open
  • Learning Time Study freely
  • Course approval method Automatic approval
  • Certificate Issue Online
http://www.edwith.org/algorithms-2
둘러보기
Thumb up 0 Learner 27

Instructor Introduction

  • 오은진 교수

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

Lecture plan

강의
  1. CHAPTER 1
    1. 1주차 소개
    1. 1-1. Shortest Paths in DAGs
    1. 1-2. LIS and Edit Distance
    1. 1-3. Knapsack
    1. 1주차 Quiz
  2. CHAPTER 2
    1. 2주차 소개
    1. 2-1. Chain Matrix Multiplication
    1. 2-2. Shortest Reliable Path
    1. 2-3. All-Pairs Shortest Paths
    1. 2주차 Quiz
  3. CHAPTER 3
    1. 3주차 소개
    1. 3-1. Linear Programming(1)
    1. 3-2. Linear Programming(2)
    1. 3-3. Linear Programming(3)
    1. 3주차 Quiz
  4. CHAPTER 4
    1. 4주차 소개
    1. 4-1. Flow Network
    1. 4-2. Max-flow Min-cut Theorem
    1. 4-3. Maximum Flow Algorithms
    1. 4주차 Quiz
  5. CHAPTER 5
    1. 5주차 소개
    1. 5-1. Satisfiability Problem
    1. 5-2. P vs NP, Reductions
    1. 5-3. Hamiltonian Problems
    1. 5주차 Quiz
  6. CHAPTER 6
    1. 6주차 소개
    1. 6-1. Circuit Satisfiability
    1. 6-2. Three-dimensional Matching
    1. 6-3. Three-dimensional Matching(2)
    1. 6주차 Quiz
  7. CHAPTER 7
    1. 7주차 소개
    1. 7-1. Independent Set
    1. 7-2. Vertex Cover and Clique
    1. 7-3. Traveling Salesman Problem
    1. 7주차 Quiz

Additional Info

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