Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Question
Chapter 9, Problem 59CRP
Program Plan Intro
Division technique in a hash function must proceed by constructing a file so that we can apply division technique by dividing interpreted integer key
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
2.
Which memory locations are assigned by the hashing function h(k) =k mod 101 to the records of insurance company customers with these
%3D
Social Security numbers?
a) 104578690
b) 432222187
c) 372201919
d) 501338753
What causes a bucket overflow in a hash file structure, and how does it happen? Was there anything
that could be done to reduce the number of overflowing buckets?
A hash function is bi-directional, it allows us to create a fingerprint of a file and also reverse the processes to get the contents of the file
Group of answer choices
True
False
Chapter 9 Solutions
Computer Science: An Overview (12th Edition)
Ch. 9.1 - Identify two departments in a manufacturing plant...Ch. 9.1 - Prob. 2QECh. 9.1 - Summarize the roles of the application software...Ch. 9.2 - Prob. 1QECh. 9.2 - Prob. 2QECh. 9.2 - Prob. 4QECh. 9.2 - Prob. 5QECh. 9.2 - Prob. 6QECh. 9.3 - Prob. 1QECh. 9.3 - What is a persistent object?
Ch. 9.3 - Identify some classes as well as some of their...Ch. 9.3 - Prob. 4QECh. 9.4 - Prob. 1QECh. 9.4 - Prob. 2QECh. 9.4 - Prob. 3QECh. 9.4 - Prob. 4QECh. 9.4 - Prob. 5QECh. 9.4 - Prob. 6QECh. 9.5 - Prob. 1QECh. 9.5 - Prob. 2QECh. 9.5 - Prob. 3QECh. 9.5 - Prob. 4QECh. 9.5 - Prob. 5QECh. 9.5 - Prob. 6QECh. 9.5 - Prob. 7QECh. 9.6 - Prob. 1QECh. 9.6 - Give an additional example of a pattern that might...Ch. 9.6 - Prob. 3QECh. 9.6 - How does data mining differ from traditional...Ch. 9.7 - Prob. 1QECh. 9.7 - Prob. 2QECh. 9.7 - Prob. 3QECh. 9.7 - Prob. 4QECh. 9 - Prob. 1CRPCh. 9 - Prob. 2CRPCh. 9 - Prob. 3CRPCh. 9 - Prob. 4CRPCh. 9 - Prob. 5CRPCh. 9 - Prob. 6CRPCh. 9 - Prob. 7CRPCh. 9 - Prob. 8CRPCh. 9 - Prob. 9CRPCh. 9 - Prob. 10CRPCh. 9 - Prob. 11CRPCh. 9 - Prob. 12CRPCh. 9 - Using the commands SELECT, PROJECT, and JOIN,...Ch. 9 - Answer Problem 13 using SQL. PROBLEM 13 13. Using...Ch. 9 - Prob. 15CRPCh. 9 - Prob. 16CRPCh. 9 - Prob. 17CRPCh. 9 - Prob. 18CRPCh. 9 - Prob. 19CRPCh. 9 - Empl Id Name Address SSN Job Id Job Title Skill...Ch. 9 - Empl Id Name Address SSN Job Id Job Title Skill...Ch. 9 - Prob. 22CRPCh. 9 - Prob. 23CRPCh. 9 - Prob. 24CRPCh. 9 - Prob. 25CRPCh. 9 - Write a sequence of instructions (using the...Ch. 9 - Prob. 27CRPCh. 9 - Prob. 28CRPCh. 9 - Prob. 29CRPCh. 9 - Prob. 30CRPCh. 9 - Prob. 31CRPCh. 9 - Prob. 32CRPCh. 9 - Prob. 33CRPCh. 9 - Prob. 34CRPCh. 9 - Prob. 35CRPCh. 9 - Prob. 36CRPCh. 9 - Prob. 37CRPCh. 9 - Prob. 38CRPCh. 9 - Prob. 39CRPCh. 9 - Prob. 40CRPCh. 9 - Prob. 41CRPCh. 9 - Prob. 42CRPCh. 9 - Prob. 43CRPCh. 9 - Prob. 44CRPCh. 9 - Prob. 45CRPCh. 9 - Prob. 46CRPCh. 9 - Prob. 47CRPCh. 9 - Prob. 48CRPCh. 9 - Prob. 49CRPCh. 9 - Prob. 50CRPCh. 9 - Prob. 51CRPCh. 9 - Prob. 52CRPCh. 9 - Prob. 53CRPCh. 9 - Prob. 54CRPCh. 9 - Prob. 55CRPCh. 9 - Prob. 56CRPCh. 9 - Prob. 57CRPCh. 9 - Prob. 58CRPCh. 9 - Prob. 59CRPCh. 9 - Prob. 60CRPCh. 9 - Prob. 61CRPCh. 9 - Prob. 62CRPCh. 9 - Prob. 1SICh. 9 - Prob. 2SICh. 9 - Prob. 3SICh. 9 - Prob. 4SICh. 9 - Prob. 5SICh. 9 - Prob. 6SICh. 9 - Prob. 7SICh. 9 - Prob. 8SICh. 9 - Prob. 9SICh. 9 - Prob. 10SI
Knowledge Booster
Similar questions
- 4. Given input keys of a file 130, 60, 98, 28, 38, 55 and a hash function with table-size=10. Show the results of double hash with Hash (key) = key%10 and Hash2( key ) = P- (key mod P) %3Darrow_forwardGiven the key-values: 14, 15, 16, 17, 18, 19, 20, 100, 101, 102, 103, 104, 105 and number of file positions 14, which of the following statement is true in hashing function using division method? Use the closest prime number less than or equal to the number of file positions. O We have collision and the minimum and the maximum addresses hashed by these key-values are 0 and 12 We have collision and the minimum and the maximum addresses hashed by these key-values are 1 and 12 We do not have collision Nonearrow_forwardDesign a hash function for hashing 1000 records of the following format: Name SSN Distance from Kansas City (miles) Fred Smith 382-71-4095 25.2 Write down the hash function and explain how it works. Explain what hashing strategy you would employ including what you would hash on. Explain why you selected this particular hash funciton and hashing strategy.arrow_forward
- 3. Use the table below to convert a character key to an integer for the following questions. Letter A Bc |D EF|G |H |I |J |K L M Key Letter NOPQRS Key 0 12 3 45 6 789 10 11 12 TUVWXYZ 13 14 15 16 17 18 19 20 21 22 23 24 25 (a) that order into an initially empty 13-item hash table: (E, A, S1, Y, Q,U, E2, S2, T, I,0, N). Use h(k) = k mod 13 for the hash function for the k-th letter of the alphabet (see above table for converting letter keys to integer values). Use linear probing. Give the contents of the hash table that results when the following keys are inserted in (b) -, Give the contents of the hash table that results when the same keys are inserted in that order into an initially empty 13-item hash table. Use h(k) = k mod 13 for the hash function for the k-th letter of the alphabet (see above table for converting letter keys to integer values). Use double hashing and let h'(k) =1+ (k mod 11) be the secondary hash function.arrow_forward1. Given the following hash function for storing records on courses:f(title) = ASCII value of first character in the title - 64Example: f(Biology I) = 66 – 65 = 1 (ASCII value of B is 66) a. Explain why this is or is not a good hash function.b. What improvement(s) could be made? 2. Assume that the hash function is: f(key) = key % Ba. What is the problem if B is too small?b. What is the problem if B is too large?c. What is the big-0 run-time if there are n records?d. What does the run-time for a find, insert, and delete each approach as B gets verylarge?arrow_forwardIn a well organized essay, not a series of bullets, explain what "hashing" is. What is it used for? What makes it particularly attractive. In your essay be sure to indicate the order of magnitude required to store or to search for data using hashing.arrow_forward
- Assume you have a text file containing 10,000 words and you want to count the frequency of each word in the file. What is the time complexity of this operation using a hash table?arrow_forwardCalculate the hash value using Folding Method for keys 1921678, 777281, 1892, 1921, 21017 for hash table with 1000 memory locations. PLEASE HELP SIR. THX.arrow_forwardWhich of these is NOT a characteristic of a secure hash algorithm? a. Collisions should be rare. b. A message cannot be produced from a predefined hash. c. The results of a hash function should not be reversed. d. The hash should always be the same fixed size.arrow_forward
- Using separate chaining and the hash function ‘key mod 7’, insert the following sequence of keys in the hash table 52, 600, 45, 42, 92, 63, 36arrow_forwardExplain the major differences between hash functions and keyed-hash functions. In which scenarios would you use one or the other?arrow_forwardUsing linear hashing to insert the given values in the order provided with the hash function hi(K) = K mod 2i . Display how the file grows and the hash functions changes as the records are inserted. Draw the diagrams showing the loading of the data into buckets, overflows, and splits. Also, calculate the average number of block accesses for a random retrieval on the given records. Given records are 2369, 3760, 4692, 4871, 5659, 1821, 1074, 7115, 1620, 2428, 3943, 4750, 6975, 4981 and 9208.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education