2. Instructor Information
|
Name |
Lee Wonyeol |
Department |
Dept. of Computer Science & Eng. |
| Email address |
leewy@postech.ac.kr
|
Homepage |
https://www.fpc-lab.com/ |
| Office |
프로그래밍/계산 원리 연구실 |
Office Phone |
054-279-2255 |
| Office Hours |
Monday, 11am--12pm & 1pm--2pm (PIAI #335)
|
3. Course Objectives
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 correct and efficient algorithms for the resulting problems. The course starts with an introduction to algorithms. We then study five essential algorithm design techniques: divide-and-conquer algorithms, greedy algorithms, dynamic programming, linear programming, and graph algorithms. We will also spend a few weeks on computational intractability as well as advanced algorithms (e.g., approximation, streaming, and continuous algorithms).
4. Prerequisites & require
CSED101: Programming and Problem Solving
CSED233: Data Structures
5. Grading
| Midterm Exam |
Final Exam |
Attendance |
Assignment |
Project |
Presentation/Discussion |
Laboratory/Practice |
Quiz |
Others |
Total |
|
|
|
|
|
|
|
|
|
|
| 비고 |
Attendance: 0% (Fail if you miss >=8 classes)
Homework: 10% (~6 written assignments; having discussion with friends, AI, etc. is allowed)
Midterm Exam: 45%
Final Exam: 45%
|
6. Course Materials
| Title |
Author |
Publisher |
Publication
Year/Edition |
ISBN |
7. Course References
Algorithms / Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani / McGraw-Hill / ISBN 9780071259750
Algorithms / Jeff Erickson / PDF version available at http://algorithms.wtf / ISBN 9781792644832
Algorithm Design / Jon Kleinberg, Éva Tardos / Addison Wesley / ISBN 9780321295354
8. Course Plan
Week 1: Computational Efficiency
Week 2-3: Divide-and-Conquer Algorithms
Week 4-5: Graph Algorithms---Basics
Week 5-7: Graph Algorithms---Shortest Paths
(Week 6: No Class due to Chuseok)
Week 8: Midterm Exam (10/22 Wed, 9:00am--10:45am)
-------------------------------
Week 9-10: Greedy Algorithms
Week 10-11: Dynamic Programming
Week 12-13: Linear Programming
Week 13-14: NP-Complete Problems
Week 15: Advanced Topics (TBD)
Week 16: Final Exam (12/17 Wed, 9:00am--10:45am)
9. Course Operation
이론 강의
문제해결 과제
10. How to Teach & Remark
11. Supports for Students with a Disability
- Taking Course: interpreting services (for hearing impairment), Mobility and preferential seating assistances (for developmental disability), Note taking(for all kinds of disabilities) and etc.
- Taking Exam: Extended exam period (for all kinds of disabilities, if needed), Magnified exam papers (for sight disability), and etc.
- Please contact Center for Students with Disabilities (279-2434) for additional assistance