8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download
Search MCQ | Topic | Course
→ Computer Science Engineering (CSE) → Data Structures (DS) → Set 4
213 101.5k 9 Save
550+ Data Structures (DS) Solved MCQs
These multiple-choice questions (MCQs) are designed to enhance your knowledge and understanding in the
following areas: Computer Science Engineering (CSE) , Information Technology Engineering (IT) , Bachelor of
Science in Computer Science FY (BSc CS) , Bachelor of Science in Information Technology FY (BSc IT) , Bachelor of
Computer Applications (BCA) .
Chapters
Linear Data Structures - List
Linear Data Structures -Stacks and Queues
Non Linear Data Structures - Trees
Non Linear Data Structures - Graphs
Searching, Sorting and Hashing Techniques
More MCQs
Take a Test
Hide answers 4 of 12 Sets
Chapter: Non Linear Data Structures - Graphs
151. Which of the following is true?
A. A graph may contain no edges and many vertices
B. A graph may contain many edges and no vertices
C. A graph may contain no edges and no vertices
D. A graph may contain no vertices and many edges
Answer» B. A graph may contain many edges and no vertices
discuss
https://mcqmate.com/topic/data-structures?page=4 1/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download
152. For a given graph G having v vertices and e edges which is connected and has no cycles, which
of the following statements is true?
A. v=e
B. v = e+1
C. v + 1 = e
D. v = e-1
Answer» B. v = e+1
discuss
153. For which of the following combinations of the degrees of vertices would the connected graph
be eulerian?
A. 1,2,3
B. 2,3,4
C. 2,4,5
D. 1,3,5
Answer» A. 1,2,3
discuss
154. A graph with all vertices having equal degree is known as a
A. Multi Graph
B. Regular Graph
C. Simple Graph
D. Complete Graph
Answer» B. Regular Graph
discuss
155. Which of the following ways can be used to represent a graph?
A. Adjacency List and Adjacency Matrix
B. Incidence Matrix
C. Adjacency List, Adjacency Matrix as well as Incidence Matrix
D. No way to represent
Answer» C. Adjacency List, Adjacency Matrix as well as Incidence Matrix
discuss
https://mcqmate.com/topic/data-structures?page=4 2/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download
156. The number of possible undirected graphs which may have self loops but no multiple edges and
have n vertices is
A. 2((n*(n-1))/2)
B. 2((n*(n+1))/2)
C. 2((n-1)*(n-1))/2)
D. 2((n*n)/2)
Answer» D. 2((n*n)/2)
discuss
157. Given a plane graph, G having 2 connected component, having 6 vertices, 7 edges and 4
regions. What will be the number of connected components?
A. 1
B. 2
C. 3
D. 4
Answer» B. 2
discuss
158. Number of vertices with odd degrees in a graph having a eulerian walk is
A. 0
B. Can’t be predicted
C. 2
D. either 0 or 2
Answer» D. either 0 or 2
discuss
https://mcqmate.com/topic/data-structures?page=4 3/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download
159. How many of the following statements are correct?
A. All cyclic graphs are complete graphs.
B. All complete graphs are cyclic graphs.
C. All paths are bipartite.
D. All cyclic graphs are bipartite.
Answer» B. All complete graphs are cyclic graphs.
discuss
160. What is the number of vertices of degree 2 in a path graph having n vertices,here n>2.
A. n-2
B. n
C. 2
D. 0
Answer» A. n-2
discuss
161. What would the time complexity to check if an undirected graph with V vertices and E edges is
Bipartite or not given its adjacency matrix?
A. O(E*E)
B. O(V*V)
C. O(E)
D. O(V)
Answer» B. O(V*V)
discuss
https://mcqmate.com/topic/data-structures?page=4 4/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download
162. With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?
A. (V*(V-1))/2
B. (V*(V+1))/2
C. (V+1)C2
D. (V-1)C2
Answer» A. (V*(V-1))/2
discuss
163. The topological sorting of any DAG can be done in time.
A. cubic
B. quadratic
C. linear
D. logarithmic
Answer» C. linear
discuss
164. If there are more than 1 topological sorting of a DAG is possible, which of the following is true.
A. Many Hamiltonian paths are possible
B. No Hamiltonian path is possible
C. Exactly 1 Hamiltonian path is possible
D. Given information is insufficient to comment anything
Answer» B. No Hamiltonian path is possible
discuss
165. Which of the given statement is true?
A. All the Cyclic Directed Graphs have topological sortings
B. All the Acyclic Directed Graphs have topological sortings
C. All Directed Graphs have topological sortings
D. All the cyclic directed graphs have non topological sortings
Answer» D. All the cyclic directed graphs have non topological sortings
discuss
https://mcqmate.com/topic/data-structures?page=4 5/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download
166. What is the value of the sum of the minimum in-degree and maximum out-degree of an
Directed Acyclic Graph?
A. Depends on a Graph
B. Will always be zero
C. Will always be greater than zero
D. May be zero or greater than zero
Answer» B. Will always be zero
discuss
Chapter: Searching, Sorting and Hashing Techniques
167. What is the best case for linear search?
A. O(nlogn)
B. O(logn)
C. O(n)
D. O(1)
Answer» D. O(1)
discuss
168. What is the worst case for linear search?
A. O(nlogn)
B. O(logn)
C. O(n)
D. O(1)
Answer» C. O(n)
discuss
169. What is the best case and worst case complexity of ordered linear search?
A. O(nlogn), O(logn)
B. O(logn), O(nlogn)
C. O(n), O(1)
D. O(1), O(n)
Answer» D. O(1), O(n)
discuss
https://mcqmate.com/topic/data-structures?page=4 6/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download
170. Which of the following is a disadvantage of linear search?
A. Requires more space
B. Greater time complexities compared to other searching algorithms
C. Not easy to understand
D. Not easy to implement
Answer» B. Greater time complexities compared to other searching algorithms
discuss
171. What is the advantage of recursive approach than an iterative approach?
A. Consumes less memory
B. Less code and easy to implement
C. Consumes more memory
D. More code has to be written
Answer» B. Less code and easy to implement
discuss
172. Given an input arr = {2,5,7,99,899}; key = 899; What is the level of recursion?
A. 5
B. 2
C. 3
D. 4
Answer» C. 3
discuss
https://mcqmate.com/topic/data-structures?page=4 7/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download
173. Given an array arr = {45,77,89,90,94,99,100} and key = 99; what are the mid
values(corresponding array elements) in the first and second levels of recursion?
A. 90 and 99
B. 90 and 94
C. 89 and 99
D. 89 and 94
Answer» A. 90 and 99
discuss
174. What is the worst case complexity of binary search using recursion?
A. O(nlogn)
B. O(logn)
C. O(n)
D. O(n2)
Answer» B. O(logn)
discuss
175. What is the average case time complexity of binary search using recursion?
A. O(nlogn)
B. O(logn)
C. O(n)
D. O(n2)
Answer» B. O(logn)
discuss
https://mcqmate.com/topic/data-structures?page=4 8/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download
176. Which of the following is not an application of binary search?
A. To find the lower/upper bound in an ordered sequence
B. Union of intervals
C. Debugging
D. To search in unordered list
Answer» D. To search in unordered list
discuss
177. Binary Search can be categorized into which of the following?
A. Brute Force technique
B. Divide and conquer
C. Greedy algorithm
D. Dynamic programming
Answer» B. Divide and conquer
discuss
178. Given an array arr = {5,6,77,88,99} and key = 88; How many iterations are done until the
element is found?
A. 1
B. 3
C. 4
D. 2
Answer» D. 2
discuss
179. Given an array arr = {45,77,89,90,94,99,100} and key = 100; What are the mid
values(corresponding array elements) generated in the first and second iterations?
A. 90 and 99
B. 90 and 100
C. 89 and 94
D. 94 and 99
Answer» A. 90 and 99
discuss
https://mcqmate.com/topic/data-structures?page=4 9/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download
180. What is the time complexity of binary search with iteration?
A. O(nlogn)
B. O(logn)
C. O(n)
D. O(n2)
Answer» B. O(logn)
discuss
181. What is an external sorting algorithm?
A. Algorithm that uses tape or disk during the sort
B. Algorithm that uses main memory during the sort
C. Algorithm that involves swapping
D. Algorithm that are considered ‘in place’
Answer» A. Algorithm that uses tape or disk during the sort
discuss
182. What is an internal sorting algorithm?
A. Algorithm that uses tape or disk during the sort
B. Algorithm that uses main memory during the sort
C. Algorithm that involves swapping
D. Algorithm that are considered ‘in place’
Answer» B. Algorithm that uses main memory during the sort
discuss
https://mcqmate.com/topic/data-structures?page=4 10/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download
183. What is the worst case complexity of bubble sort?
A. O(nlogn)
B. O(logn)
C. O(n)
D. O(n2)
Answer» D. O(n2)
discuss
184. What is the average case complexity of bubble sort?
A. O(nlogn)
B. O(logn)
C. O(n)
D. O(n2)
Answer» D. O(n2)
discuss
185. Which of the following is not an advantage of optimised bubble sort over other sorting
techniques in case of sorted elements?
A. It is faster
B. Consumes less memory
C. Detects whether the input is already sorted
D. Consumes less time
Answer» C. Detects whether the input is already sorted
discuss
https://mcqmate.com/topic/data-structures?page=4 11/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download
186. The given array is arr = {1, 2, 4, 3}. Bubble sort is used to sort the array elements. How many
iterations will be done to sort the array?
A. 4
B. 2
C. 1
D. 0
Answer» A. 4
discuss
187. What is the best case efficiency of bubble sort in the improvised version?
A. O(nlogn)
B. O(logn)
C. O(n)
D. O(n2)
Answer» C. O(n)
discuss
188. The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many
iterations will be done to sort the array with improvised version?
A. 4
B. 2
C. 1
D. 0
Answer» B. 2
discuss
189. What is an in-place sorting algorithm?
A. It needs O(1) or O(logn) memory to create auxiliary locations
B. The input is already sorted and in-place
C. It requires additional storage
D. It requires additional space
Answer» A. It needs O(1) or O(logn) memory to create auxiliary locations
discuss
https://mcqmate.com/topic/data-structures?page=4 12/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download
190. In the following scenarios, when will you use selection sort?
A. The input is already sorted
B. A large file has to be sorted
C. Large values need to be sorted with small keys
D. Small values need to be sorted with large keys
Answer» C. Large values need to be sorted with small keys
discuss
191. What is the worst case complexity of selection sort?
A. O(nlogn)
B. O(logn)
C. O(n)
D. O(n2)
Answer» D. O(n2)
discuss
192. What is the advantage of selection sort over other sorting techniques?
A. It requires no additional storage space
B. It is scalable
C. It works best for inputs which are already sorted
D. It is faster than any other sorting technique
Answer» A. It requires no additional storage space
discuss
https://mcqmate.com/topic/data-structures?page=4 13/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download
193. What is the average case complexity of selection sort?
A. O(nlogn)
B. O(logn)
C. O(n)
D. O(n2)
Answer» D. O(n2)
discuss
194. What is the disadvantage of selection sort?
A. It requires auxiliary memory
B. It is not scalable
C. It can be used for small keys8
D. It takes linear time to sort the elements
Answer» B. It is not scalable
discuss
195. The given array is arr = {3,4,5,2,1}. The number of iterations in bubble sort and selection sort
respectively are,
A. 5 and 4
B. 4 and 5
C. 2 and 4
D. 2 and 5
Answer» A. 5 and 4
discuss
https://mcqmate.com/topic/data-structures?page=4 14/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download
196. The given array is arr = {1,2,3,4,5}. (bubble sort is implemented with a flag variable)The number
of iterations in selection sort and bubble sort respectively are,
A. 5 and 4
B. 1 and 4
C. 0 and 4
D. 4 and 1
Answer» D. 4 and 1
discuss
197. What is the best case complexity of selection sort?
A. O(nlogn)
B. O(logn)
C. O(n)
D. O(n2)
Answer» D. O(n2)
discuss
198. Shell sort is also known as
A. diminishing decrement sort
B. diminishing increment sort
C. partition exchange sort
D. diminishing insertion sort
Answer» B. diminishing increment sort
discuss
199. Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting
algorithm.
A. Both statements are true
B. Statement 2 is true but statement 1 is false
C. Statement 2 is false but statement 1 is true
D. none
Answer» B. Statement 2 is true but statement 1 is false
discuss
https://mcqmate.com/topic/data-structures?page=4 15/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download
200. Shell sort is applied on the elements 27 59 49 37 15 90 81 39 and the chosen decreasing
sequence of increments is (5,3,1). The result after the first iteration will be
A. 27 59 49 37 15 90 81 39
B. 27 59 37 49 15 90 81 39
C. 27 59 39 37 15 90 81 49
D. 15 59 49 37 27 90 81 39
Answer» C. 27 59 39 37 15 90 81 49
discuss
1 2 3 4 5 6 7 jump to 1-12
Done Studing? Take A Test.
Great job completing your study session! Now it's time to put your knowledge to the test. Challenge yourself, see how
much you've learned, and identify areas for improvement. Don’t worry, this is all part of the journey to mastery. Ready
for the next step? Take a quiz to solidify what you've just studied.
Take a Test
Related Topics *
Problem Solving and Python Programming
Multi-core processors
https://mcqmate.com/topic/data-structures?page=4 16/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download
Discrete Mathematics
Security in Computing
Computer Networking (CN)
Operations Research
Green Computing (GC)
Information Retrival Techniques
Basics of Database Management System (DBMS)
Information systems and engineering economics
Dot Net Architecture and Program
Internet of Things (IoT)
Information and Network Security
Theory of Computation
Advanced Web Technologies
More in
Computer Science Engineering (CSE)
Information Technology Engineering (IT)
Bachelor of Science in Computer Science FY (BSc CS)
Bachelor of Science in Information Technology FY (BSc IT)
Bachelor of Computer Applications (BCA)
Bachelor of Science in Information Technology (BSc IT)
Bachelor of Science in Computer Science (BSc CS)
Your recent visits
Topic: Data Structures (DS)
Topic: Operating System (OS)
Topic: System Software
https://mcqmate.com/topic/data-structures?page=4 17/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download
Course: Bachelor of Science in Computer Science (BSc CS)
McqMate
McqMate.com is an educational platform, Which is developed BY STUDENTS, FOR STUDENTS, The main objective of
our platform is to assist fellow students in preparing for exams and in their Studies throughout their Academic career.
MCQMATE IS ALSO AVAILABLE ON
Resources
Forum
You Tube
UPSC - Union Public Service Commission
MBA
Contacts
Email: [email protected]
Privacy & Cookies Policy Disclaimer
© Copyright 2025 McqMate. All rights reserved.
https://mcqmate.com/topic/data-structures?page=4 18/18
