CSCE 3110 Data Structures
Assigment 4
Total: 80 points
Issued: 03/30/2006
Due: 04/13/2006
................................

1. (10 points) Textbook, problems 7.11, 7.12.

2. (20 points) Write a program that implements a function MinToMax() that 
turns a MinHeap into a MaxHeap. Analyze the running time.
Save the program as minToMax.cpp 

3. (15 points) Write the Huffman code for the following string:
 "University of North Texas, Department of Computer Science"

4. (10 points) Draw the 11 item hash table that results from using the hash
function h(i) = (2i+5) % 11
to hash the keys 3, 8, 102, 23, 4, 10, 9, 12, 44, 23
assuming:
	a. open hashing
	b. closed hashing

5. (25 points) Implement a spell-checker by using a hash table. Assume  
that the dictionary comes from a file, and so is the text to be spelled. 
Output all mispelled words and the line number where they occur. For each 
misspelled word, list all words in the dictionary that are obtainable by 
exchanging adjacent characters. Save the program as spellChecker.cpp


Submission instructions:  
   - write a README file including the answers to problems 1, 3, and 4, and  
     a detailed note about the functionality of the programs you wrote for 2 
     and 5 with complete instructions on how to run them.
   - make sure you include your name in each program and in the README file.
   - make sure all your programs are fully commented, and compile and run 
     correctly on the CSP machines.
   - submit your assignment by the due date using the 'project' program.
     class code is 3110s002, project HW4.