Skip to content

Data Structures portfolio project creating two implementations of Hash Map 1) chaining for collision handling 2) open addressing for collision handling

Notifications You must be signed in to change notification settings

jenzhng/CS261-Portfolio

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

CS261-Project

Project was designed to showcase our understanding of data structures by implmenting a HashMap with chaining to handle collisions. Skeleton code was provided including for the very basic hashing functions, the dynamic array, and singly-linked-list data structure to build off of. Functions implemented:

  • empty_buckets()
  • table_load()
  • clear()
  • put()
  • contains_key()
  • get()
  • remove()
  • resize_table()
  • get_keys()

Expanded description provided in prompt file: OSU CS261 A6 - U23.pdf

About

Data Structures portfolio project creating two implementations of Hash Map 1) chaining for collision handling 2) open addressing for collision handling

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages