Sections

Sections 01 & 02

01

Algorithms-01

Mon 10:00–12:00
Tue 11:00–12:00
Science Hall 24402

02

Algorithms-02

Mon 13:00–15:00
Tue 13:00–14:00
Science Hall 24402

Materials are shared. Check your section's university LMS board for attendance, submissions, and exam notices.

Notices

Announcements

2026-11-15

Updated Chapter 9 and final exam scope

The final exam covers Chapters 6–10. Approximation Algorithms is now Chapter 9, and Heuristic Algorithms is Chapter 10. The former NP-Complete Problems chapter is omitted from teaching and the exam. The exam will select 10 coding tasks from 15 public tasks: three tasks from each of Chapters 6–10. Problems 8-4, 9-4, 10-4 and the additional practice tasks 7-5–7-7 are outside the exam scope. Download the revised Chapter 9 PPTX and PDF from the materials below. View all 15 tasks

2026-10-18

Midterm preview: writing and submitting answers

Try five questions excerpted from the public Chapters 1–4 exercise PPTX files: two multiple-choice questions and one each of short answer, essay, and Python/C coding. Each question shows its original question number and PPTX link. Receive practice-only Gemini feedback without entering a name or student ID. This separate rehearsal does not access actual exam attempts or grades. Start the five-question preview (Korean)

2026-09-15

Chapter 2: 10 algorithm-writing questions

The 40 written questions now include 10 algorithm-writing tasks and 30 short-answer questions. Implement questions 61, 65, 69, 71, 74, 78, 79, 80, 88 and 99 in Python or C. The Korean DOCX includes solution steps; the classroom PPTX includes Python and C implementations.

2026-09-15

Chapter 2: 24 Python & C exercises

Practice loops, permutations, combinations, string matching, subsets, TSP, blackjack, knapsack, and number baseball. The lecture PPTX includes both Python and C code; runnable C examples are also available. Start chapter 2

2026-09-14

Chapter 1 Python & C coding lab

Practice searching, operation counts, logarithms, and complexity with 12 automatically checked problems. Write and run Python or C in your browser without an account or installation. After grading, use the Next Problem button when you are ready to continue. The interface is available in Korean and English. Start the coding lab

2026-09-01

Algorithms materials page opened

The shared semester preview, Chapters 1–12 slide decks, and exercise files for Chapters 1–6 are now available.

2026-09-01

Section schedules

Section 01 meets Mon 10:00–12:00 and Tue 11:00–12:00. Section 02 meets Mon 13:00–15:00 and Tue 13:00–14:00 in Science Hall 24402.

Lecture Materials

Common to Both Sections

Final exam: 10 coding problems selected from 21

Study Chapters 6–11: two core problems and one challenge in each of Chapters 6 and 7, three exam problems (8-1–8-3) in Chapter 8, and four problems each in Chapters 9–11. Problem 8-4 is optional practice and will not appear on the final exam. The exam evaluates code execution results. Chapter 6 slides cover stair climbing and maximum subarray. Chapter 7 covers subset sums and graph coloring. View all 21 problems

Ch. Topic Slides Exercises Status
0 Semester Preview PPTX PDF — Open
1 Algorithms & Complexity Analysis PPTX PDF Python & C Coding Lab Class PPTX Class PDFQuestions DOCX Open
2 Brute Force
Class lecture · original 103 slides (Korean)
Lecture PPTX Lecture PDF
Review & reference · 297 slides (Korean)
Detailed PPTX Detailed PDF
Read-aloud lecture scripts are included in the PPTX speaker notes (Korean).
Chapter 2 Python & C Lab Exercises PPTX · 100 Questions Exercises PDF · 100 Questions Open
3 Decrease and Conquer PPTX PDF Chapter 3 Python/C exercise practice 100 exercises · PPTX (Korean) 100 exercises · PDF (Korean) Open
4 Divide and Conquer PPTX PDF Chapter 4 Python/C exercise practice 100 exercises · PPTX (Korean) 100 exercises · PDF (Korean) Open
5 Greedy Algorithms Lecture PPTX · 69 slides (Korean) Lecture PDF · 69 slides (Korean) Full / supplementary PPTX · 197 slides (Korean) Full / supplementary PDF · 197 slides (Korean) Chapter 5 Python/C practice · 5 problems 100 exercises · PPTX (Korean; exam/practice exclusions marked X) 100 exercises · PDF (Korean; exam/practice exclusions marked X) Open
6 Dynamic Programming Lecture PPTX (Korean) · 39 slides PDF 2 core problems + 1 challenge Open
7 Backtracking Lecture PPTX (Korean) · 120 slides PDF 2 core problems · 4 challenges Open
8 Branch and Bound Lecture PPTX (Korean) · 142 slides PDF 3 exam problems · 1 optional exercise Open
9Approximation Algorithms Lecture PPTX (Korean) · 145 slides PDF 3 exam problems · 1 optional exercise Open
10Heuristic Algorithms Lecture PPTX (Korean) · 51 slides PDF 3 exam problems · 1 optional exercise Open
12 Text Algorithms PPTX PDF — Open

Lecture order and exam scope may be adjusted through class and LMS notices.

Contact

Course Inquiries

Email: sangdonpark@dju.kr
Subject: [Algorithms-01 or 02][Student ID] Topic
Always include your section.