Data Structures GATE Questions with Answers Pdf - 1

Question: 1

A terminal node in a binary tree is called

(A) branch

(B) child

(C) leaf

(D) root

Question: 2

_____ is a collection of elements such that each element has been assigned a processing priority.

(A) Main queue

(B) Interrupt queue

(C) Procedure queue

(D) Priority queue

Question: 3

Herder node is used as sentinel in

(A) binary tree

(B) queues

(C) graphs

(D) stacks

Question: 4

A _____ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.

(A) stacks linked list

(B) queue linked list

(C) both of them

(D) neither of them

Question: 5

Before deletion condition into stack _____ has to be checked.

(A) underflow

(B) overflow

(C) maximum elements

(D) existing elements