CS 112 - Lab 8
Questions


Provide answers (on this sheet) to the questions below, and hand them to the TAs at the beginning of lab on Friday, April 11.

  1. Given the sample input_file, which method of probing (linear or quadratic) generates more collisions?
    
    
    
    
    
    
  2. Given the sample input_file, how many clusters of table entries are generated by each method of probing?
    
    
    
    
    
  3. Given the sample input_file, what is the size of the largest cluster generated by each method of probing?
    
    
    
    
    
  4. Given the sample input_file, what is the average number of probes (theoretically) needed to successfully lookup a key in the hash table using linear probing? What is the average number of probes (theoretically) needed in the unsuccessful case?