Register

BARC 2026 CS | Memory Based Questions | GO Classes | Question: 2

• retagged by
298 views
0 0 votes

Consider a hash table with $100$ slots. Collisions are resolved using chaining. Assuming simple uniform hashing, what is the probability that the first $3$ slots are unfilled after the first $3$ insertions?

  1. $(97 \times 97 \times 97) / 100^3$
     
  2. $(99 \times 98 \times 97) / 100^3$
     
  3. $(97 \times 96 \times 95) / 100^3$
     
  4. $(97 \times 96 \times 95 / (3! \times 100^3)$

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
Answer:
← Previous · BARC 2026 CS | Memor...Next → · BARC 2026 CS | Memor...
← Previous in category · BARC 2026 CS | Memor...Next in category → · BARC 2026 CS | Memor...
Position:
Show:

Related questions

1 1 vote
1 1 answer
265
265 views
GO Classes asked Mar 17
265 views
BARC 2026 CS | Memory Based Questions | GO Classes | Question: 5
Consider the following function that reverses a singly linked list.Node* reverseList(Node* head) { Node* prev = NULL; Node* current = head; Node* next = NULL;...
0 0 votes
1 1 answer
267
267 views
GO Classes asked Mar 17
267 views
BARC 2026 CS | Memory Based Questions | GO Classes | Question: 6
Consider the following function:void f(stack S) { int x ; if (!isEmpty(S)) { x = pop(S); f(S); push(S, x); } }What operation is performed by t...
1 1 vote
1 1 answer
251
251 views
GO Classes asked Mar 17
251 views
BARC 2026 CS | Memory Based Questions | GO Classes | Question: 7
Consider inserting the following sequence of keys into an initially empty AVL tree:$$38,53,42,26,33,60,79,21,20$$During the construction of the AVL tree, rotations are pe...
1 1 vote
1 1 answer
265
265 views
GO Classes asked Mar 17
265 views
BARC 2026 CS | Memory Based Questions | GO Classes | Question: 8
A queue initially contains the elements (from front to rear):$$1~2~3~4~5~6$$An empty stack is also available. The following operations can be performed:Dequeue an element...