CECS 528 Weekly Homework and Group Assignments

Note: all starred (*) exercises represent practice problems for a particular core learning outcome. All other assigned exercises are considered "peripheral", and whose understanding may be assessed on an exam. Also, the range of exercises (a-b)* means that all exercises from a to b are core exercises.

• Exercise Set 1: Recurrences Lecture: Exercises 1,2, (3-8)*, 9, 10, (11,13,15)* Assessments LO1, Exam 1
• Homework 1 (Due February 3rd)
• Exercise Set 2: Divide-and-Conquer Lecture: Exercises: 1*, 2-5, (6-7)*, 8-14, 15*, 16-19, (21-26)*, 27,28 Assessments LO2, Exam 1
• Homework 2 (Due February 10th)
• Exercise Set 3: Introduction to Greedy Algorithms Lecture: Exercises: 2*, 3*, 5, 6*, 7,8,9, Graph Greedy Algorithms Lecture: 1-3, 4*, (5-7)*, 8,9, 10*, 11 Assessments LO3, Exam 1
• Homework 3 (Due February 17th)
• Exercise Set 4: Dynamic Programming Lecture: Exercises 1,2,3*,4,(5-10)*, 11, 12, (13-15)*, 21*, 22*, 23, 24, 25*, 26* Assessments LO4, Exam 1
• Homework 4 (Due March 6th)
• Exercise Set 5: Turing Reducibility Lecture: 1-5, 7, (8-14)*, 15-18, Assessments: LO5, Exam 2
• Exercise Set 6: Mapping Reducibility Lecture: Exercises (1-8)*,9, (10-13)*,(20-21)* Assessments: LO6, Exam 2
• Exercise Set 7: Complexity Lecture: Exercises (1-9)* Assessments: LO7, Exam 2
• Homework 5 (Due March 21st)
• Exercise Set 8: Complexity Theory Lecture: Exercises (9-17)*, 18-23, Mapping Reducibility Lecture: Exercises (14-19)* Assessments: LO8, Exam 2
• Homework 6 (Due April 19th)
• Exercise Set 10: Randomized Algorithms Lecture: Exercises 1, (2-9)* Assessments: LO10, Final Exam
• Homework 7 (Due May 8th)