Data-Structures

Question 50

The most appropriate matching for the following pairs

          X: depth first search            1: heap
          Y: breadth-first search          2: queue
          Z: sorting                       3: stack

A	X – 1 Y – 2 Z – 3
B	X – 3 Y – 1 Z – 2
C	X – 3 Y – 2 Z – 1
D	X – 2 Y – 3 Z – 1

Data-StructuresMatch-the-FollowingGATE 2000

Question 50 Explanation:

Stack is used in depth first search.
Queue is used in breadth-first search.
Heap is used in heap.

Correct Answer: C

Question 50 Explanation:

Stack is used in depth first search.
Queue is used in breadth-first search.
Heap is used in heap.

Question 10242 – Programming

Question 9825 – GATE 2000

Question 10242 – Programming

Question 9825 – GATE 2000

Related posts

ISO-OSI-layers