Hash Functions and Table Structure
Curriculum and historical examination lineage for Hash Functions and Table Structure under Unit 4 (Trees and Hashing) of Data Structures and Algorithms (21CSC201J) at SRMIST.
Historical appearance distribution across SRMIST Formative Tests (CT1, CT2) and University End Semester examinations.
Factual marks weightage of questions asked on this topic in historical examinations.
Representative historical questions extracted directly from SRMIST examination papers.
Harish plans to have a small library at his home. He has lot of books and he wants to assign a unique number to each book. This unique number helps him in identifying the position...
What is a hash table? A) A structure that maps values to keys B) A structure used for storage C) A structure that maps keys to values D) A structure used to implement stack and...
If several elements are competing for the same bucket in the hash table, what is it called? A) Diffusion B) Replication C) Collision D) Duplication [1]
Consider a hash table with 98 slots. The has function is h(k) = k mod 9. The collisions are resolved by chaining. The following 9 keys are inserted in the order: 5, 28, 19, 15,...
What is a hash function? (A) A function has allocated memory to keys (B) A function that computes the location of the key in the array (C) A function that creates an array (D) A...
Examinations where questions for Hash Functions and Table Structure have appeared.
Master Hash Functions and Table Structure in MintAI
Practice past exam questions, test recurring archetypes, and view predictive probability for this topic before your upcoming exam.