Show Menu
Cheatography
  1. Home >
  2. Cheat Sheets >

COMP 251 Cheat Sheet (DRAFT) by

COMP 251 Midterm

This is a draft cheat sheet. It is a work in progress and is not finished yet.

Direct­-Ad­dress Tables

Direct­-Ad­dress Tables
 

Hashing with chaining

insertion
O(1)
insert at beginning of list
deletion
search time + O(1)
double linked list
search­(worst)
O(n)
all keys in same slot
unsucc­essful search (average)
O(1+α)
avg length of list = α
average case analysis
assume simple uniform hashing
    
 
Advertisement