Hashing - Online Test

Test Difficulty Level: Hard

Syllabus of Test

Data Structure: Question based on the Hash Function and Hash Table.

Sample Question from this online test:

Question: In perfect hashing techniques, if the worst case number of memory access required to perform a search in ______ time.

Option A: O(n)

Option B: O(mn)

Option C: O(1)

Option D: none of these

To answer, click the "Start This Test" button below.

Start this Test






Comments

No comment yet. Be the first to post a comment.