(Join AICTE Telegram Group) 22317-Data-Structure-Using - C-MCQ
(Join AICTE Telegram Group) 22317-Data-Structure-Using - C-MCQ
com
Applications of queue.
(a) Used for CPU scheduling in multiprogramming and time sharing systems.
(b) It is used as buffers on MP3 players
(c) Handling of interrupts in real-time systems
(d) Simulation
(e) all of the above Answer
Application of Stack
(a) In mobile devices for sending and receiving messages.
(b) Recursion
(c) Polish notation
(d) Both (b) & (c) Answer
Application of Queue
(a) In computer systems for organizing processes.
(b) In mobile devices for sending and receiving messages.
(c) Polish notation
(d) Both (a) & (b) Answer
When there is no element in a stack (stack empty) and pop operation is called then stack is
said to underflow state
(a) True Answer
(b) False
A directed graph is defined as the set of ordered pair of vertices and edges where each
connected edge has not assigned a direction
(a) True
(b) False Answer
Reason: A directed graph is defined as the set of ordered pair of vertices and edges where
each connected edge has assigned a direction
Reason: An undirected graph G is a graph in which each edge e is not assigned a direction.
Tree is a special form of graph i.e. minimally connected graph and having only one path
between any two vertices.
(a) True Answer
(b) False
In graph there can be more than one path i.e. graph can have unidirectional or bidirectional
paths (edges) between nodes
(a) True Answer
(b) False
Linked List is an ordered collection of elements of same type, which are connected to each
other using pointers
(a) True Answer
(b) False
Binary tree is a nonlinear data structure in which each non-leaf node can have maximum two
child nodes as left child and right child
(a) True Answer
(b) False
A data structure in which all data elements are stored in a sequence is known as linear data
structure.
(a) True Answer
(b) False
A data structure in which all data elements are not stored in a sequence is known as
non-linear data structure.
(a) True Answer
(b) False
In Linear data structure All elements are stored in non-contiguous memory locations inside
memory.
(a) True
(b) False Answer
Reason: In Linear data structure All elements are stored in contiguous memory locations
inside memory.
In Non-linear data structure All elements may stored in contiguous memory locations inside
memory
(a) True
(b) False Answer
Reason: In Non-linear data structure All elements may stored in non-contiguous memory
locations inside memory
Indegree of node is the number of edges coming towards a specified node i.e. number of
edges that have that specified node as the head is known as indegree of a node.
(a) True Answer
(b) False
Outdegree of node is number of edged going out from a specified node i.e. number of edges
that have that specified node as the tail is known as outdegree of a node
(a) True Answer
(b) False
Stack is a data structure in which insertion and deletion operations are performed at the
different end.
(a) True
(b) False Answer
Reason: Stack is a data structure in which insertion and deletion operations are performed
at the same end.
Queue is a data structure in which insertion and deletion operations are performed at same
ends.
(a) True
(b) False Answer
Reason: Queue is a data structure in which insertion and deletion operations are performed
at different ends
In stack an element inserted last is deleted first so it is called Last In First Out list.
(a) True Answer
(b) False
@ In Queue an element inserted first is deleted first so it is called First In First Out list.
(a) True Answer
(b) False
Reason: In Queue two pointers are used called as front and rear
Next pointer is a pointer that holds address of next node in the list i.e. next pointer points to
next node in the list
(a) True Answer
(b) False
Null pointer is a pointer that does not hold any memory address i.e. it is pointing to nothing.
(a) True Answer
(b) False
Each linked list has a header node. When the header node contains NULL value, then that
list is said to be an empty list.
(a) True Answer
(b) False
A Binary tree is a data structure in which each node has at most two nodes i.e. left and right
(a) True Answer
(b) False