CS800 Page for Sidney Marshall

Home page for Sidney Marshall

Midterm Exam on Thursday, October 6th
Final Exam TBA

Syllabus: Syllabus.pdf, Syllabus.ps, Syllabus.doc, SyllabusNotes.pdf, SyllabusNotes.ps, SyllabusNotes.doc
 
 
Homework assignments
All homework is due at the start of class
Due Date
Homework1.pdf, Homework1.ps, Homework1.doc (homework1 is now due Thursday, at the beginning of class) Thursday, September 15
Do CLRS problems:
6-2 on page 143
7.2-5 on page 153
7-1 on page 159-160
Thursday, September 22
Homework 3
Problem 15.3-3 on page 349 in CLRS
Problem 15-2 on page 364 in CLRS
Problem 15-6 on page 368 in CLRS
Tuesday, October 4
Homework 4
Problem 12.2-4 on page 260 in CLRS
Problem 12.3-4 on page 264 in CLRS
Problem 12-2 on page 269-270 in CLRS
Tuesday, October 11
Homework 5
Problem 22.1-3 on page 530 of CLRS
Problem 22.2-8 on page 539 of CLRS
Problem 22.3-1 on page 547 of CLRS
Thursday, October 20
Homework 6
Problem 23.2-8 on page 574 of CLRS
Problem 24-3 on page 615 of CLRS (You may incorporate by reference any algorithm in CLRS)
Problem 26-1 on page 692 of CLRS
Thursday, October 27
Homework 7
Do any ONE of the following problems:
Problem 34.5-1 on page 1017 of CLRS
Problem 34.5-2 on page 1017 of CLRS
Problem 34.5-3 on page 1017 of CLRS
Problem 34.5-5 on page 1017 of CLRS
Problem 34.5-7 on page 1017 of CLRS
Problem 34.5-8 on page 1018 of CLRS
I want a clear proof with both parts (in NP and reducible to another known NP complete problem).
Thursday, November 3

Project

The project information is here. If you choose to work on a team you must form the team by September 29th. Source code with some time measurements for at least one algorithm are due October 13th. Final project is due November 8th.


Week 1: Analyzing Algorithms
Read chapters 1-4 in CLRS 
.pdf .ps source
Analysis.pdf
AnalysisNotes.pdf
Analysis.ps
AnalysisNotes.ps
Analysis.doc
AnalysisNotes.doc


Week 2: Heapsort and Quicksort
Read chapters 6-7 in CLRS
.pdf .ps source
Heaps.pdf
HeapsNotes.pdf
Heaps.ps
HeapsNotes.ps
Heaps.doc
HeapsNotes.doc
Quicksort.pdf
QuicksortNotes.pdf
Quicksort.ps
QuicksortNotes.ps
Quicksort.doc
QuicksortNotes.doc


Week 3: Dynamic Programming and Greedy Algorithms
Read chapters 15-17 in CLRS
.pdf .ps source
DynamicProgramming.pdf
DynamicProgrammingNotes.pdf
DynamicProgramming.ps
DynamicProgrammingNotes.ps
DynamicProgramming.doc
DynamicProgrammingNotes.doc


Week 4:  Red-black trees and Augmenting Algorithms
Read chapters 10-14 in CLRS - we will concentrate on 13 and 14
.pdf .ps source
ListsTrees.pdf
ListsTreesNotes.pdf
ListsTrees.ps
ListsTreesNotes.ps
ListsTrees.doc
ListsTreesNotes.doc
Red Black Tree Notes by Thomas A. Anastasio Anastasio-Red-Black-Trees-1.pdf
Anastasio-Red-Black-Trees-1-Notes.pdf
Anastasio-Red-Black-Trees-2.pdf
Anastasio-Red-Black-Trees-2-Notes.pdf
Anastasio-Red-Black-Trees-3.pdf
Anastasio-Red-Black-Trees-3-Notes.pdf
Anastasio-Red-Black-Trees-4.pdf
Anastasio-Red-Black-Trees-4-Notes.pdf
Anastasio-Red-Black-Trees-1.ps
Anastasio-Red-Black-Trees-1-Notes.ps
Anastasio-Red-Black-Trees-2.ps
Anastasio-Red-Black-Trees-2-Notes.ps
Anastasio-Red-Black-Trees-3.ps
Anastasio-Red-Black-Trees-3-Notes.ps
Anastasio-Red-Black-Trees-4.ps
Anastasio-Red-Black-Trees-4-Notes.ps
Anastasio-Red-Black-Trees-1.ppt
Anastasio-Red-Black-Trees-2.ppt
Anastasio-Red-Black-Trees-3.ppt
Anastasio-Red-Black-Trees-4.ppt
Amortised Analysis by Barry L. Kurtz Kurtz-amortized_combined.pdf
Kurtz-amortized_combinedNotes.pdf
Kurtz-amortized_combined.ps
Kurtz-amortized_combinedNotes.ps
Kurtz-amortized_combined.ppt
Garbage Collection by Paul Wilson gcsurvey.pdf
bigsurv.pdf
gcsurvey.ps
bigsurv.ps


Week 5:
.pdf .ps source


Week 6:
.pdf .ps source


Week 7:
.pdf .ps source


Week 8:
.pdf .ps source


Week 9:
.pdf .ps source


Week 10:
.pdf .ps source


8/18/05