A queue removes the oldest element first (FIFO), a stack removes the newest element first (LIFO) and a hash table is built for fast lookup. So p-ii, q-iii, r-i.
More Stacks, queues, linked lists, trees and hash tables questions
GATE 2024 DA Q21– Consider performing uniform hashing on an open address hash table with load factor = nm <…
GATE 2024 DA Q28– Consider the following tree traversals on a full binary tree: (i) Preorder (ii) Inorder…
GATE 2024 DA Q32– The fundamental operations in a double-ended queue D are: insertFirst(e) – Insert a new…
GATE 2024 DA Q52– Let H, I, L, and N represent height, number of internal nodes, number of leaf nodes, and…
GATE 2026 DA Q25– You are given the following Pre-order and In-order traversals of a Binary Tree T with…
GATE 2025 DA Q18– Consider a hash table of size 10 with indices \0, 1, , 9\, with the hash function h(x) =…