• This assignment is not for credit; these are just questions to help you study for the final
• All questions marked DPV are from the course text; the numbers here are from the paper version.
• Questions marked CLRS are from the third edition of Corment et al.

Questions

• DPV 9.4
• Write a backtracking algorithm for independent set. How does the maximum degree change the performance of your algorithm, if at all?
• CLRS 27.1-2
• CLRS 27.1-6
• CLRS 27.2-3