Skip to content

Tag Archives: Data Structures-Misc

Which of the following data structures is best suited for efficient implementation of priority queue? (A) Array (B) Linked List (C) Heap (D) Stack Answer:… Read More
Consider a situation where a client receives packets from a server. There may be differences in speed of the client and the server. Which data… Read More
Which data structure is best suited for converting recursive implementation to iterative implementation of an algorithm? (A) Queue (B) Stack (C) Tree (D) Graph Answer:… Read More
Which among the following data structures is best suited for storing very large numbers (numbers that cannot be stored in long long int). Following are… Read More
The most appropriate matching for the following pairs X: depth first search 1: heap Y: breadth-first search 2: queue Z: sorting 3: stack is (GATE… Read More
A data structure is required for storing a set of integers such that each of the following operations can be done in (log n) time,… Read More
The best data structure to check whether an arithmetic expression has balanced parentheses is a (GATE CS 2004) (A) queue (B) stack (C) tree (D)… Read More
Which data structure is most efficient to find the top 10 largest items out of 1 million items stored in file? (A) Min heap (B)… Read More
Which data structure is used in redo-undo feature? (A) Stack (B) Queue (C) Tree (D) Graph Answer: (A) Explanation: Stack data structure is most suitable… Read More
Which data structure is used for balancing of symbols? (A) Stack (B) Queue (C) Tree (D) Graph Answer: (A) Explanation: Stack is used for balancing… Read More