Home »
Algorithms and Practice (Spring Semester, 2017 – CPA341)
Algorithms and Practice (Spring Semester, 2017 – CPA341)
“Studentteacher relationships are based on trust. Acts, which violate this trust, undermine the educational process. Your classmates and the teacher will not tolerate violations of academic integrity”
1. Course Schedule & Lecture Notes

March 07 – Algorithms: Efficiency, Analysis, and Order – I

March 13 – Algorithms: Efficiency, Analysis, and Order – II
 HW1 (Due Date & Time: 23:59, March 18, 2017)
 Practice

March 14 – Algorithms: Efficiency, Analysis, and Order – III

March 20 – Algorithms: Efficiency, Analysis, and Order – IV

March 21 – DivideandConquer – I

March 27 – DivideandConquer – II

March 28 – DivideandConquer – III

April 03 – DivideandConquer – IV

April 04 – DivideandConquer – V
 Practice
 HW3 (Due Date: April 14, 2017)

April 10 – Dynamic Programming – I

April 11 – Dynamic Programming – II

April 17 – Dynamic Programming – III

April 18 – Dynamic Programming – IV

May 09 – [대선]

May 15 – The Greedy Approach – IV

May 16 – The Greedy Approach – V

May 22 – Backtracking – I

May 23 – Backtracking – II

June 05 – BranchandBound – III, Hash

June 06 – [현충일]

June 12 – Theory of P & NP (P.367~P.392)

June 13 – Term Project Presentation

June 19 – Final Exam.
2. Course Information
 Lecturer: YounHee Han (Rm. B303, Tel: 5601486, yhhan@koreatech.ac.kr)
 Classes: Monday (16:0018:00), Tuesday (09:0011:00)
 Lecture Room: Monday – / Wednesday
 TA: 김주봉 (email: rlawnqhd@koreatech.ac.kr)
 Tutor: 정경석 (email: jks207@koreatech.ac.kr)
 Course Board(숙제 제출 사이트): http://el.koreatech.ac.kr
 Prerequisites: 자료구조, 이산수학
 Course Description: This course is about the design, analysis and use of algorithms. We will study a number of common algorithm design techniques. We will apply each technique to several problems so that we can see how to use the technique in a variety of problems and come to understand how to apply it in new situations. We will also solve some problems using several of the design techniques so that we can compare the different techniques and have a basis for selecting one over another. The algorithms that we use as examples are interesting and useful in their own right. The algorithms not only illustrate methods of design and analysis, but also solve common problems that arise in a variety of applications.
3. Term Project Guide
 주제: Pixel 게임 알고리즘 구현 및 리그전
 Pixel Project 설명: PixelTermProject_2017.ppt
 참고사이트: Click!
 Pixel Project Source Code: Pixel_2017.zip
 조 구성 원칙: 동일 지도교수님 지도하의 3인 1조 (조 구성에 어려움이 있는 사람은 개별적으로 Contact)
 4월 10일 (월요일) 까지 조를 구성하여 대표 한명이 조교(rlawnqhd@koreatech.ac.kr)에게 이메일로 알림
 제출기한: 2017년 6월 11일 일요일 오후 6시
4. Term Project 조
 1조 : 박혜림, 김택수, 이무현
 2조 : 김영재, 김용규, 김찬기
 3조 : 이석한, 백윤기, 최민호
 4조 : 김대곤, 김태훈, 이재영
 5조 : 이우원, 임동규, 황규영
 6조 : 송재혁, 김다영, 이혜지
 7조 : 전두영, 전준우, 이호원
 8조 : 서정현, 양한솔, 천세은
 9조 : 정보혁, 손재락, 김건용
 10조 : 김동준, 신현아, 김한솔
 11조 : 우정연, 강수진
 12조 : 강호민, 권혁찬
 13조 : 정세열, 유기대
 14조 : 구승회, 권기범
 15조 : 김병찬, 김통일
 16조 : 서현규, 김정희
5. Reference
 주교재: 도경구 역, Foundations of Algorithms Using Java Pseudocode, 사이텍미디어 (원저자: Richard Neapolitan and Kumarss Naimipour) Click
 원서: Neapolitan, R. and Naimipour, K. (2004) Foundations of Algorithms using Java Pseudocode, Jones and Bartlett Publishers, Sudbury, Mass
6. Logistics
 Attendance – one class absence will result in the deduction of two points out of 100 points. Five absences will not result in ten points deduction, but “failure” (i.e., grade ‘F’) in this course.
 Exam – there will be midterm exam and final exam for the evaluation of the knowledge learned from the class.
 Homework – much intensive homework will be set. Any cheating (or copying) will result in grade ‘F’.
7. Evaluation
 Attendance (10%), Private Report(15%), Midterm exam (30%), Final exam (30%), Term Project (15%)