Hash Tables Chaining using Linked Lists Multiple choice Questions and Answers (MCQs)

 

 Buy/Download all MCQ Ebook   >>>Click Here<<<

Hash Tables Chaining using Linked Lists Multiple choice Questions and Answers (MCQs)

Click on any option to know the CORRECT ANSWERS

Question 1
The case in which a key other than the desired one is kept at the identified location is called?
A
Hashing
B
Collision
C
Chaining
D
Open addressing
Library science Questions answers

Question 1 Explanation: 
When some other value is placed at a specified location other than the desired key, it is said to be a collision.

Question 2
What data organization method is used in hash tables?
A
Stack
B
Array
C
Linked list
D
Queue
Journalism Questions answers

Question 2 Explanation: 
The data structure used to organize data for hash tables is linked list. It contains a data field and a pointer field.

Question 3
The task of generating alternative indices for a node is called?
A
Collision handling
B
Collision detection
C
Collision recovery
D
Closed hashing
EVS Questions answers

Question 3 Explanation: 
Collision handling involves the process of formulating alternative indices for a key.

Question 4
Which of the following is not a collision resolution technique?
A
Separate chaining
B
Linear probing
C
Quadratic probing
D
Hashing
Commerce Questions answers

Question 4 Explanation: 
Hashing is a technique of placing data items in specific locations. Collision may occur in hashing but hashing is not a collision resolution technique.

Question 5
Hashing is the problem of finding an appropriate mapping of keys into addresses.
A
True
B
False
Commerce Questions answers

Question 5 Explanation: 
Hashing is a data structure which is used to locate data in a table based on a key value.

There are 5 questions to complete.

 

 Buy/Download all MCQ Ebook >>>CLICK HERE<<<