Please find the attachment that has the information that needed to do the work. i am also attaching class code so that you follow it in doing this work. please note this work need to be unique o please make sure it is not from the internet
Unformatted Attachment Preview
Code the best possible hash function program (NO collision handling) for the list of identifiers below.
All identifiers MUST hash to an integer value using the very same hash function. Your output is to list
each identifier together with its computed hash (integer) address.
Your hardcopy submission must include the following:
(1) Your printed output listing of each identifier together with its computed hash value, neatly
(2) A printout of your program listing
(3) A typed explanation of your hash function.
These are the identifiers that are to be used as input to your hash function:
Note: There are twenty-four (24) identifiers. Your hash algorithm is to compute a value between zero
(0) and less than thirty-six (36). Points awarded for your hash function will be based on uniqueness of
your algorithm, the uniqueness of your computed hash values, the number of collisions, the typed
description of your hash algorithm, and the neatness of your output. Also, input is to be processed from
a file. An input file containing these identifiers has been made available to you on the course Canvas
POINTS PART A: UNIQUENESS OF ALGORITHM AND UNIQUENESS OF THE OUTPUT RESULTS
12 points (max):
Your algorithm is completely unique and adheres to the
requirements and there are no collisions
Your algorithm is completely unique and adheres to the
requirements and there is only one collision
Your algorithm is 95% unique and adheres to the requirements
Your algorithm is 90% unique and adheres to the requirements
Your algorithm is 85% unique and adheres to the requirements
Your algorithm is at least 80% unique and adheres to the
-2 points (–):
Your algorithm is very similar to at least one other students
For every pair of identifiers that hash to the same value
And for every additional identifier (past two) that hash to the same
POINTS PART B:
14 points (max):
Hashed values are all between 0 and 24
Hashed values are all between 0 and 25
Hashed values are all between 0 and 26
Hashed values are all between 0 and 27
Hashed values are all between 0 and 28
Hashed values are all between 0 and 29
Hashed values are all between 0 and 30
Hashed values are all between 0 and 31
Hashed values are all between 0 and 32
Hashed values are all between 0 and 33
Hashed values are all between 0 and 34
Hashed values are all between 0 and 35
Hashed values are all between 0 and 36
? You must process the input from the input file that has been made available to you for this
? You may use any combination of the hash methods discussed in class division/remainder,
folding, extraction and bitwise operations: & | ^ << >>), no other methods will be accepted.
? Rehashing is permitted and may be necessary, but must be done unconditionally (no if
statement to check if needed either always done or never done)
? Every identifier must be run through the same hash algorithm (same hash, same re-hash(s))
? No special handling of identifiers is permitted, except blank padding.
? The hash values obtained, must be the very same integer values every time the program is run
with the same final algorithm.
? NO collision handling is permitted outside of the hash algorithm. No special checking for
collisions is permitted within your code.
Purchase answer to see full
Why Work with Us
Top Quality and Well-Researched Papers
We always make sure that writers follow all your instructions precisely. You can choose your academic level: high school, college/university or professional, and we will assign a writer who has a respective degree.
Professional and Experienced Academic Writers
We have a team of professional writers with experience in academic and business writing. Many are native speakers and able to perform any task for which you need help.
Free Unlimited Revisions
If you think we missed something, send your order for a free revision. You have 10 days to submit the order for review after you have received the final document. You can do this yourself after logging into your personal account or by contacting our support.
Prompt Delivery and 100% Money-Back-Guarantee
All papers are always delivered on time. In case we need more time to master your paper, we may contact you regarding the deadline extension. In case you cannot provide us with more time, a 100% refund is guaranteed.
Original & Confidential
We use several writing tools checks to ensure that all documents you receive are free from plagiarism. Our editors carefully review all quotations in the text. We also promise maximum confidentiality in all of our services.
24/7 Customer Support
Our support agents are available 24 hours a day 7 days a week and committed to providing you with the best customer experience. Get in touch whenever you need any assistance.
Try it now!
How it works?
Follow these simple steps to get your paper done
Place your order
Fill in the order form and provide all details of your assignment.
Proceed with the payment
Choose the payment system that suits you most.
Receive the final file
Once your paper is ready, we will email it to you.
No need to work on your paper at night. Sleep tight, we will cover your back. We offer all kinds of writing services.
No matter what kind of academic paper you need and how urgent you need it, you are welcome to choose your academic level and the type of your paper at an affordable price. We take care of all your paper needs and give a 24/7 customer care support system.
Admission Essays & Business Writing Help
An admission essay is an essay or other written statement by a candidate, often a potential student enrolling in a college, university, or graduate school. You can be rest assurred that through our service we will write the best admission essay for you.
Our academic writers and editors make the necessary changes to your paper so that it is polished. We also format your document by correctly quoting the sources and creating reference lists in the formats APA, Harvard, MLA, Chicago / Turabian.
If you think your paper could be improved, you can request a review. In this case, your paper will be checked by the writer or assigned to an editor. You can use this option as many times as you see fit. This is free because we want you to be completely satisfied with the service offered.