Homework 7 is available here, It is due May 1 (May 5 for internet students).
More lecture notes: shortest paths and the Bellman-Ford algorithm .
Also see the Network Flows and Matching Definitions and the Ford-Fulkerson algorithm.
The final exam is on Thursday, May 15, 7:30PM-9:30, in SB 104. The exam will cover the material from the second part of the semester (graphs, minimum spanning trees, shortest paths, network flows). Material covered before the midterm may also appear if it relates to graphs (certain graph algorithms use data structures or dynammic programming, for examples).
The extra set of problems which might appear on the final is here.
I encourage you to complete the evaluations before Sunday May 11.
Solutions for Homework 4 are here.
Solutions for Homework 5 are here.
Solutions for Homework 6 are here.
Below are lecture notes I used. Keep in mind we studied more than what appears in the notes on this web page.
Some notes for the first lecture are available: reccurence relations, and merge procedure of merge-sort.
Homework 1 is available here, It is due January 31.
Homework 2 is available here, It is due February 14.
Some notes from the second lecture are available:
Heaps, Heapsort,
the Quicksort Analysis, and
the Selection Algorithm
In the third lecture I used the following notes on
Binary Search Trees
and
Rotations in Binary Search Trees
Homework 3 is available here,
It is due February 28.
For splay trees, this review might help.
On February 28, besides the splay tree, we used the
union-find data structure .
Solutions to Homework 1
are available in PDF here.
Homework 4 is available here,
It is due March 27, same day as the midterm.
Below are some lecture notes:
dynamic programming part 1 ,
dynamic programming part 2 ,
dynamic programming part 3 ,
dynamic programming part 4 .
Solutions to Homework 2
are available in PDF here.
Solutions to Homework 3
are available in PDF here.
A reminder: midterm is on March 27, in class.
The midterm is closed books and closed notes,
except for those notes which will come together with the exam.
The extra set of problems which might appear on the midterm
is available in PDF here,
Please let us know if you have any trouble downloading,
displaying, or printing
anything on the course web site!
Midterm grades are on blackboard. To give you an estimate, there were
7 grades in the 50s, 17 in the 60s, 7 in the 70s and 5 were 80 or more, with
the highest being 85.
Homework 5, updated version, is available here,
It is due April 17 (April 21 for internet students).
Below are some lecture notes:
graphs, part 1 ,
graphs, part 2 ,
articulation vertices ,
strongly connected components .
Some lecture notes:
minimum spanning trees, and
minimum spanning tree algorithms
.
The definitions for the blue rule are available
here.
Homework 6 is available here,
It is due April 24 (April 28 for internet students).
Contact the instructor at calinescu iit.edu.
Document last modified on May 8, 2008.