We have the best collection of Bin MCQs and answer with FREE PDF. These Bin 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.

Bin MCQs

1. What is the worst case time complexity of delete operation(n is the no. of candidates)?

a) O(1)

b) O(n)

c) O(log n)

d) O(n log n)

Answer: O(n)

2. What is the worst case time complexity of insertion operation(n =no. of candidates)?

a) O(1)

b) O(n)

c) O(log n)

d) O(n log n)

Answer: O(1)

3. What is computational geometry?

a) study of geometry using a computer

b) study of geometry

c) study of algorithms

d) study of algorithms related to geometry

Answer: study of algorithms related to geometry

4. What will be the time complexity of query operation if all the candidates are evenly spaced so that each bin has constant no. of candidates? (k = number of bins query rectangle intersects)

a) O(1)

b) O(k)

c) O(k2)

d) O(log k)

Answer: O(k)

5. What will be the time complexity of delete operation if all the candidates are evenly spaced so that each bin has constant no. of candidates? (m = number of bins intersecting candidate intersects)

a) O(1)

b) O(m)

c) O(m2)

d) O(log m)

Answer: O(m)

6. What will be the time complexity of insertion operation if all the candidates are evenly spaced so that each bin has constant no. of candidates? (m = number of bins intersecting candidate intersects)

a) O(1)

b) O(m)

c) O(m2)

d) O(log m)

Answer: O(m)

7. Efficiency of bin depends upon ___________

a) size of query and candidates

b) location of query and candidates

c) location and size of query and candidates

d) depends on the input

Answer: location and size of query and candidates

8. What is the use of the bin data structure?

a) to have efficient insertion

b) to have efficient deletion

c) to have efficient region query

d) to have efficient traversal

Answer: to have efficient region query

9. Bin is an example of a range query data structure.

a) true

b) false

Answer: true

10. What is the worst case time complexity of query operation(n is the no. of candidates)?

a) O(1)

b) O(n)

c) O(log n)

d) O(n log n)

Answer: O(n)

Bin MCQs PDF Download

Categories: Trees