Question:

Match List I with List II
LIST I LIST II
A. Stack IV. LIFO
B. EOF III. Exception
C. Tree II. Non-linear Data Structure
D. Queue I. FIFO

LIST I	LIST II
A. Stack	IV. LIFO
B. EOF	III. Exception
C. Tree	II. Non-linear Data Structure
D. Queue	I. FIFO

Show Hint

In data structures, understanding the different ordering principles (LIFO vs FIFO) helps in identifying stack and queue operations.

Updated On: Apr 24, 2025

A-IV, B-III, C-II, D-I
A-II, B-III, C-IV, D-I
A-I, B-II, C-III, D-IV
A-IV, B-III, C-I, D-II

Hide Solution

Verified By Collegedunia

The Correct Option is A

Solution and Explanation

- A. Stack follows LIFO (Last In, First Out) order, so it matches with IV.
- B. EOF (End Of File) is related to handling the end of file, which is an exception, so it matches with III.
- C. A Tree is a non-linear data structure, so it matches with II.
- D. A Queue follows FIFO (First In, First Out) order, so it matches with I.
Thus, the correct matching is A-IV, B-III, C-II, D-I.

Was this answer helpful?

Top Questions on Data Structures

Consider a directed graph \( G = (V,E) \), where \( V = \{0,1,2,\dots,100\} \) and
\[ E = \{(i,j) : 0 < j - i \leq 2, \text{ for all } i,j \in V \}. \] Suppose the adjacency list of each vertex is in decreasing order of vertex number, and depth-first search (DFS) is performed at vertex 0. The number of vertices that will be discovered after vertex 50 is:
- GATE DA - 2025
- Computer Science
- Data Structures
View Solution

Consider the following pseudocode.

Create empty stack S
Set x = 0, flag = 0, sum = 0
Push x onto S
while (S is not empty){
    if (flag equals 0){
        Set x = x + 1
        Push x onto S
    }
    if (x equals 8):
        Set flag = 1
    if (flag equals 1){
        x = Pop(S)
        if (x is odd):
            Pop(S)
        Set sum = sum + x
    }
}
Output sum

The value of \( sum \) output by a program executing the above pseudocode is:

View Solution

View More Questions

Questions Asked in CUET exam