Scribd
Upload
135 views7 pages

(Join AICTE Telegram Group) 22317-Data-Structure-Using - C-MCQ

This document contains a 22317 Data Structure Using ‘C’ MCQ test paper with multiple choice questions about data structures and algorithms. Some of the questions covered include different data structures like stacks, queues, trees, and graphs. Operations, applications, examples and properties of various linear and non-linear data structures are tested. Questions also cover concepts like recursion, algorithms, pointers and linked lists. The document provides the questions, possible answers and the correct answers.

Uploaded by

Vivek Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
135 views7 pages

(Join AICTE Telegram Group) 22317-Data-Structure-Using - C-MCQ

This document contains a 22317 Data Structure Using ‘C’ MCQ test paper with multiple choice questions about data structures and algorithms. Some of the questions covered include different data structures like stacks, queues, trees, and graphs. Operations, applications, examples and properties of various linear and non-linear data structures are tested. Questions also cover concepts like recursion, algorithms, pointers and linked lists. The document provides the questions, possible answers and the correct answers.

Uploaded by

Vivek Sharma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Msbtenews.

com

22317 Data Structure Using ‘C’ Mcq Test paper

State operations that can be performed on data structure


(a) Inserting:
(b) Deleting
(c) Searching
(d) Sorting
(e) all of the above ​Answer

Different types of trees?


(a) AVL tree
(b) Binary Tree
(c) Binary Search Tree
(d) all of the above ​Answer

Different types of graphs are?


(a) Heaps
(b) Directed graphs
(c) Undirected graphs
(d) Both (b) & (c) ​Answer

Enlist queue operation condition


(a) Queue Empty
(b) Queue Full
(c) Queue moderate
(d) Both (a) & (b) ​Answer

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

Example of Linear data structure


(a) stack
(b) queue
(c) tree
(d) Both (a) & (b) ​Answer

Example of Non-linear data structure


(a) Queue
(b) Tree
(c) Graph
(d) Both (b) & (c) ​Answer

State the following statements are True or False


When a stack is full and push operation is performed to insert a new element, stack is said to
be in overflow state
(a) True ​Answer
(b) False

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

Number of edges coming towards node is out-degree of node


(a) True
(b) False ​Answer

Reason: ​Number of edges coming towards node is In-degree of node

Number of edges going out from node is In-degree of node.


(a) True
(b) False ​Answer

Reason: ​Number of edges going out from node is Out-degree of node.

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

An undirected graph G is a graph in which each edge e is assigned a direction.


(a) True
(b) False ​Answer

Reason: ​An undirected graph G is a graph in which each edge e is not assigned a direction.

@ Front end is used to insert an element from queue


(a) True
(b) False ​Answer

Reason: ​Front end is used to delete element from queue

Rear end is used to delete an element in queue


(a) True
(b) False ​Answer

Reason:​ Rear end is used to insert an element in queue

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

Tree is a special case of graph having no loops, no circuits and no self-loops


(a) True ​Answer
(b) False

Graphs can have loops, circuits as well as can have self-loops.


(a) True ​Answer
(b) False

Array is a collection of elements of different data types?


(a) True
(b) False ​Answer

Reason: ​Array is a collection of elements of similar data type

Linked List is an ordered collection of elements of same type, which are connected to each
other using pointers
(a) True ​Answer
(b) False

Array can single dimensional, two dimensional or multidimensional


(a) True ​Answer
(b) False

Linked list can be a Linear (Singly), Doubly or Circular linked list.


(a) True ​Answer
(b) False

Array gets memory allocated in the Heap section


(a) True
(b) False ​Answer

the linked list gets memory allocated in the Stack section.


(a) True
(b) False ​Answer

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

Binary search is efficient for the Smaller array.


(a) True
(b) False ​Answer

Reason: ​Binary search is efficient for the larger array.

Linear search is efficient for the larger array.


(a) True
(b) False ​Answer

Reason: ​Linear search is efficient for the smaller array.

Algorithm is a stepwise set of instructions written to perform a specific task


(a) True ​Answer
(b) False

A node without any child node is called as leaf 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

In stack only two pointer is used called as front and rear


(a) True
(b) False ​Answer

Reason​:​ In stack only one pointer is used called as stack top

In Queue one pointers are used called as stack top


(a) True
(b) False ​Answer

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

Recursion is the process of calling a function by itself.


(a) True ​Answer
(b) False

Subtree of general tree are ordered


(a) True
(b) False ​Answer

Reason: ​Subtree of general tree are not ordered

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

For more Msbte Mcq Test paper visit ​https://msbtenews.com

You might also like