Hey Guys Welcome to CSE Study247
In this page provide you Data Structure MCQs SET-2 , Which is very useful of Many Exam Like semester , ISRO, DRDO, Banking , Railway etc.
Data Structure
A data structure is a specialized format for organizing, processing, retrieving and storing data. There are several basic and advanced types of data structures, all designed to arrange data to suit a specific purpose. Data structures make it easy for users to access and work with the data they need in appropriate ways.
❤️ TOP 500+ C Programming Question and Answer
Q.21 Which of the following concepts make extensive use of arrays?
Binary tree
Scheduling of processes
Caching
Spatial locality
Explanation
Spatial locality refers to the use of data elements within relatively close storage locations. Arrays, being contiguous in memory, benefit greatly from this concept.
Q.22 What is the order of a matrix?
number of rows x number of columns
number of columns x number of row
number of rows x number of rows
number of columns x number of columns
Explanation
The order (or dimension) of a matrix is always expressed as the number of rows multiplied by the number of columns (m x n).
Q.23 Process of inserting an element in stack is called
Push
Create
Evaluation
Pop
Explanation
The ‘Push’ operation is used to add an element to the top of a stack, while ‘Pop’ is used to remove the top element.
Q.24 The data structure required to check whether an expression contains balanced parenthesis is?
Stack
Queue
Array
Tree
Explanation
A stack is used because it follows the Last-In-First-Out (LIFO) principle, allowing us to match the most recently opened parenthesis with the next closing one.
Q.25 Which data structure is needed to convert infix notation to postfix notation?
Branch
Queue
Stack
Tree
Explanation
A stack is required during infix-to-postfix conversion to temporarily hold operators and parentheses based on their precedence rules.
Q.26 A linear collection of data elements where the linear node is given by means of pointer is called?
Linked List
Node List
Primitive list
None of the mentioned
Explanation
A Linked List is a linear data structure where each element (node) contains a data field and a pointer (reference) to the next node in the sequence.
Q.27 A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as a?
Linked List
Stack
Tree
Queue
Explanation
A Queue is a First-In-First-Out (FIFO) data structure where elements are added at the ‘rear’ and removed from the ‘front’.
Q.28 Which of the following is false about a doubly linked list?
We can navigate in both the directions
It require more space than a singly linked list
The insertion and deletion of a node take a bit longer
None of the mentioned
Explanation
All the listed statements are true: Doubly linked lists allow bidirectional traversal, require extra memory for the previous pointer, and involve more pointer updates during operations.
Q.29 What differentiates a circular linked list from normal linked list?
You cannot have the next pointer point to null in a circular linked list
It is faster to traverse the circular linked list
You may or may not have the next pointer point to null in a circular linked list
All of the mentioned
Explanation
In a circular linked list, the last node points back to the first node (or a header node) instead of pointing to NULL, making the list a continuous circle.
Q.30 What is the complexity of searching for a particular element in a singly linked list?
O(n)
O(1)
log n
n log n
Explanation
In a singly linked list, searching requires a linear scan from the head to the desired element, resulting in a worst-case time complexity of O(n).
Q.32 Binary trees can have how many children?
2
Any number of children
0 or 1 or 2
0 or 1
Explanation
By definition, a node in a binary tree can have a maximum of two children, meaning it can have zero, one, or two children.
Q.33 What is the time complexity of pre-order traversal in the iterative fashion?
O(1)
O(n)
O(log n)
O(n log n)
Explanation
Whether iterative or recursive, a pre-order traversal must visit every node in the tree exactly once, resulting in O(n) time complexity.
Q.34 Which of the following is false about a binary search tree?
The left child is always lesser than its parent
The right child is always greater than its parent
The left and right subtree should also be binary search tree
None of the mentioned
Explanation
All statements are true properties of a Binary Search Tree (BST): left nodes are smaller, right nodes are larger, and the subtrees must also adhere to these rules.
Q.35 What is an external sorting algorithm?
Algorithm that uses tape or disk during the sort
Algorithm that uses main memory during the sort
Algorithm that involves swapping
Algorithm that are considered in place
Explanation
External sorting is used when the data being sorted does not fit into the main memory (RAM) and must be handled in chunks using external storage like disks or tapes.
Q.36 Quick sort can be categorized into which of the following?
Brute force technique
Divide and conquer
Greedy algorithm
Dynamics programming
Explanation
Quick sort is a divide-and-conquer algorithm that picks a ‘pivot’ element and partitions the array into two sub-arrays according to whether elements are less than or greater than the pivot.
Q.37 What is the number of edges present in a complete graph having n vertices?
(n*(n+1))/2
(n*(n-1))/2
n
Information given is insufficient
Explanation
In a complete graph, every vertex is connected to every other vertex. The total number of edges is calculated using the combination formula nC2, which is n(n-1)/2.
Q.38 A connected planar graph having 6 vertices and 7 edges contains ——– regions.
15
3
1
11
Explanation
According to Euler’s formula for planar graphs (V – E + R = 2), we have 6 – 7 + R = 2, which simplifies to -1 + R = 2, so R = 3.
Q.39 Depth first search is equivalent to which of the traversal in the binary tree?
pre-order traversal
post-order traversal
level-order traversal
in-order traversal
Explanation
Depth First Search (DFS) on a tree follows a path as deep as possible before backtracking, which is conceptually equivalent to a pre-order traversal.