CMSC 341 Spring 2007
Project 4 Questions

These questions are worth 20% (10% each) of your project grade.

(1) Run your project on the commands in the file p4.commands.huge (which is in
    the same directory as this questions file) for the following cases:

      - k = 2
      - k = 4
      - k = 8
      - k = 16
      - K = 32
    The command file will insert 100,000 numbers and print out the total
    CPU time used after every 1000 inserts.  Be sure to include the total
    CPU time for each run as part of your answer.

    Does the value of k seem to have an impact on asymptotic 
    performance of insert?  If so, what is the observed effect 
    and why does it occur?  If not, why not?

    
(2) Rather than performing Find() in a heap by searching linearly through
    the heap, you could use a hash table to store the location of each
    value in the heap.  Describe (in a couple of paragraphs) how this would
    work and the problems that might arise.  What would be the impact of
    this change on the performance of your project (i.e. the various
    k-ary heap methods) both in terms of time and space complexity?