Repository Guide | English | 한국어
Last Updated: 2026-11-16
| Item | Description | Documents |
|---|---|---|
| Exam_Midterm | Preparation materials for the week 8 midterm exam (written, one hour, weeks 1-6). They include a review that combines the week 1-6 lectures with the week 7 review, its detailed edition, an exam summary sheet, and a comprehensive review that covers the whole range like a textbook | Review, Detailed review, Summary sheet, Comprehensive review |
| HW01_Algorithm-Design-and-Complexity-Analysis | Week 2 assignment. Implement three searches of different time complexity (ID lookup O(1), name search O(n), duplicate detection O(n²)) in a mini shopping mall web app that searches 1,000+ products, and compare their response times for 10, 30, and 50 concurrent users with Locust load tests. It connects to week 2 (Algorithm Design and Complexity Analysis) | Assignment handout, Assignment explanation, Code walkthrough, Code |
| HW02_Arrays-Stacks-Queues-and-Basic-Sorting-Algorithms | Week 3 assignment. Implement sorting algorithms, including selection, insertion, and merge sort, in a music playlist manager web app that sorts songs by title, artist, duration, or play count, and compare their comparisons, swaps, and execution times for N = 100, 1000, 5000. It connects to week 3 (Arrays, Stacks, Queues, and Basic Sorting Algorithms) | Assignment handout, Assignment explanation, Code walkthrough, Code |
| HW03_Divide-and-Conquer-Algorithms | Week 4 assignment. Build a web app that finds the closest pair among random 2D points by brute force (O(n²)) and by divide and conquer (O(n log² n)), visualizes it on a canvas, and compares the execution times and the speedup ratio of the two methods. It connects to week 4 (Divide and Conquer Algorithms) | Assignment handout, Assignment explanation, Code walkthrough, Code |
| HW04_Greedy-Algorithms | Week 5 assignment. Build a classroom reservation system web app that uses the greedy activity selection algorithm to schedule the maximum number of non-overlapping reservations in one room and shows a timeline and a step-by-step trace of the selection. It connects to week 5 (Greedy Algorithms) | Assignment handout, Assignment explanation, Code walkthrough, Code |
| HW05_Dynamic-Programming | Week 6 assignment. Build a plagiarism checker web app that compares two documents with the LCS (Longest Common Subsequence) algorithm and shows the similarity score, the LCS length and string, and a colored diff. It connects to week 6 (Dynamic Programming) | Assignment handout, Assignment explanation, Code walkthrough, Code |
| Lab01_Introduction-to-Algorithms | Demonstration code distributed with the week 1 lab materials. Python code for binary search (iterative and recursive implementations) and greedy coin change that runs the binary search and coin change examples of the Week 1 Lecture | Lab explanation, Binary-Search.py, Coin-Change.py |
| Project_LLM-Web-Application | The team-based term project of weeks 9-13, graded as the term project part of the final exam. Team CLI built a web-based LLM application that uses Upstage Solar Pro 3 to rewrite administrative documents into plain Korean, applying the CLRS algorithm concepts from the course, and the code is linked from the CLI_AL repository as a git submodule |
CLI_AL |