Question

Download Solution PDF

Consider a hash table with 9 slots. The hash function is ℎ(k) = k mod 9. The collisions are resolved by chaining. The following 9 keys are inserted in the order: 5, 28, 19, 15, 20, 33, 12, 17, 10. The maximum, minimum, and average chain lengths in the hash table, respectively, are

This question was previously asked in
GATE CS 2014 Official Paper: Shift 1
Attempt in App
View all GATE CS Papers >
  1. 3, 0, and 1
  2. 3, 3 and 3
  3. 4, 0, and 1
  4. 3, 0, and 2

Answer (Detailed Solution Below)

Option 1 : 3, 0, and 1
Free Tests
View all Free tests >
Free
GATE CS Full Mock Test
65 Qs. 100 Marks 180 Mins
Start Now

Detailed Solution

Download Solution PDF

Concept:

Keys: 5, 28, 19, 15, 20, 33, 12, 17,

10.

ℎ(k) = k mod 9

Chaining

Maximum chain length = 3 (28 -> 19 -> 10)

Minimum chain length = 0 (0, 4, 7 slot doesn’t have any element)

Hence option 1 is the correct answer.

Download Solution PDF
Latest GATE CS Updates

Last updated on Jan 8, 2025

-> GATE CS 2025 Admit Card has been released on 7th January 2025.

-> The exam will be conducted on 1st February 2025 in 2 shifts.

-> Candidates applying for the GATE CE must satisfy the GATE Eligibility Criteria.

-> The candidates should have BTech (Computer Science). Candidates preparing for the exam can refer to the GATE CS Important Questions to improve their preparation.

-> Candidates must check their performance with the help of the GATE CS mock tests and GATE CS previous year papers for the GATE 2025 Exam.

Exams Tests Super Practice

More Searching Questions

Q1.Which collision resolution technique involves maintaining a linked list of collided keys ? 
Q2.Complexity for linear search is 
Q3.Choose true statement : I - Binary search is faster than linear search. II - Binary search may not be applied on all the input lists on which linear search can be applied.
Q4.A data structure is required for storing a set of integers such that each of the following operations can be done in O(log n) time, where n is the number of elements in the set. A. Deletion of the smallest element B. Insertion of an element if it is not already present in the set Which of the following data structures can be used for this purpose?
Q5.Suppose we are given n keys, m hash table slots, and two simple uniform hash functions h1 and h2. Further, suppose our hashing scheme uses h1 for the odd keys and h2 for the even keys. What is the expected number of keys in a slot? 
Q6.Consider a hash table of size 7 implemented using an array A[0 ... 6]. A modulo hash function (MOD 7) is used to map the keys, and open addressing is used to handle collisions. If 53, 32, 43, 51, 99 are inserted into the hash table, the contents of array A is
Q7.Consider a 13 element hash table for which f(key) = key mod 13 is used with integer keys. Assuming linear probing is used for collision resolution, at which location would the key 103 be inserted, if the keys 661, 182, 24 and 103 are inserted in that order?
Q8.Consider a dynamic hashing approach for 4-bit integer keys: 1. There is a main hash table of size 4. 2. The 2 least significant bits of a key is used to index into the main hash table. 3. Initially, the main hash table entries are empty. 4. Thereafter, when more keys are hashed into it, to resolve collisions, the set of all keys corresponding to a main hash table entry is organized as a binary tree that grows on demand. 5. First, the 3rd least significant bit is used to divide the keys into left and right subtrees. 6. to resolve more collisions, each node of the binary tree is further sub-divided into left and right subtrees based on 4th least significant bit. 7. A split is done only if it is needed, i. e. only when there is a collision. Consider the following state of the hash table. Which of the following sequence of key insertions can cause the above state of the hash table (assume the keys are in decimal notation)?
Q9.What is the worst-case number of arithmetic operations performed by recursive binary search on a sorted array of size n?
Q10.Which open addressing technique is free from Clustering problems?

More Searching, Sorting and Hashing Questions

Q1.In the decrease by a constant approach, the problem size is reduced by a constant amount in each step. What is the time complexity of this approach?
Q2.If node 16 is deleted from the following binary tree and the resulting binary tree is traversed in-order then what would be the sequence in which the nodes would be visited?
Q3.The decrease by variable factor approach involves reducing the problem size by a variable factor in each step. Which algorithm uses this approach?
Q4.Which of the program has the highest run time complexity ?
Q5.The number of comparisons needed to sort the array : 8, 22, 7, 9, 31, 19, 5, 13 In ascending order using bubble sort method is :
Q6.At the time of sorting an array of size N by normal selection sort, the number of comparisons made in first iteration is :
Q7.The Highest Lower Bound on the number of Comparisons in the worst case for comparison-based sorting order of : 
Q8.Which open addressing technique is free from Clustering problems ?
Q9.The recurrence relation for binary search algorithm is : 
Q10.Which of the following is not a stable sorting algorithm ?
Suggested Test Series
View All >
GATE Mathematics & General Aptitude (Common for All) Test Series
92 Total Tests with 0 Free Tests
Start Free Test
GATE CSE 2023-24 Test Series
129 Total Tests with   1 Free Tests
Start Free Test

UGC NET Important Links

Exam AnalysisAnswer KeyCut OffResultAdmit CardExam Dates

More Algorithms Questions

Q1.What is the primary goal of the branch and bound approach?
Q2.Which of the following best describes the technique for solving optimization problems where making the locally optimal choice at each step leads to a globally optimal solution"
Q3.The backtracking approach is based on which principle?
Q4.While developing an algorithm what is the primary concern?
Q5.For solving which of the following problems dynamic programming can be used?
Q6.If depth-first search (DFS) is performed on the graph shown below starting with vertex 4, then in which order would the vertices of the graph be visited?
Q7.Which of the following algorithms follows the divide and conquer paradigm?
Q8.Which of the following is an application of the backtracking technique?
Q9.In the decrease by a constant approach, the problem size is reduced by a constant amount in each step. What is the time complexity of this approach?
Q10.If node 16 is deleted from the following binary tree and the resulting binary tree is traversed in-order then what would be the sequence in which the nodes would be visited?
Testbook Edu Solutions Pvt. Ltd.
1st & 2nd Floor, Zion Building,
Plot No. 273, Sector 10, Kharghar,
Navi Mumbai - 410210
support@testbook.com
Toll Free:1800 833 0800
Office Hours: 10 AM to 7 PM (all 7 days)
Company
About usCareers We are hiringTeach Online on TestbookPartnersMediaSitemap
Products
Test SeriesTestbook PassOnline CoursesOnline VideosPracticeBlogRefer & EarnBooks
Copyright © 2014-2022 Testbook Edu Solutions Pvt. Ltd.: All rights reserved
User PolicyTermsPrivacy
Hot Links： teen patti master 51 bonus teen patti star teen patti real cash withdrawal