Suggested Problems
p 108: 13
p 110: 14, 17, 25, 34, 35, 43. 49. 57
Collected Problems (Due Monday 21 Apr)
p 110: 36
Pack the items 2, 3, 2, 3, 5, 2, 6, 4, 2, 3, 2 into bins of size 7 using
all 8 algorithms (FF, NF, BF, WF, FFD, NFD, BFD, WFD). What would the
optimal number of bins be and why?
Week 13 (7–11 Apr)
Relevant Problems
p 61: 18--20
p 64: 68--75
p 108: 1--8
p 110: 1--41
Suggested Problems
p 64: 71
p 110: 4, 7, 9, 10, 14, 16, 15, 25, 34, 35, 36
Collected Problems (Due Monday 14 Apr)
p 64: 68
p 110: 4, 34
Week 12 (31 Mar–4 Apr)
Relevant Problems
p 61: 13--17
p 64: 48--67
Suggested Problems
p 64: 44, 46, 48, 51
Collected Problems (Due Monday 7 Apr)
p 64: 40, 54
Week 11 (24–28 Mar)
Relevant Problems
p 22: 10, 12--18, 20
p 25: 31, 34--57
p 61: 1--12
p 64: 1--47
Suggested Problems
p 22: 14, 18
p 25: 36, 41, 43
p 64: 5, 17, 27, 35
Collected Problems (Due Monday 31 Mar) Connected Graphs
p 25: 36 a,b,c
p 64: 3 (give circuit if possible)
Week 10 (17–21 Mar)
Relevant Problems
p 22: 1--9, 11
p 25: 1--30
Suggested Problems
p 22: 2, 9
p 25: 1, 3, 8, 25
Collected Problems (Due Monday 24 Mar)
p 25: 24
Week 9 (3–7 Mar)
Relevant Problems
p 290: 36--40, 42--49, 52, 53 handout: 5--10