CS 225A -- Fall 2008
Meeting Times:
Labs:
Assignments:
Assignment # |
Problems | Due Date |
1 |
p.8 #4; p.18 #4; p.24 #3; p.38 #3, 4 |
9-5-08 |
2 |
p.51 #5, 8, 9; p.60 #2, 3, 4a, 5; p.67 #1, 2, 4, 5 |
9-23-08 |
3 |
p.76 #1abcde (find the exact solution and the big-theta class), 2, 4abc, 7abcd. Also, on #7d, write and analyze an efficient algorithm for computing 2^n. |
9-29-08 |
4 |
3.1 (p.102) #2, 5, 6, 7, 8, 10; 4.1 (p.128) #1, 3, 5, 6, 7; 4.2 (p.134) #1, 3, 5, 8 |
10-9-08 |
5 |
4.3 #1, 2, 4; 5.1 #3, 4, 9; 5.5 #1, 3, 4, 5, 7, 9 |
10-24-08 |
6 |
6.3 #1, 2, 3, 4, 5, 7; 6.4 #3, 5, 6, 7 |
11-3-08 |
| sorting (labs 3 - 11) | 11-7-08 |
|
7 |
8.1 #1, 2, 3, 6, 7 8.2 #1, 2, 3, 7, 8, 9, 10 |
11-17-08 |
8 |
9.1 #1, 2, 7, 9; 9.2 #1, 2; 11.1 #3, 7, 11; 11.2 #2, 3, 4, 9; 11.3 #10 | 12-5-08 |