CS 325 Analysis of Algorithms
Summer 2008

 Instructor: Ron Bjarnason
Email: ronny [at] eecs oregonstate edu
 Office Hours:  MWF 1-2pm,   WF 4-5pm
 Class Time:  daily 3-4pm 1001 KEC

Course Syllabus

Required Textbook: Algorithms by Dasgupta, Papadimitriou and Vazirani
Recommended Textbook: Introduction to Algorithms by Cormen, Leiserson, Rivest and Stein


grades are posted

The Week 4 Midterm Study Guide is available. All questions on the Midterm will be pulled directly from this study guide.

The Week 6 Midterm Study Guide is available. All questions on the Midterm will be pulled directly from this study guide.

A preliminary version of the Final Study Guide is posted. All questions on the Final will be pulled directly from the Final Study Guide and the two Midterm Study Guides.


Previous CS325 Websites:

Article on mathematics and computer science

Course Calendar:


 Monday
 Tuesday
 Wednesday
 Thursday
 Friday
Week1
June 23-27
23
Syllabus
Euclid, Al Kwharizmi,
Fibonacci, Hilbert
24
Hilbert, Von Neumann,
Turing, Godel,
Towers of Hanoi,
programming in C++
25
Homework 0
hello_world.cpp
timer.cpp
loop invariants,
selection, insertion sort
26
Big O notation,
modular math
27
Homework 1
Euclid's extended algorithm,
modular division,
merge sort,
recurrence relations,
Master Theorem
Week 2
June 30-July 4
30
Euclid's extended algorithm,
modular division,
Fermat's little theorem,
primality testing,
intro to RSA
1
RSA
2
NO CLASS
3
NO CLASS
4
NO CLASS
Week 3
July 7-11
7
NO CLASS
8
NO CLASS
 Homework 2
9
Solving for closed
form of recurrence
relations
10
Solving for closed
form of recurrence
relations
11
Homework 3
Solving for closed
form of recurrence
relations
Week 4
July 14-18
14
Inductive Proofs
15
Midterm Review
Inductive Proofs
16
Midterm 1
17
Intro to Graphs,
DFS, BFS, Dijkstra's
18
Dijkstra's,
directed graphs,
pre and post visit
labels
Week 5
July 21-25
21
Homework 4
pre/post numbers,
cycles, DAG's
SCC's, Bellman-Ford
Kruskal's, Prim's
22

Bellman-Ford,
cut property,
Floyd-Warshall,
set cover
23
Homework 5
Huffman encoding,
entropy, Horn Clauses,
longest increasing
subsequence
24

DAG linearization,
lis, edit distance,
knapsack
25
Homework 6
Week 6
July 28-Aug 1
28
29

Office Hours 1-2pm, 4-5pm
30
Midterm 2
NO OFFICE HOURS
31
1
Homework 7
Week 7
Aug 4-8
4

Linear Programming,
max flow, min cut,
Simplex, bipartite matching
5
6
Homework 8
7
8
Homework 9
Week 8
Aug 11-15
11
12

Office Hours 1-2pm, 4-5pm
13
Final Exam
NO OFFICE HOURS
14
15

Chapter references refer to the Dasgupta Text unless otherwise specified.