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 5

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 5 of 12 Sets

Chapter: Searching, Sorting and Hashing Techniques

201. Shell sort is an improvement on

A. insertion sort

B. selection sort

C. binary tree sort

D. quick sort

Answer» A. insertion sort

discuss

https://mcqmate.com/topic/data-structures?page=5 1/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download

202. An array that is first 7-sorted, then 5-sorted becomes

A. 7-ordered

B. 5-ordered

C. both 2-ordered and 5-ordered

D. both 7-ordered and 5-ordered

Answer» D. both 7-ordered and 5-ordered

discuss

203. If Hibbard increments (h1= 1, h2= 3, h3= 7, …, hk = 2k–1) are used in a Shell
sortimplementation, then the best case time complexity will be

A. O(nlogn)

B. O(n)

C. O(n2)

D. O(logn)

Answer» A. O(nlogn)
discuss

204. Records R1, R2, R3,.. RN with keys K1, K2, K3,.. KN are said to be h-ordered, if

A. Ki <= Ki+h for 1<= i*h <= N

B. Kh <= Ki+h for 1<= i <= N

C. Ki <= Kh for 1<= i <= h

D. Ki <= Ki+h for 1<= i <= N-h

Answer» D. Ki <= Ki+h for 1<= i <= N-h

discuss

205. Which of the following is true?

Shell sort’s passes completely sort the elements before going on to the next-smallest gap while Comb sort’s
A.
passes do not completely sort the elements

Shell sort’s passes do not completely sort the elements before going on to the next-smallest gap like in Comb
B.
sort

C. Comb sort’s passes completely sort the elements before going on to the next-smallest gap like in Shell sort

Shell sort’s passes do not completely sort the elements before going on to the next-smallest gap while Comb
D.
sort’s passes completely sort the elements

Answer» A. Shell sort’s passes completely sort the elements before going on to the next-smallest gap while Comb
sort’s passes do not completely sort the elements
discuss
https://mcqmate.com/topic/data-structures?page=5 2/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download

206. Which of the following is the distribution sort?

A. Heap sort

B. Smooth sort

C. Quick sort

D. LSD radix sort

Answer» D. LSD radix sort

discuss

207. What is the worst case time complexity of LSD radix sort?

A. O(nlogn)

B. O(wn)

C. O(n)

D. O(n + w)

Answer» B. O(wn)
discuss

208. LSD radix sort requires passes to sort N elements.

A. (w/logR)

B. N(w/logR)

C. (w/log(RN))

D. (wN/log(N))

Answer» A. (w/logR)
discuss

209. Which of the following is false?

A. LSD radix sort is an integer sorting algorithm

B. LSD radix sort is a comparison sorting algorithm

C. LSD radix sort is a distribution sort

D. LSD radix sort uses bucket sort

Answer» B. LSD radix sort is a comparison sorting algorithm

discuss

https://mcqmate.com/topic/data-structures?page=5 3/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download

210. Which of the following sorting algorithm is stable?

A. Heap sort

B. Selection sort

C. In-place MSD radix sort

D. LSD radix sort

Answer» D. LSD radix sort

discuss

211. Which of the following should be used to sort a huge database on a fixed-length key field?

A. Insertion sort

B. Merge sort

C. LSD radix sort

D. Quick sort

Answer» C. LSD radix sort

discuss

212. Which of the following is a combination of LSD and MSD radix sorts?

A. Forward radix sort

B. 3-way radix quick sort

C. Trie base radix sort

D. Flash sort

Answer» A. Forward radix sort

discuss

https://mcqmate.com/topic/data-structures?page=5 4/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download

213. Which of the following is true for the LSD radix sort?

A. works best for variable length strings

B. accesses memory randomly

C. inner loop has less instructions

D. sorts the keys in left-to-right order

Answer» B. accesses memory randomly

discuss

214. Which scheme uses a randomization approach?

A. hashing by division

B. hashing by multiplication

C. universal hashing

D. open addressing

Answer» C. universal hashing

discuss

215. Which hash function satisfies the condition of simple uniform hashing?

A. h(k) = lowerbound(km)

B. h(k)= upperbound(mk)

C. h(k)= lowerbound(k)

D. h(k)= upperbound(k)

Answer» A. h(k) = lowerbound(km)

discuss

https://mcqmate.com/topic/data-structures?page=5 5/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download

216. What is the hash function used in the division method?

A. h(k) = k/m

B. h(k) = k mod m

C. h(k) = m/k

D. h(k) = m mod k

Answer» B. h(k) = k mod m

discuss

217. What can be the value of m in the division method?

A. Any prime number

B. Any even number

C. 2p – 1

D. 2p

Answer» A. Any prime number

discuss

218. Which scheme provides good performance?

A. open addressing

B. universal hashing

C. hashing by division

D. hashing by multiplication

Answer» B. universal hashing

discuss

219. Using division method, in a given hash table of size 157, the key of value 172 be placed at
position

A. 19

B. 72

C. 15

D. 17

Answer» C. 15
discuss

https://mcqmate.com/topic/data-structures?page=5 6/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download

220. How many steps are involved in creating a hash function using a multiplication method?

A. 1

B. 4

C. 3

D. 2

Answer» D. 2
discuss

221. What is the hash function used in multiplication method?

A. h(k) = floor( m(kA mod 1))

B. h(k) = ceil( m(kA mod 1))

C. h(k) = floor(kA mod m)

D. h(k) = ceil( kA mod m)

Answer» A. h(k) = floor( m(kA mod 1))

discuss

222. What is the advantage of the multiplication method?

A. only 2 steps are involved

B. using constant

C. value of m not critical

D. simple multiplication

Answer» C. value of m not critical

discuss

https://mcqmate.com/topic/data-structures?page=5 7/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download

223. What is the table size when the value of p is 7 in multiplication method of creating hash
functions?

A. 14

B. 128

C. 49

D. 127

Answer» B. 128
discuss

224. What is the average retrieval time when n keys hash to the same slot?

A. Theta(n)

B. Theta(n2)

C. Theta(nlog n)

D. Big-Oh(n2)

Answer» A. Theta(n)
discuss

More MCQs

225. Which if the following is/are the levels of implementation of data structure

A. abstract level

B. application level

C. implementation level

D. all of the above

Answer» D. all of the above

discuss

226. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is
called ……

A. avl tree

B. red-black tree

C. lemma tree

D. none of the above

Answer» A. avl tree

discuss

https://mcqmate.com/topic/data-structures?page=5 8/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download

227. Stack is also called as

A. last in first out

B. first in last out

C. last in last out

D. first in first out

Answer» A. last in first out

discuss

228. …………… is not the component of data structure.

A. operations

B. storage structures

C. algorithms

D. none of above

Answer» D. none of above

discuss

229. Which of the following is not the part of ADT description?

A. data

B. operations

C. both of the above

D. none of the above

Answer» D. none of the above

discuss

https://mcqmate.com/topic/data-structures?page=5 9/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download

230. ……………. Is a pile in which items are added at one end and removed from the other.

A. stack

B. queue

C. list

D. none of the above

Answer» B. queue
discuss

231. ………… is very useful in situation when data have to stored and then retrieved in reverse order.

A. stack

B. queue

C. list

D. link list

Answer» A. stack
discuss

232. Which data structure allows deleting data elements from and inserting at rear?

A. stacks

B. queues

C. dequeues

D. binary search tree

Answer» B. queues
discuss

233. Which of the following data structure can’t store the non-homogeneous data elements?

A. arrays

B. records

C. pointers

D. stacks

Answer» A. arrays
discuss

https://mcqmate.com/topic/data-structures?page=5 10/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download

234. 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. queue linked list

B. stacks linked list

C. both of them

D. neither of them

Answer» A. queue linked list

discuss

235. Which of the following is non-liner data structure?

A. stacks

B. list

C. strings

D. trees

Answer» D. trees
discuss

236. Herder node is used as sentinel in …..

A. graphs

B. stacks

C. binary tree

D. queues

Answer» C. binary tree

discuss

https://mcqmate.com/topic/data-structures?page=5 11/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download

237. Which data structure is used in breadth first search of a graph to hold nodes?

A. stack

B. queue

C. tree

D. array

Answer» B. queue
discuss

238. Identify the data structure which allows deletions at both ends of the list but insertion at only
one end.

A. input restricted dequeue

B. output restricted qequeue

C. priority queues

D. stack

Answer» A. input restricted dequeue

discuss

239. Which of the following data structure is non linear type?

A. strings

B. lists

C. stacks

D. graph

Answer» D. graph
discuss

https://mcqmate.com/topic/data-structures?page=5 12/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download

240. Which of the following data structure is linear type?

A. graph

B. trees

C. binary tree

D. stack

Answer» D. stack
discuss

241. To represent hierarchical relationship between elements, Which data structure is suitable?

A. dequeue

B. priority

C. tree

D. graph

Answer» C. tree
discuss (1)

242. A directed graph is ………………. if there is a path from each vertex to every other vertex in the
digraph.

A. weakly connected

B. strongly connected

C. tightly connected

D. linearly connected

Answer» B. strongly connected

discuss

243. In the …………….. traversal we process all of a vertex’s descendants before we move to an
adjacent vertex.

A. depth first

B. breadth first

C. with first

D. depth limited

Answer» A. depth first

discuss

https://mcqmate.com/topic/data-structures?page=5 13/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download

244. The number of comparisons done by sequential search is ………………

A. (n/2)+1

B. (n+1)/2

C. (n-1)/2

D. (n+2)/2

Answer» B. (n+1)/2
discuss

245. In ……………, search start at the beginning of the list and check every element in the list.

A. linear search

B. binary search

C. hash search

D. binary tree search

Answer» A. linear search

discuss

246. Which of the following is not the internal sort?

A. insertion sort

B. bubble sort

C. merge sort

D. heap sort

Answer» C. merge sort

discuss

https://mcqmate.com/topic/data-structures?page=5 14/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download

247. A graph is said to be ……………… if the vertices can be split into two sets V1 and V2 such there
are no edges between two vertices of V1 or two vertices of V2.

A. partite

B. bipartite

C. rooted

D. bisects

Answer» B. bipartite
discuss

248. In a queue, the initial values of front pointer f rare pointer r should be …….. and ………..
respectively.

A. 0 and 1

B. 0 and -1

C. -1 and 0

D. 1 and 0

Answer» B. 0 and -1
discuss

249. In a circular queue the value of r will be ..

A. r=r+1

B. r=(r+1)% [queue_size – 1]

C. r=(r+1)% queue_size

D. r=(r-1)% queue_size

Answer» C. r=(r+1)% queue_size

discuss

https://mcqmate.com/topic/data-structures?page=5 15/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download

250. The advantage of …………….. is that they solve the problem if sequential storage representation.
But disadvantage in that is they are sequential lists.

A. lists

B. linked lists

C. trees

D. queues

Answer» B. linked lists

discuss

2 3 4 5 6 7 8 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 *
Theory of Computation and Compiler Design

Cloud Computing

https://mcqmate.com/topic/data-structures?page=5 16/18
8/23/25, 9:52 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download

System Software

Network Security

Object Oriented Programming (OOP)

Internet Security

Introduction to Computers

Artificial Intelligence and Robotics (AIR)

Software Design Modeling (SDM)

Web Fundamental

Software Testing and Quality Assurance (STQA)

Basics of Computer Architecture

Webenabled application

Multimedia Packages

CPP Programming

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=5 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: admin@mcqmate.com

Privacy & Cookies Policy Disclaimer

© Copyright 2025 McqMate. All rights reserved.

https://mcqmate.com/topic/data-structures?page=5 18/18