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

A hash file organization can have too many buckets. What are the reasons for this? What can be done to cut down on the number of bucket overflows?
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 bascd on visitor ID. Use this scenario to answer the below assignment questions. 1. Explain the steps for the following operations using binary scarch. Search for any visitor ID which is available in the list. b. 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: 1. N value must be at least 7. 2. Use your own data for visitor ID and it must be 4 digit number. Please i need answer same way through by picture please please.
Linear hashing question. N= 5 splitting occurs when the load factor exceeds 1.5
Question 25 Assume data is to be stored in a hash table using the following key sequence: 76, 84, 15, 31, 5, 21 Assume the hash table size is 8, the hash function used is the modulo function i.e. h(key) = key % table_size, und collisions are handled using linear probing. What's the content of the table after all keys are mapped to the hash table? List keys starting from table index 0 and on. Separate numbers by a comma and a single space, and indicate an empty slot with an X. If a data item can't be stored, indicate SO.
a) What is a hash function? b) What is a collision? Which are the characteristies to address collisions? Which solution eliminates collisions?
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.
Explain “Collisions in the hashing” in detail.
Search any two real life applications of hashing, study it thoroughly and explain it in your own words. Provide reference to your research as well.
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?
Data structures and algorithm
Using double hasing, insert the following keys: {333, 335, 123, 617, 93, 63, 17, 37} into a hash table of size 17 using k mod m as h1(k), and h2(k) = 8 - k mod 8 as the offset.
Use linear probing to place the following values in the hash table. H(key) = key % 6 Values: 13, 21, 7,8 1 4 2. 3.