Heaps Top Footnotes Contents

Hash Tables

Synopsis

Structure

Vocabulary

Supports

Dependencies

Operations

Traversals

Concept Inventory

     
  1. Consider chaining as a collision strategy. What is the best possible worst case behaviors for insertion and finding, respectively?
    1. constant, linear
    2. constant, constant
    3. constant, linear
    4. linear, linear
    5. linear, quadratic
    6. quadratic, linear
     
  2. Consider open addressing as a collision strategy. What is the best possible worst case behaviors for insertion and finding, respectively?
    1. linear, linear
    2. constant, linear
    3. linear, constant
    4. constant, constant
    5. linear, quadratic
    6. quadratic, linear
     
  3. Consider rehasing with a perfect hash as a collision strategy. possible worst case behaviors for insertion and finding, respectively?
    1. linear, constant
    2. constant, linear
    3. constant, constant
    4. linear, linear
    5. linear, quadratic
    6. quadratic, linear

lusth@cs.ua.edu


Heaps Top Footnotes Contents