Algorithms Project 4-Hashing Solved

30.00 $

Category: Tags: , , ,
Click Category Button to View Your Next Assignment | Homework

You'll get a download link with a: zip solution files instantly, after Payment

Securely Powered by: Secure Checkout

Description

Rate this product

# Hashing

## Overview
Test each hashing implementation with the following:
1. The total number of elements in the table (N), the size of the table (T), the load factor
(Lambda = N/T), the average number of collisions (M = C/N), and the total number of
collisions (C),
2. check whether each word in another given file, query_words.txt, is in the hash
table, and print corresponding output depending on whether the word is found and not
found, and how many probes it took to find the word, if it exists.

## Thoughts
Within the “create_and_test_hash.cc” file,
setup the “number of items” (int type),
“size of hash table” (int type),
“load factor” (float type),
“average number of collisions” (float type),
“total number of collisions” (int type).
Give the correct equation for load factor
(number of items divide by size of hash table)
and average number of collisions
(total number of collisions divide by number of items).

Within the “spell_check.cc” file,
create a method called “cleanWord”,
which sets all the characters in the lower cases.
Then create three methods called “caseACorrect”, “caseBCorrect”, and “caseCCorrect”.
“caseACorrect” is set to add the missing character,
“caseBCorrect” is set to remove the additional character,
and “caseCCorrect” is set to swap adjacent characters from the word in any possible position.
Complete the “testSpellingWrapper” method,
check if the word is correct or incorrect.

Create a new “linear_probing.h” file,
implement 4 get methods,
“getNumberOfElement”, “getSizeOfTable”, “getNumberOfCollision”, and “getProbe”.
Implement linear probing,
to look up and place the element in the closest flowing empty spot.

Within the “quadratic_probing.h” file,
implement 4 get methods,
“getNumberOfElement”, “getSizeOfTable”, “getNumberOfCollision”, and “getProbe”.

Create a new “double_hashing.h” file,
implement 4 get methods,
“getNumberOfElement”, “getSizeOfTable”, “getNumberOfCollision”, and “getProbe”.
Implement double hashing, and rehashing,
which use a bigger table and create a new table to hash,
then insert the element.

## Run
– To compile on terminal type:
1. make clean
2. make all

– To delete executables and object file type:
1. make clean

– To run with a given file that is redirected to standard input:
1. ./create_and_test_hash words.txt query_words.txt quadratic
2. ./create_and_test_hash words.txt query_words.txt double R
3. ./create_and_test_hash words.txt query_words.txt double

  • Algorithms-Project-4-Hashing-main-m9bj41.zip