Algorithms
1
 Textbook:
Richard E. Neapolitan,
Foundations of Algorithms,
Jones and Bartlett, 2014
Algorithms
2
 Textbook
Algorithms
3
 OR… you may use its older
version w/ lower cost
Algorithms
4
 OR… you may use its another
older version w/ lower cost
Algorithms
5
 Recommend book
Algorithms
6
 Instructor:
Name: Yong-Hyuk Kim
Location: Sae-Bit B/D 605
Tel: 02) 940-5212
Email: yhdfly@kw.ac.kr
Office Hours:
Mon/Wed: 2:00 ~ 3:00 p.m.
Sae-Bit B/D 605
Algorithms
7
 Student Comments at Previous
Lectures
 Click here
Algorithms
8
 Anonymous bulletin board
 “강의 학습톡톡“ in KLAS
Algorithms
9
 Grading:
Mid-Term Exam
: 30%
Final Exam
: 30%
Quiz (every week)
: 10%
Assignments (3 times) : 20%
Attendance
: 10%
Prerequisite:
C/C++/Java Programming
Data Structures
Related Lecture:
Discrete Mathematics
Algorithms
10
 Contents:
Big O, Small o, Omega Ω Notation
Computation of Complexity
Divide and Conquer
Dynamic Programming
Greedy Approach
Backtracking
Branch and Bound
Computational Complexity
Intractability (theory of NP)
Number-theoretic Algorithms
Algorithms
11
 You should:
- read the book or class materials before
you come to the class
- do your homework assignments by
yourself
Algorithms
12
Reading Assignment
- read sample chapters of an auxiliary
textbook (PS_Sample_chapters.pdf) in
this week