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.
-
Homework 1: Algorithms for Integers Lecture: (1-4)*, 5, 6*, 7*, 8, (9-14)*, 15, (16-20)*, 21,22 Assessments: LO1, Exam 1
-
Homework 2: Recurrences Lecture: Exercises 1,2, (3-8)*, 9, 10, (11-13)* Assessments LO2, Exam 1
-
Homework 3: Divide and Conquer Lecture: Exercises 1*, 2-5, (6-8)*, 9-23, (24-29)* Assessments LO3, Exam 1
-
Homework 4: Fast Fourier Transform Lecture: Exercises 1, 2*, 3*, 4-8, (11-14)*, (17-22)*, Assessments LO4, Exam 2
-
Homework 5: Greedy Algorithms Overview lecture: Exercises 1*,2-9 Greedy Graph Algorithms: Exercises 1-3, (4-7)*, 10*, 11 Assessments LO5, Exam 2
-
Homework 6: Greedy Graph Algorithms Lecture: Exercises 8,9, (12-16)* Assessments LO6, Exam 2
-
Homework 7: Dynamic Programming Lecture: Exercises 1,2, (3-10)*, 11, 12, (13-15)*, 20, 21*, 22*, 24,25,26* Assessments LO7, Exam 2
-
Homework 8: Turing Reducibility Lecture: Exercises 1-7, (8-16)*, 17-21 Assessments LO8, Final Exam
-
Algorithm Writing Assignment
-
Homework 9: Mapping Reducibility Lecture: Exercises (3-8)*, 9, (10-13)* Assessments: LO9, Final Exam
-
Homework 10: Complexity Lecture: Exercises (1-9)* Assessments: LO10, Final Exam
-
Homework 11: Complexity Lecture: Exercises (10-15)*, Mapping Reducibility Lecture: Exercises (14-19)* Assessments: LO11, Final Exam