Calendar

The following schedule may change without notice

Session Date Section Topic Practice Problems
1 Feb 1 3.1 Algorithms p 202: 3-27 odd
2 Feb 3
3 Feb 8 3.2 The growth of functions p 216: 1-27 odd, 34-42 all
4 Feb 10
5 Feb 17 3.3 Complexity of algorithms p 229: 1-5 all
6 Feb 22
7 Feb 24
8 Feb 29 EXAM 1
9 Mar 2 11.2 Applications of trees p 769: 1-7 odd, 11, 19, 21, 22, 37
10 Mar 7
11 Mar 9 11.4 Spanning trees p 795: 2-6 all, 13-15 all, 16, 27, 28, 30
12 Mar 14
13 Mar 16 11.5 Minimum spanning trees p 802: 1, 2, 3, 6, 7
14 Mar 21
15 Mar 28 EXAM 2
16 Mar 30 8.1 Applications of recurrence relations p 510: 13, 16, 28, 31, 33
17 Apr 4
18 Apr 6 8.2 Solving linear recurrence relations p 524: 1, 3, 11, 17, 23, 25, 27
19 Apr 11
20 Apr 13 8.3 Divide and conquer algorithms and recurrence relations p 535:1-21 odd
21 Apr 18
22 Apr 20 8.4 Generating functions p 549: 1-11 odd
23 May 2
24 May 4 EXAM 3
25 May 9 5.3 Recursive definitions and structural induction p 357: 1, 3, 5, 7, 30, 33-35 all, 43, 44, MATLAB definition of Ackerman's function, 48, 51, 60, 61
26 May 11
27 May 16 5.4 Recursive Algorithms p 370: 1-5 odd, 7-10 all, 15, 16, 29, 30, 37, 46, 50-52 all
28 May 18
29 May 23 REVIEW
30 May 25 FINAL EXAM

1 Response to Calendar

  1. Eric says:

    Dear Prof. Poirier,

    Will 5.3 and 5.4 be on the final?
    If it is, if I post the homework listed above for 5.3 and 5.4 before Tuesday, will you be able to give me feedback on it?

    Thank You,
    Eric Lewis

Leave a Reply

Your email address will not be published. Required fields are marked *