Algorithms and Practice (Spring Semester, 2018 – CPA341)

“Student-teacher relationships are based on trust. Acts, which violate this trust, undermine the educational process. Your classmates and the instructor will not tolerate violations of academic integrity”

1. Course Schedule & Lecture Notes

  • April 30 – The Greedy Approach – I
  • May 03 – The Greedy Approach – II

  • May 07 – 어린이날 (대체휴일)
  • May 10 – The Greedy Approach – III
  • May 14 – The Greedy Approach – IV
  • May 17 – The Greedy Approach – V
  • May 21 – Backtracking – I
  • May 24 – Backtracking – II

  • May 28 – Backtracking – III

  • May 31 – Branch-and-Bound – I

  • June 04 – Branch-and-Bound – II
  • June 07 – Branch-and-Bound – III & Hash
  • June 11 – Theory of P & NP (P.367~P.392)
  • June 14 – Term Project Presentation
  • June 18 – 기말 고사

2. Course Information

  • Lecturer: Youn-Hee Han (Rm. B303, Tel: 560-1486, yhhan@kut.ac.kr)
  • Classes: Monday (09:00-11:00), Thursday (09:00-11:00)
  • Lecture Room: Monday – 314호 / Thursday – 249호
  • 수업조교(TA): 권도형 석사과정 (e-mail: 523039hdk@gmail.com)
  • 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

  • 주제:
  • 조 구성 원칙: 동일 지도교수님 지도하의 2인 1조 (조 구성에 어려움이 있는 사람은 개별적으로 Contact)
    • 4월 11일 (수요일) 까지 조를 구성하여 대표 한명이 조교(523039hdk@gmail.com)에게 이메일로 알림
  • 제출기한: 2018년 6월 13일 수요일

4. Term Project 조

  • 1조 : 신우진, 박성준
  • 2조 : 김경민, 고종민
  • 3조 : 권수빈, 윤지은
  • 4조 : 강승호, 장진우
  • 5조 : 박건호, 서명원
  • 6조 : 김재헌, 이재홍
  • 7조 : 나정기, 김선호
  • 8조 : 정준욱, 임건웅
  • 9조 : 임찬규, 정현석
  • 10조 : 임희성, 이윤수
  • 11조 : 정우진, 정태윤
  • 12조 : 이찬솔, 이연경
  • 13조 : 김휘동, 차승훈
  • 14조 : 김재경, 김주완
  • 15조 : 노승현, 조성우
  • 16조 : 배민천, 정훈영
  • 17조 : 박윤택, 최문혁
  • 18조 : 김쾌남, 김성찬
  • 19조 : 김지현, 김소영
  • 20조 : 김성호, 곽해웅
  • 21조 : 이지영, 이아름, 신현우

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%)