We have the best collection of Direct Addressing Tables MCQs and answer with FREE PDF. These Direct Addressing Tables MCQs will help you to prepare for any competitive exams like: BCA, MCA, GATE, GRE, IES, PSC, UGC NET, DOEACC Exams at all levels – you just have to practice regularly.

Direct Addressing Tables MCQs

1. What is the time complexity to insert an element into the direct address table?

a) O(n)

b) O(logn)

c) O(nlogn)

d) O(1)

Answer: O(1)

2. What is the advantage of using a dynamic set in direct addressing?

a) It saves time

b) It saves space

c) It saves both time and space

d) It reduces code complexity

Answer: It saves space

3. What is the time complexity to delete an element from the direct address table?

a) O(n)

b) O(logn)

c) O(nlogn)

d) O(1)

Answer: O(1)

4. How is a bit vector better compared to a normal array for implementing the hash table?

a) It saves time

b) It saves space

c) It saves both time and space

d) It reduces code complexity

Answer: It saves space

5. What is direct addressing?

a) Distinct array position for every possible key

b) Fewer array positions than keys

c) Fewer keys than array positions

d) Distinct array positions for keys based on priority

Answer: Distinct array position for every possible key

6. When is it appropriate to use direct addressing?

a) When the array is comparatively large

b) When the universe U of keys is reasonably small

c) When the universe U of keys is reasonably large

d) When the array is comparatively small

Answer: When the universe U of keys is reasonably small

7. What is the search complexity in direct addressing?

a) O(n)

b) O(logn)

c) O(nlogn)

d) O(1)

Answer: O(1)

Direct Addressing Tables MCQs PDF Download

Categories: Hash Tables