COSC 350: Data Structures
April 22, 2009

Discuss Writing Project

Think Lab Report

(Typically an Abstract but not this assignment)
(Very Brief) Introduction
Methods
Results
Discussion
Conclusions
(Acknowledgements) and Citations
Appendices: Code, Large Tables, Large Figures or Graphs

Completeness and Correctness

Rewrite by Wednesday (Include original with revised version)
See me if you have questions!

Hash Tables

Goal: O(1) searching

Hash table/slot
Load Factor: L = (Number of Items)/(Size of Table)
Hash function: Techniques & Efficiency
Collisions
Collision Resolution: linear probing & Chaining

Homework

Friday, April 24:

Implement Heap Sort in Python. Be sure to demonstrate your code. (Counts as two routine homework assignments.

Wednesday, April 29:

Revised Sorting Report. Include the original with the revised report.

This page was created by Joe Sloan.
It was last modified on or after: 22 April 2009
Send mail to: sloanjd@wofford.edu