# Bin Multiple Choice Questions and Answers (MCQs)

This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Bin”.

**1. 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**

Explanation: The analysis of algorithms that can be represented in terms of geometry is known as computational geometry. A good example is the bin data structure.

**2. 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(k^{2})

D) O(log k)

Explanation: When the number of candidates is evenly distributed among the bins, the query process becomes faster. The question procedure becomes O in this situation (k).

**3. 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(m^{2})

D) O(log m)

Explanation: When the number of candidates is evenly distributed among the bins, the deletion process becomes quicker. The question procedure becomes O in this situation (m). In this case, it is almost as slow as insertion.

**4. 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(m^{2})

D) O(log m)

Explanation: When the number of candidates is evenly distributed among the bins, the insertion process becomes faster. The question procedure becomes O in this situation (m). In this case, it is essentially quicker than deletion.

**5. 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

Explanation: The effectiveness of the bin is determined by the position and size of the query and candidates. It works in a similar way to a hash table.

**6. Bigger the query rectangle the better is the query efficiency.**

A) true**B) false**

Explanation: The effectiveness of the bin is determined by the position and size of the query and candidates. Often, the narrower the query rectangle, the more efficient the query.

**7. 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

Explanation: We can perform effective region queries thanks to the bin data structure. Every time a data point falls into a bin, the frequency of the bin is increased by one.

**8. Bin is an example of a range query data structure.****A) true**

B) false

Explanation: A range query data structure is an example of a bin. It’s because it can quickly respond to a large number of queries on any subset of the data.

**9. 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)

Explanation: In a bin question, the worst case scenario is when all of the candidates are concentrated in one bin. As a result, the time complexity in this case is O. (n).

**10. 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)

Explanation: When all of the candidates are concentrated in one bin, the worst case scenario in a bin delete process occurs. As a result, the time complexity in this case is O. (n).

**11. 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)

Explanation: When all of the candidates are concentrated in one bin, the worst case scenario in a bin insert process occurs. As a result, the time complexity in this case is O. (1).

BIN stands for “Buy It Now.” The abbreviation BIN, which stands for “Buy It Now,” is commonly used on online shopping and auction sites like eBay to signify that an item is available for a set price. Regular eBay users say that there are few bargains to be had while paying the BIN price. The initial collection of four to six numbers on a payment card is referred to as the bank identification number (BIN). This collection of numbers specifies the card’s issuing institution and is crucial in the process of matching transactions to the charge card’s issuer.