COS 212 Hashing and Searching Algorithms

NoteworthyExtraterrestrial avatar
NoteworthyExtraterrestrial
·
·
Download

Start Quiz

Study Flashcards

10 Questions

What is the method of hashing that uses a selection of digits as the key?

Extraction

What is the assumption made when extracting 3 digits as the key?

The part of the key is least likely to repeat

What is the purpose of using the modulus operator in hash functions?

To ensure the indices are in the desired range

What happens when the majority of keys end in a 0 in the hash table?

Collisions increase

What is the advantage of the extraction method of hashing?

It is extremely simple and efficient

What is the disadvantage of the extraction method of hashing?

Part of the key is used, resulting in less variation

What is the purpose of using the hash function h(K) = K % T?

To ensure the indices are in the desired range

What is the range of values returned by the modulus operator in hash functions?

[0, T - 1]

What is the requirement for the indices generated by the hash function?

They must be in the range [0, T - 1]

What is the result of using the hash function h(K) = K % 10 when the majority of keys end in a 0?

Collisions occur everywhere

Test your knowledge of searching algorithms, including average and worst case scenarios, in different data structures such as arrays, linked lists, skip lists, BST, and B-Tree. Learn about the efficiency of searching, inserting, and deleting in each data structure.

Make Your Own Quizzes and Flashcards

Convert your notes into interactive study material.

Get started for free

More Quizzes Like This

Hashing
72 questions

Hashing

CourtlyErudition avatar
CourtlyErudition
COS 212 Hashing and Data Structures
10 questions

COS 212 Hashing and Data Structures

NoteworthyExtraterrestrial avatar
NoteworthyExtraterrestrial
Use Quizgecko on...
Browser
Browser