Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Question
Chapter 9.5, Problem 6QE
Program Plan Intro
Hash files:
Hash files use a technique called hashing. Hashing is a technique which provides quick access to record as in indexing but without the expense of index maintenance. In this technique storage is divided into many sections. These sections are called buckets. These buckets are capable of storing many records. These buckets are provided with bucket numbers. These numbers are used to identify buckets rather than keys in indexing.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
3. A hash table contains 10 buckets and uses
lincar probing to resolve collisions. The key
values are integers and the hash function used
is key % 10. If the values 43, 165, 62, 123,
142 are inserted in the table, in what location
would the key value 142 be inseted.
1. 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?
A typical hash function often consists of the following three steps:
Group of answer choices
hashing, compressing, and indexing.
multiplication, addition, and modularization.
selecting, digitizing, and combining.
modularization, probing, and indexing.
compressing, hashing, and probing.
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
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Is there any benefit to using a hash index table?arrow_forwardWhat 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?arrow_forward1. For the input 30, 20, 56, 75, 31, 25 and hash function h(K) = K mod 12 First, a. construct the open hash table.b. find the largest number of key comparisons in a successful search inthis table.c. find the average number of key comparisons in a successful searchin this table Second, a. construct the closed hash table.b. find the largest number of key comparisons in a successful search inthis table.c. find the average number of key comparisons in a successful searchin this table.arrow_forward
- Suppose a hash table has 11 locations, keys are placed in the table using the hash function f (x) = x mod 11, and linear chaining is used to resolve collisions Draw a picture of the result of storing the following keys in the table: 0, 12, 42, 18, 6, 22, 8, 105, 97arrow_forwardSuppose that a computer has only the memory locations 0,1,2,...,19. Use the hashing functionh where h(x)=(x+5) mod 20 to determine the memory locations in which 57, 32, and 97 are stored.arrow_forwardA hash function should be independent of the capacity of the hash table. Select one: a. False O b. Truearrow_forward
- 2. Using the keys as given below: 40, 32, 18, 90 Compute the hash values, using h(k) = k mod m Size of the hash table is 11 Use Quadratic Probing with C1 = 1 and C₂ = 2 Draw the hash tablearrow_forwardQuestion 3: Store the given data using hashing with the key value 13. 18 41 22 44 59 32 31 73arrow_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
- 1. There are n numbers of students in your class. Your class teacher wants to search a particular student information based on student ID. Consider the records are already arranged in ascending order. Explain the steps for the following operations using binary search. • Search for any record which is available in the list. • Search for a record which is not available in the list. 2. Use any Hashing Technique to explain the following for the above scenario. • Place all the records into the hash table. • Use any probing /chaining technique to eliminate collision. Rubrics: No. Criteria Marks Binary Search 1 Search for any available record 2 Search for any unavailable record Hashing Technique 3 Placing records into the list with proper collision avoiding 1.0 technique 3.0 1.0 Total Marks 5.0arrow_forward3. Insert the records with the keys 80, 53, 26, 17, 62, 18, 35, 51 into a hash table of size 11. For any collision occurs, use double hashing with H1(key)= mod(key, 3) and H2(key)= mod(key, 11). 2arrow_forwardQ1. Using a bullet point list, briefly describe the operation in each of the stages of hash code generation in SHA-512. Stage Brief description Input formatting Hash buffer initialization Message processing Outputarrow_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