CECS 329 Weekly Homework 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: Turing and Mapping Reducibility Lecture: Exercises 1,2,(3-8)*, 9,(10-13)* Assessments: LO1, Exam 1
• Homework 2: Complexity Lecture: Exercises (1-8)* Assessments: LO2, Exam 1
• Homework 3-4: Complexity Lecture: Exercises (9-17)*, 18-24 Map Reducibility Lecture: Exercises: (14-19)* Assessments: LO3, Exam 1
• Homework 5: Computability Lecture: Exercises (1-3)*, 4-6 Assessments: LO5, Exam 2
• Homework 6: Computability Lecture: Exercises 7, (8-11)*, 12, 13, 14* Assessments: LO6, Exam 2
• Writing Assignment 1
• Homework 7: Undecidability and the Diagonalization Method Lecture: Exercises 1*,2*,3,4 Assessments: LO7, Exam 2
• Homework 8: Self Referencing Programs Lecture: Exercises 1, (2-8)* Assessments: LO8, Exam 2
• Homework 9: Finite Automata Lecture: (1-10)*, 11, 12, Assessments: LO9, Final Exam
• Homework 10: Finite Automata Lecture: (13-16)*, 17, 18*, 19*, 20-27 Assessments: LO10, Final Exam
• Writing Assignment 2
• Homework 11: Finite Automata Lecture: Exercise 28*, Assessments: LO11, Final Exam
• Homework 12: CFL Lecture: Exercises 1 and 2, Assessments: LO12, Final Exam
• Writing Assignment 3