-
- 주제분류
- 공학 >컴퓨터ㆍ통신 >정보통신공학
-
- 강의학기
- 2015년 1학기
-
- 조회수
- 27,816
-
- 평점
- 4.2/5.0 (4)
- 강의계획서
- 강의계획서
효율적인 자료구조와 알고리즘에 대한 원리를 터득한다
- 수강안내 및 수강신청
- ※ 수강확인증 발급을 위해서는 수강신청이 필요합니다
차시별 강의
| 1. | ![]() |
Introduction & Stable Matching | Introduction & Stable Matching | |
![]() |
Introduction & Stable Matching | Introduction & Stable Matching | ![]() |
|
| 2. | ![]() |
Algorithm Analysis (Big-O notation) | Algorithm Analysis (Big-O notation) | |
| 3. | ![]() |
Greedy Algorithms | Greedy Algorithms | |
![]() |
Greedy Algorithms | Greedy Algorithms | ![]() |
|
| 4. | ![]() |
Minimum Spanning Tree | Minimum Spanning Tree | |
![]() |
Minimum Spanning Tree | Minimum Spanning Tree | ![]() |
|
| 5. | ![]() |
Divide and Conquer | Divide and Conquer | |
![]() |
Divide and Conquer | Divide and Conquer | ![]() |
|
| 6. | ![]() |
Dynamic Programming | Dynamic Programming | |
![]() |
Dynamic Programming | Dynamic Programming | ![]() |
|
| 7. | ![]() |
Dynamic Programming | Dynamic Programming | |
| 8. | ![]() |
Mid-term | Mid-term | |
| 9. | ![]() |
Dynamic Programming | Dynamic Programming | |
![]() |
Dynamic Programming | Dynamic Programming | ![]() |
|
| 10. | ![]() |
Dynamic Programming | Dynamic Programming | |
| 11. | ![]() |
Network Flow | Network Flow | |
![]() |
Network Flow | Network Flow | ![]() |
|
| 12. | ![]() |
Network Flow | Network Flow | |
| 13. | ![]() |
Intractability | Intractability | |
![]() |
Intractability | Intractability | ![]() |
|
| 14. | ![]() |
Intractability | Intractability | |
| 15. | ![]() |
Coping with Intractability | Coping with Intractability | |
![]() |
Coping with Intractability | Coping with Intractability | ![]() |
연관 자료











