Your last test score will be replaced by a project done in groups of 2 or 3 people. This project will be from a topic in Data Structures selected from the following list. Part of this project will be to do a 20-30 minute presentation on the topic to the entire class. The other portion of this project will be to create the C code to implement your topic.

For example, if your group picks the topic Heaps and Heapsort, then your group will give a presentation on Heaps and Heapsort to the class and will also create the code to do a Heapsort on a specified type of data. The project topics which are under the same heading will be required to work together under the same main program. Thus, some groups will be working together to implement a main program encompassing multiple sub-programs.

Look over the following topics and email me your top three choices of topics with all the names in your group listed. The selection of topics will be in a FIFO manner so the sooner you email the better.

Topic	Pages in KTL	Program Assignment	Project Groupings	Assigned To...
Coatroom	pp 241-247	Project P1 & P2, p247	None	LJ, Scotty, Sean
Divide & Conquer Sorting	pp 299-303	Project A1, see below	Sort Group	Mike N, Eric S
Mergesort for Linked Lists	pp 304-309	Project A1	Sort Group	?
Quicksort for Contiguous Lists	pp 311-318	Project A1	Sort Group	?
Heaps & Heapsort	pp 321-328	Project A1	Sort Group	Kevin and Mike W
AVL Trees	pp 422-436	Project P1,P2 pp 438, Project P2 p 411	Tree Group	Tanveer & Jae
Splay Trees	pp 438-453	Project P1 p455, Project P2 p 411	Tree Group	Jon, Kurt, Katie
B-Trees	pp 473-490	Project P1 p492 or P2 p492	Tree Group	Martha & Dan
Red-Black Trees	pp 492-500	Project P1 & P2 on p 500	Tree Group	Rob & Sam
Look-Ahead in Games	pp 501-505	Project P1 or P2 p 506	None	Nate, Joshua
Graphs	p 511-520	Project P1 and P2 (pick either a or b)	None	Tyson, Kim, Becky

Project A1: Project P1 a-c on page 287. Each group should implement their own sorting technique and add it to the menu.