Algorithms and Practice (Spring Semester, 2013)*"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"*Course Schedule & Lecture Notes |
* [March 05] Introduction to Course Course Guide, Java Programming Evironment * [March 08] Review of Necessary Mathematics Lecture Note-Mathematics * [March 12] Algorithms: Efficiency, Analysis, and Order - I Ch01-1.ppt, HW-1.ppt, SearchMain.java, FibonacciMain.java * [March 15] Algorithms: Efficiency, Analysis, and Order - II Ch01-2.ppt * [March 19] Algorithms: Efficiency, Analysis, and Order - III Ch01-3.ppt, HW-2.ppt, Complexity-Sub1, Complexity-Sub2 * [March 22] Divide-and-Conquer - I Ch02-1.ppt * [March 26] Divide-and-Conquer - II MergeSort Animation, SortMain.java * [March 29] Divide-and-Conquer - III Ch02-2.ppt, SortMain2.java * [April 02] Divide-and-Conquer - IV Ch02-3.ppt, HW-3.ppt * [April 05] Dynamic Programming - I Ch03-1.ppt, Binomial.java * [April 09] Dynamic Programming - II Floyd.java * [April 12] Dynamic Programming - III Ch03-2.ppt, HW-4.ppt * [April 16] Dynamic Programming - IV Ch03-3.ppt * [April 19] Dynamic Programming - V Ch03-4.ppt * [April 23] (No Lecture) * [April 26] *Midterm Exam.* Midterm Exam-Results * [April 30] The Greedy Approach - I Term Project Desciption, Ch04-1.ppt * [May 03] The Greedy Approach - II Ch04-2.ppt * [May 07] The Greedy Approach - III Ch04-3.ppt, Dijkstra.java * [May 10] The Greedy Approach - IV Ch04-4.ppt * [May 14] The Greedy Approach - V Ch04-5.ppt, HW-5.ppt * [May 17] (No Lecture) * [May 21] Backtracking - I Ch05-1.ppt * [May 24] Backtracking - II Ch05-2.ppt * [May 28] (No Lecture) * [May 31] Branch-and-Bound - I Ch06-1.ppt * [June 04] (강의실 변경 - B102) Branch-and-Bound - II Ch06-2.ppt, HW-6.ppt, Nqueens.java * [June 07] (강의실 변경 - B102) Branch-and-Bound - III, Hash (8.4) Ch06-3.ppt, Ch08-4.ppt * [June 11] (일단 원래 강의실) Theory of P & NP (P.367~P.392) Ch09.ppt * [June 14] (시험은 원래 강의실)*Final Exam.* Final Exam-Results * [June 18] (B102)*Term Project Presentation* Pixel_Score.pdf |
* Lecturer: Youn-Hee Han (Rm. B303, Tel: 560-1486, yhhan@kut.ac.kr:8080) * Classes: Tuesday (16:00-17:50), Friday (09:00-10:50) * Lecture Room: A203 * TA: 정용진 (e-mail) * Course Board(숙제 제출 사이트): http://el.koreatech.ac.kr:8080 * 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. |
Term Project Guide |
* 주제: Pixel 게임 알고리즘 구현 * 참고사이트: Click! * Pixel Project : Pixel |
Term Project 조 |
* 1조 : 전경진, 안형주 * 2조 : 문태민, 조봉우 * 3조 : 최고봉, 나동희 * 4조 : 김남훈, 한가영 * 5조 : 박예나, 김영표 * 6조 : 안창주, 나호석 * 7조 : 고준석, 이수완 * 8조 : 신의수, 장예은 * 9조 : 이정현, 최용백 * 10조 : 김웅태, 서인석 * 11조 : 김수겸 * 12조 : 박성훈, 김동범 * 13조 : 조민수, 김우겸 * 14조 : 이지영, 명재희 * 15조 : 서준필, 홍승우 * 16조 : 문찬호, * 17조 : 유재웅, 신윤종 * 18조 : 임길환 * 19조 : 박주형 # 조를 짜지 못하고 혼자인 경우 : 본인의 이름만 메일보내기! (mail : jyjin989@kut.ac.kr:8080 / 정용진 ) |
References |
* 주교재: 도경구 역, Foundations of Algorithms Using Java Pseudocode, 사이텍미디어 (원저자: Richard Neapolitan and Kumarss Naimipour) - 원서: Neapolitan, R. and Naimipour, K. (2004) Foundations of Algorithms using Java Pseudocode, Jones and Bartlett Publishers, Sudbury, Mass |
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'. |
Evaluation |
* Attendance (10%), Private Report(15%), Midterm exam (30%), Final exam (30%), Term Project (15%), |