Data Structures Quiz

Which of the following is the non linear data structure?*

• Tree

• Stack

• String

• List

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

• Chaining

• Open addressing

• Collision

• Hashing

What data organization method is used in hash tables?*

• Stack

• Array

• Linked list

• Queue

Hashing is the problem of finding an appropriate mapping of keys into addresses.*

• True

• False

In a hash table of size 10, where is element 7 placed using division method?*

• 16

• 7

• 17

• 6

Which of the following operations are done in a hash table?*

• Replace

• Insert only

• Insert and search

• Search only

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

• O(N2)

• O(N3)

• O(N)

• O(N log N)

What is a hash function?*

• A function has allocated memory to keys

• A function that creates an array

• A function that computes the location of the key in the array

• None of the mentioned

In simple uniform hashing, what is the search complexity?*

• O(logn)

• O(n)

• O(nlogn)

• O(1)

In simple chaining, what data structure is appropriate?*

• Doubly linked list

• Binary trees

• Circular linked list

• Singly linked list