The final exam will take place on Thursday, 
Dec 20th from 7:30 am to 9:30 am in our classroom, W207 PBB. 
Feel free to bring notes, books, and printouts; you will not be allowed to
use your laptops.
The final has 4 problems on it, each problem consisting of 2-4 parts.
The topics covered by each problem are:

<OL>
<LI> <b>Recursion.</b> This includes examples of <i>search with 
backtracking</i> such as the <i>8-Queens Problem</i> and 
the <i>Travelling Salesman Problem</i> and more.
This also includes examples of <i>divide-and-conquer</i> such
as <i>merge sort</i> and <i>quick sort</i>. 

<LI> <b>The PRIORITY QUEUE ADT and its heap implementation.</b>

<LI> <b>Applications of the PRIORITY QUEUE ADT.</b>
This includes <i>Prim's MST algorithm</i> and
<i>Dijkstra's shortest path algorithms</i>.

<LI> <b>Binary Search Trees and AVL Trees.</b>
</OL>

<p>
To practice for the test, you might want to solve these problems. This is 
by no means a comprehensive list.
<OL>
<LI> Problems 2 and 3 from this <a href="http://www.cs.uiowa.edu/~sriram/21/spring07/homework9.html">homework from spring 2007</a>.

<LI> Problems 1, 2 and 4 from this <a href="http://www.cs.uiowa.edu/~sriram/21/spring07/midterm/final.html">final from spring 2007</a>.

<LI> Problems 2(a), 3, 4, and 5  from this 
<a href="http://www.cs.uiowa.edu/~sriram/21/spring06/finalSpring2006.html">final from spring 2006</a>.
</OL>