DSA Quiz 2

Consider a hash table of size seven, with starting index zero, and a hash function (7x+3) mod 4. Assuming the hash table is initially empty, which of the following is the contents of the table when the sequence 1, 3, 8, 10 is inserted into the table using closed hashing ? Here “__” denotes an empty location in the table.

• 3, 10, 1, 8, __ , __ , __
• 1, 3, 8, 10, __ , __ , __
• 1, __ , 3, __ , 8, __ , 10
• 3, 10, __ , __ , 8, __ , __

What is the worst case complexity for linear search?

• O(nlogn)
• O(logn)
• O(n)
• O(1)

What is the time complexity of binary search with iteration?

• O(nlogn)
• O(n)
• O(1)
• O(logn)

Given an array arr = {45,77,89,90,94,99,100} and key = 100; What are the mid values(corresponding array elements) generated in the first and second iterations using binary search?

• 90 and 99
• 89 and 94
• 90 and 100
• 94 and 99

The case in which a key other than the desired one is kept at the identified location is called?

• Hashing
• Chaining
• Open addressing
• Collision

A hash table of length 10 uses open addressing with hash function h(k)=k mod 10, and linear probing. After inserting 6 values into an empty hash table, the table is as shown above. Which one of the following choices gives a possible order in which the key values could have been inserted in the table?

• 46, 42, 34, 52, 23, 33
• 34, 42, 23, 52, 33, 46
• 42, 46, 33, 23, 34, 52
• 46, 34, 42, 23, 52, 33

What is the worst case search time of a hashing using separate chaining algorithm?

• O(N log N)
• O(N^2)
• O(N^3)
• O(N)

Which of the following statement(s) is TRUE? 1) A hash function takes a message of arbitrary length and generates a fixed length code. 2) A hash function takes a message of fixed length and generates a code of variable length. 3) A hash function may give the same hash value for distinct messages.

• 1 only
• 2 & 3 only
• 3 only
• 1 & 3 only

A hash function h defined h(key)=key mod 7, with linear probing, is used to insert the keys 44, 45, 79, 55, 91, 18, 63 into a table indexed from 0 to 6. What will be the location of key 18?

• 3
• 4
• 5
• 6

The keys 12, 18, 13, 2, 3, 23, 5 and 15 are inserted into an initially empty hash table of length 10 using open addressing with hash function h(k) = k mod 10 and linear probing. What is the resultant hash table?

• A
• B
• C
• D