
Date 
Topic 
Required Reading – parts in () are optional 
Assignment Due –
Homework is from the text unless otherwise stated. Homework is due at the beginning
of class on the assigned day.
Points (out of 10) are shown in parenthesis after each problem. 

1 
Sep 2 




2 
Sep 4 
Complexity and
BigO 
Ch 0, 1.1 
Install Visual
Studio (see link) and get started on Project
#1 

3 
Sep 9 
Ch 1.21.3 


4 
Sep 11 
Ch 1.41.5 
HW#2: 1.7
(3), 1.25 (3), solve 2^{21} mod 18 using the modexp
algorithm of fig 1.4 (4). Show a
table with all variable values at each call level. 


5 
Sep 16 
Ch 2.12.2 
HW#3: 1.18 (3),
1.20 (4) (just the last 3), 1.27 (3) Project #1 Fermat
Primality Tester Due 11:59pm Sep 16 


6 
Sep 18 
Recurrent
relations notes Part 12 and read project #2 
HW#4: 2.1 (5) (but just multiply the integers 1001 and
1011, also 0 pad numbers whose lengths are not a power of 2), 2.5(ae) only
find bounds using the master theorem (5), Start project #2!! 


7 
Sep 23 
More Recurrence Relations, Change of Variables 
HW#5: 2.4(3), 2.17(4), RR Notes Sec 1.3 problem 1(3) Keep going on
project #2!! 


8 
Sep 25 
Finish RRs, Mergesort,
Quicksort, Median 
Ch 2.32.5, (2.6) 
HW#6: RR Notes Sec
1.3 problem , 2(2), 3(2), 4(3), Sec 2.2:1(3) You may use any
linear equation solver if you wish to find the unknowns 

9 
Sep 30 
Ch 3.1, 3.2 
HW#7:
RR Notes, 3.2:1(5), Use recurrence relation solution techniques (not master
theorem) to give the exact complexity of 3 way mergesort,
assume T(1)=1 (5 pts) 


10 
Oct 2 
Graph Connectedness 
Ch 3.33.4 
HW#8: 3.1(4), 3.2(6) Project #2
Divide & Conquer  Convex Hull
Due 11:59pm, Oct 4 

11 
Oct 7 
Ch 4.14.5 
HW #9: 3.3b,d(4), 3.4(6) 


12 
Oct 9 
Graph Paths  Dijkstra’s Algorithm – finished 
Ch 4.64.7 
HW#10: 4.1(10) 

13 
Oct 14 
Ch 5.1 
HW#11: 4.2(10) For consistency, use
distances from the previous column 


14 
Oct 16 
Greedy Algorithms:
Huffman Coding 
5.2 (5.35.4) 
HW#12: 5.2(10) (for
b do not use path compression, and if there is a tie in rank when doing
union, make the first alphabetical node the root) Start Group TSP Comparison Project group
project  Teams 

15 
Oct 21 
** MidTerm **,
no class 

Testing center
10/2010/22, Includes all material up to and including chapter 5, Closed book, 1 page of notes (singled
sided and reasonable font) can be brought to the test 

16 
Oct 23 
Ch 6.16.3 
HW#13: 5.13(5), 5.14(5) Project
#3 Graph Paths: Network Routing Due
11:59pm, Oct. 25 


17 
Oct 28 
Dynamic Programming
2 Review, Midterm
review 
Ch 6.46.5 
HW#14: 6.1(10) 

18 
Oct 30 
Dynamic Programming
3 
Ch 6.66.7 
HW#15: Gene and Knapsack HW 

19 
Nov 4 
Ch 7.17.3 


20 
Nov 6 
Linear Programming 2 
Ch 7.47.7 
HW#17: 7.1(5),
7.3(5) 

21 
Nov 11 
Ch 9.1 
HW#18: Linear Programming and Simplex Extra notes from Computer Algorithms by E. Horowitz, S.
Sahni and S. Rajasekaran 


22 
Nov 13 
Intelligent Search: B&B cont. 

HW#19: B&B TSP 1 Project #4
Gene Sequence Alignment Due
11:59pm, Nov. 15 

23 
Nov 18 
Ch 8.18.2, (8.3) Ch 5.4 
HW#20: B&B TSP 2 


24 
Nov 20 
Ch 9.29.3 
HW 21: A* 



Nov 25 
No class (Friday Instruction) 




Nov 27 
No class (Thanksgiving) 



25 
Dec 2 
Approximation: Neural Networks Why Graduate School 

HW#22: Local
Search Project #5 Solving
TSP w/ Branch & Bound Due
11:59pm, Dec 1 

26 
Dec 4 




27 
Dec 9 
Randomized Algorithms: pdf Which
Algorithm to Use Review 
Boxes on pages 29, 53, 56, 140 of text (pp 39, 63, 66, 150
of online text) 


28 
Dec 11 
Comparison Project Presentations 

Group
TSP Comparison Project Hand in
a hardcopy at the beginning of class on the last day of class. By University policy, no work can be
accepted after the last day of class. 



*** Final (Sec 1: Tuesday, Dec. 16,
7:00am10:00am in class) *** *** Final (Sec 2: Tuesday, Dec. 16, 2:30pm5:30pm in
class) *** Closed book, one page of notes (single sided and
reasonable font) can be brought to the test Comprehensive, but with strong emphasis on second half of
the semester, Study
Guide 
