| List I | List II | ||
|---|---|---|---|
| 1 | FIFO | a | Stack |
| 2 | Look up op. | b | Queue |
| 3 | Last-In first out | c | Hash table |
Answers: 1-b, 2-c, 3-a
| Column 1 | Column 2 | ||
| (p) | First In First Out | (i) | Stacks |
| (q) | Lookup Operation | (ii) | Queues |
| (r) | Last In First Out | (iii) | Hash Tables |
Consider a hash table π[0, 1, β¦ , 10] that is initially empty. The hash table is
maintained using open addressing with linear probing. The hash function used is
β(π₯) = (π₯+ 7) mod 11.
Consider the following sequence of insertions performed on π:
1, 13, 22, 15, 11, 24
Which of the following positions in the hash table is/are empty after these insertions
are performed?