GATE DA 2024 Set 1 — Question 16
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.MCQ+1 / -0.33EasyStack Operations & ApplicationsStacks & QueuesProgramming, Data Structures & AlgorithmsQueue Operations & ApplicationsHashing & Hash TablesLinked Lists & Hashing
Programming, Data Structures & Algorithms → Linked Lists & Hashing → Hashing & Hash Tables
Last updated
Question
Match the items in Column 1 with the items in Column 2 in the following table:
| Column 1 | Column 2 |
|---|---|
| (p) First In First Out | (i) Stacks |
| (q) Lookup Operation | (ii) Queues |
| (r) Last In First Out | (iii) Hash Tables |
Correct answer
(A) (p) − (ii), (q) − (iii), (r) − (i)
Solution
1.First In First Out (FIFO) is the principle used in Queues (ii).
2.Lookup Operation is efficiently performed (often ) in Hash Tables (iii).
3.Last In First Out (LIFO) is the principle used in Stacks (i).
Therefore, the correct matching is (p) − (ii), (q) − (iii), (r) − (i).Continue learning with Success Tracker
A step still unclear? Work through it with support
Use Success Tracker to ask about the reasoning, then try another GATE DA question to check your understanding.
AI-powered practice· Unlimited practice on eligible plans
- PYQs with solutions
- Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
- Practice that adapts
- Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
- AI doubt support
- Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.
Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.
This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.
More questions on Linked Lists & Hashing
2026 Set 1 Q15Consider that the quick sort algorithm is used to sort an array of distinct randomly ordered…2026 Set 1 Q16Consider the given Python program. [code] Which of the following is the correct output of this…2026 Set 1 Q25You are given the following Pre-order and In-order traversals of a Binary Tree T with nodes E, F,…2026 Set 1 Q31Let A be a sorted array containing 1000 distinct integers. You perform a recursive binary search on…2026 Set 1 Q39A recursive function in Python is given. [code] Now, consider the following function call:…