Algorithms-01
Mon 10:00–12:00
Tue 11:00–12:00
Science Hall 24402
Algorithms
Analyze algorithm efficiency and select design techniques that fit each problem structure. Sections 01 and 02 use the same shared materials.
Materials available: Semester preview, Chapters
1–12 slide decks, and exercise sets for Chapters 1 and 2.
Sections
Sections 01 & 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-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 and 2 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
| Ch. | Topic | Slides | Exercises | Status |
|---|---|---|---|---|
| 0 | Semester Preview | PPTX | — | Open |
| 1 | Algorithms & Complexity Analysis | PPTX | Python & C Coding Lab Class PPTXQuestions DOCX | Open |
| 2 | Brute Force | Python·C PPTX | Chapter 2 Python & C Lab Python & C examples C source ZIP 30 Short Answers · 10 Algorithms PPTX30 Short Answers · 10 Algorithms DOCX | Open |
| 3 | Decrease and Conquer | PPTX | — | Open |
| 4 | Divide and Conquer | PPTX | — | Open |
| 5 | Greedy Algorithms | PPTX | — | Open |
| 6 | Dynamic Programming | PPTX | — | Open |
| 7 | Backtracking | PPTX | — | Open |
| 8 | Branch and Bound | PPTX | — | Open |
| 9 | NP-Complete Problems | PPTX | — | Open |
| 10 | Approximation Algorithms | PPTX | — | Open |
| 11 | Heuristic Algorithms | PPTX | — | Open |
| 12 | Text Algorithms | PPTX | — | 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.