3. 강의목표
Algorithms are procedures or methods that solve problems arising across the full range of computing applications. Algorithmic problems from those areas, however, are rarely mathematically well-formed and they often come with application-specific details, most of which are extraneous. The goal of this course is to understand how to formulate problems, and from this, how to design efficient algorithms for the resulting problems. The course starts with an introduction to algorithms. Then we study four essential algorithm design techniques: greedy algorithms, divide and conquer, dynamic programming, and network flow. We will also spend a few weeks on computational intractability and approximation algorithm, a technique for dealing with computational intractable problems.
4. 강의선수/수강필수사항
CSED101 Programming and Problem Solving
CSED233 Data structure
5. 성적평가
Midterm exam.: 30%, Final exam.: 30%, Homework: 20%,
Problem solving (programming, project): 20%.
6. 강의교재
| 도서명 |
저자명 |
출판사 |
출판년도 |
ISBN |
|
Algorithms
|
Sanjoy Dasgupta, Christos Papadimitriou, and Umesh Vazirani
|
McGraw-Hill International Edition
|
2008
|
978-0071259750
|
7. 참고문헌 및 자료
Algorithm Design by Jon Kleinberg and Éva Tardos, 2006, Addison Wesley.
8. 강의진도계획
# Week 1 : Introduction
# Week 2 : Divide-and-Conquer
# Week 3-4 : Graph algorithms
# Week 5-6 : Greedy algorithms
# Week 6-7 : Dynamic programming
# Week 8 : Midterm exam.
# Week 9-10 : Linear programming and reductions
# Week 11-12 : Computational intractability
# Week 13-14 : Approximation algorithms
# Week 15 : Randomized algorithms
# Week 16 : Final exam.
9. 수업운영
- 강의 및 일부 실습
- 문제해결 과제 및 프로그래밍 과제
- 이론강의
11. 장애학생에 대한 학습지원 사항
- 수강 관련: 문자 통역(청각), 교과목 보조(발달), 노트필기(전 유형) 등
- 시험 관련: 시험시간 연장(필요시 전 유형), 시험지 확대 복사(시각) 등
- 기타 추가 요청사항 발생 시 장애학생지원센터(279-2434)로 요청