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.

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.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Using 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.
Jump to level 1 An empty hash table hashTable has 15 buckets and a hash function of key % 15. The following operations are performed in order. Select which operations cause a collision. HashInsert(hashTable, 33) HashInsert(hash Table, 3) HashInsert(hash Table, 44) HashInsert(hash Table, 18) HashInsert(hash Table, 48)
Our hash map wasn't made very well because all the data were thrown into one bucket. If so, describe how doing so would defeat the original intent of using a hash map.
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
There are N numbers of visitors in Muscat festival, Manager wishes to search particular visitor information based on visitor ID. Consider the records are already arranged in ascending order based on visitor ID. Use this scenario to answer the below assignment questions. 1. Explain the steps for the following operations using binary search. Search for any visitor ID which is available in the list. And Search for any visitor ID which is not available in the list. 2. Use Mid-Square Hashing Technique to explain the following. a. Place all the records into the hash table. b. Use linear probing or chaining technique to eliminate collision. 3. Write your own hash function. Note: N value must be at least 7 . And Use your own data for visitor ID and it must be 4 digit number.
Use the table below to convert a character key to an integer for the following questions. Letter A B C D E FG HIJK L M Key Letter 0 12 3 456 789 10 11 12 NOPQ RSTUVWXY Z 13 14 15 16 17 18 19 20 21 22 23 24 25 Key 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 donble hashing and let h'(k) =1+ (k mod 11) be the secondary hash function.
In 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.
a hash has 13 buckets. Following are the keys of the hash table; 25,48,34,15 and 59. Calculate the indexes of the keys-type your calculations and explain
Please type your solution below for the question c. Suppose the hash table in B2 is updated, but B1 is empty.
Hashing is a technique that is used to uniquely identify a specific object from a group of similar objects. Can you use one or two real-world example(s) to explain what a "hash" really is? How can a programmer implement it? Pls, give a thorough ans.
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?
Five keys 8, 25, 10, 15, 18 have been added to a hash table of size 4 that uses Separate Chaining using hash function h(x) resultant hash-table. = x % 4. Show the You have to insert two more keys 43 and 92 into the hash table. The designer of the hash table decided to resize the table by doubling its size when the load factor reaches or exceeds 1.5. Draw the new hash table after the insertions. The keys 2222, 1118, 1323, 2, 343, 2133, 155 and 95 are inserted into an initially empty hash table of length 10 using open addressing with hash function h(k) = k mod 10 with linear probing. What is the resultant hash table?