All homeworks should be turned in electronically to myCourses.
Homeworks are due by 10pm on the due date.
Unless otherwise noted, all assignments are from the textbook,
CLRS3.
p.60: 3.2-8 (prove), Problem 3-3 (Prove or justify each step of your ranking!
You may use the properties mentioned in the chapter, including Stirling's equation.)
(For all programming exercises, demonstrate your code running on
sample input. You may want to attach your code separately from the rest of
your assignment.)
p.236: 10.1-5
p.241: 10.2-6: also implement Intersection (only elements that are in both sets), as efficiently as you can
p.406-412: Choose one of: 15-5, 15-6, 15-7, 15-8, 15-10, 15-12.
Code your own implementation to solve the problem using bottom-up dynamic programming,
and demonstrate your code running on sample input.
User interface is your choice and can be rudimentary.