AlgorithmsCourse Schedule & Lecture Notes |
* [April 29] What is Algorithm? & Importance of Efficient Algorithms Lecture Node 1.ppt, Search.java, SearchSolution.java * [May 1] Algorithm Complexity Lecture Node 2.ppt, Fibonacci.java, FibonacciSolution.java * [March 6] Algorithm Design Strategy 1 – Divide & Conquer Lecture Node 3.ppt, Sort.java, SortSolution.java, Merge-Sort Animation * [March 8] Algorithm Design Strategy 2 – Dynamic Programming Lecture Node 4.ppt, Floyd.java, FloydSolution.java * [March 13] Algorithm Design Strategy 3 – Greedy Approach Lecture Node 5.ppt, Dijkstra.java, DijkstraSolution.java * [March 15] Algorithm Design Strategy 4 – Backtracking Lecture Node 6.ppt, Nqueens.java, NqueensSolution.java |
Course Information |
* Lecturer: Youn-Hee Han (Rm. 4th Engineering Building, B303, Tel: 560-1486, yhhan@koreatech.ac.kr) * Classes: April 29, May 1, 6, 8, 13, 15 (09:00-11:50) * 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. |