알고리즘

강의상세

컴퓨터를 이용한 문제 해결 방법에 대해 이해하고, 효과적인 방법들의 예를 살펴보며, 실제로 주어지는 문제를 적용하는데 활용할 수 있다.

Introduction

1.	Introduction	What is Algorithm?
	Fundamentals of Algorithm	Algorithm, The first algorithm, representation of algorithm, categories of algorithms, Efficiency of algorithm, Asymptotic notation of efficiency
2.	Divide and Conquer	Divide and Conquer : Idea, Merging sort
	Divide and Conquer	QuickSort, Selection
3.	Greedy Algorithm 1	Strategy Algorithms, Coin change, minimum spanning tree
	Greedy Algorithm 1	minimum spanning tree, Searching shortest path
4.	Greedy Algorithm 2	Searching shortest path, Fractional Knapsack problem, Set covering
	Greedy Algorithm 2	Set covering, Task scheduling, Huffman coding
5.	Dynamic Programming 1	Searching all pairs of shortest paths
	Dynamic Programming 1	Chained Matrix multiplications
6.	Dynamic Programming 2	Edit Distance, Knapsack problem(not fractional)
	Dynamic Programming 2	Edit Distance, Knapsack problem(not fractional)
7.	Approximation Algorithm	Alternative strategy for complex problems, Traveling salesman problem, Vertex covering
	Approximation Algorithm	Vertex covering, Bin Packing, Task Scheduling, Clustering
8.	Search Algorithm 1	about Search algorithm, Backtracking for TSP
	Search Algorithm 1	Branch-and-Bound, Simulated Annealing
9.	Search Algorithm 2	Genetic Algorithm
	Search Algorithm 2	Genetic Algorithm
10.	NP-Completeness	Analysis of Problem Complexity
	NP-Completeness	Analysis of Problem Complexity