Algorithms-01
Mon 10:00–12:00
Tue 11:00–12:00
Science Hall 24402
Analyze algorithm efficiency and select design techniques that fit each problem structure. Sections 01 and 02 use the same shared materials.
Sections 01 & 02
Mon 10:00–12:00
Tue 11:00–12:00
Science Hall 24402
Mon 13:00–15:00
Tue 13:00–14:00
Science Hall 24402
Announcements
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
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)
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.
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
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
The shared semester preview, Chapters 1–12 slide decks, and exercise files for Chapters 1–6 are now available.
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.
Common to Both Sections
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
Lecture order and exam scope may be adjusted through class and LMS notices.
Course Inquiries
Email: sangdonpark@dju.kr
Subject:
[Algorithms-01 or 02][Student ID] Topic
Always include your section.