Introduction to Algorithms (CSE 331)
Introduction to Algorithms (CSE 331)
Syllabus
This course provides an in-depth exploration of algorithm design and analysis techniques, emphasizing both theoretical foundations and practical applications. Students will study a range of fundamental algorithms, including divide and conquer strategies, greedy algorithms, dynamic programming, graph algorithms, and approximation algorithms. The course also introduces complexity theory topics such as NP-completeness and discusses optimization techniques.
2025S: Song Kim (Representative), Dahee Kim, Hyewon Kim
Quiz1 [statistics], Quiz2 [statistics]
Individual Assignment #1 / Best reports [1, 2, 3, 4]
Individual Assignment #2 / Best reports [1, 2, 3]
Tentative Outline for the Course
An in-depth study of fundamental algorithmic techniques and their applications. Emphasis is placed on complexity analysis, design paradigms, and graph algorithms.
Related textbook & lecture
Algorithms https://jeffe.cs.illinois.edu/teaching/algorithms/
Tech Dev Guide https://techdevguide.withgoogle.com/paths/data-structures-and-algorithms/
Data structure and algorithm analysis in Java http://people.cs.vt.edu/~shaffer/Book/
Video: Data structure and algorithm specialization https://www.coursera.org/specializations/data-structures-algorithms
Video: Coursera algorithm I https://www.coursera.org/learn/algorithms-part1
Video: Coursera algorithm II https://www.coursera.org/learn/algorithms-part2
Video: https://www.cse.cuhk.edu.hk/~taoyf/course/2100/23-spring/
C언어로 쉽게 풀어쓴 자료구조 https://www.aladin.co.kr/shop/wproduct.aspx?ItemId=183868288
With highest honor
2025S: Deokhyeon Kim