[go: up one dir, main page]

0% found this document useful (0 votes)
22 views18 pages

Data Structures (DS) Solved MCQs 13

The document contains over 550 solved multiple-choice questions (MCQs) related to Data Structures, aimed at enhancing knowledge for students in Computer Science and related fields. It covers various topics including linear and non-linear data structures, searching, sorting, and hashing techniques, with options for PDF download. Each question includes answers and discussions to facilitate learning.

Uploaded by

vaigaiprintpoint
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
0% found this document useful (0 votes)
22 views18 pages

Data Structures (DS) Solved MCQs 13

The document contains over 550 solved multiple-choice questions (MCQs) related to Data Structures, aimed at enhancing knowledge for students in Computer Science and related fields. It covers various topics including linear and non-linear data structures, searching, sorting, and hashing techniques, with options for PDF download. Each question includes answers and discussions to facilitate learning.

Uploaded by

vaigaiprintpoint
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/ 18

8/23/25, 9:53 AM 550+ Data Structures (DS) chapter-wise solved MCQs with PDF download

→ Computer Science Engineering (CSE) → Data Structures (DS) → Set 6

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 Search MCQ | Topic | Course

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

More MCQs

251. What will be the value of top, if there is a size of stack STACK_SIZE is 5

A. 5

B. 6

C. 4

D. none

Answer» C. 4
discuss

252. ………… is not the operation that can be performed on queue.

A. insertion

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

252. ………… is not the operation that can be performed on queue.

B. deletion

C. retrieval

D. traversal

Answer» D. traversal
discuss

253. There is an extra element at the head of the list called a ……….

A. antinel

B. sentinel

C. list header

D. list head

Answer» B. sentinel
discuss

254. A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that
connect pair of nodes.

A. vertices, edges

B. edges, vertices

C. vertices, paths

D. graph node, edges

Answer» A. vertices, edges


discuss

255. A ……….. is a graph that has weights of costs associated with its edges.

A. network

B. weighted graph

C. both a and b

D. none a and b

Answer» C. both a and b


discuss

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

256. In general, the binary search method needs no more than ……………. comparisons.

A. [log2n]-1

B. [logn]+1

C. [log2n]

D. [log2n]+1

Answer» D. [log2n]+1
discuss

257. Which of the following is not the type of queue?

A. ordinary queue

B. single ended queue

C. circular queue

D. priority queue

Answer» B. single ended queue


discuss

258. The property of binary tree is

A. the first subset is called left subtree

B. the second subtree is called right subtree

C. the root cannot contain null

D. the right subtree can be empty

Answer» D. the right subtree can be empty


discuss

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

259. Any node is the path from the root to the node is called

A. successor node

B. ancestor node

C. internal node

D. none of the above

Answer» B. ancestor node


discuss

260. Which is/are the application(s) of stack

A. function calls

B. large number arithmetic

C. evaluation of arithmetic expressions

D. all of the above

Answer» D. all of the above


discuss

261. A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes
have in-degree 1.

A. directed tree

B. undirected tree

C. dis-joint tree

D. direction oriented tree

Answer» A. directed tree


discuss

262. …………………. Is a directed tree in which outdegree of each node is less than or equal to two.

A. unary tree

B. binary tree

C. trinary tree

D. both b and c

Answer» B. binary tree


discuss

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

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

A. strings

B. lists

C. stacks

D. tree

Answer» D. tree
discuss

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

A. array

B. tree

C. graphs

D. hierarchy

Answer» A. array
discuss

265. The logical or mathematical model of a particular organization of data is called a ………

A. data structure

B. data arrangement

C. data configuration

D. data formation

Answer» A. data structure


discuss

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

266. The simplest type of data structure is ………………

A. multidimensional array

B. linear array

C. two dimensional array

D. three dimensional array

Answer» B. linear array


discuss

267. Linear arrays are also called ……………….

A. straight line array

B. one-dimensional array

C. vertical array

D. horizontal array

Answer» B. one-dimensional array


discuss

268. Arrays are best data structures …………

A. for relatively permanent collections of data

B. for the size of the structure and the data in the structure are constantly changing

C. for both of above situation

D. for none of the above

Answer» A. for relatively permanent collections of data


discuss

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

269. Which of the following data structures are indexed structures?

A. linear arrays

B. linked lists

C. graphs

D. trees

Answer» A. linear arrays


discuss

270. Each node in a linked list has two pairs of ………….. and ……………….

A. link field and information field

B. link field and avail field

C. avail field and information field

D. address field and link field

Answer» A. link field and information field


discuss

271. A …………………… does not keep track of address of every element in the list.

A. stack

B. string

C. linear array

D. queue

Answer» C. linear array


discuss

272. When does top value of the stack changes?

A. before deletion

B. while checking underflow

C. at the time of deletion

D. after deletion

Answer» D. after deletion


discuss

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

273. Arrays are best data structures …………

A. for relatively permanent collections of data.

B. for the size of the structure and the data in the structure are constantly changing

C. for both of above situation

D. for none of the above

Answer» A. for relatively permanent collections of data.


discuss

274. Arrays are best data structures

A. for relatively permanent collections of data

B. for the size of the structure and the data in the structure are constantly changing

C. for both of above situation

D. for none of above situation

Answer» A. for relatively permanent collections of data


discuss

275. A linear list in which each node has pointers to point to the predecessor and successors nodes is
called as ..

A. singly linked list

B. circular linked list

C. doubly linked list

D. linear linked list

Answer» C. doubly linked list


discuss

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

276. A ……………….. is a linear list in which insertions and deletions are made to from either end of
the structure.

A. circular queue

B. random of queue

C. priority

D. dequeue

Answer» D. dequeue
discuss

277. In a priority queue, insertion and deletion takes place at ………………

A. front, rear end

B. only at rear end

C. only at front end

D. any position

Answer» D. any position


discuss

278. The time complexity of quick sort is …………..

A. o(n)

B. o(n2)

C. o(n log n)

D. o(log n)

Answer» C. o(n log n)


discuss

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

279. Which of the following is an application of stack?

A. finding factorial

B. tower of hanoi

C. infix to postfix conversion

D. all of the above

Answer» B. tower of hanoi


discuss

280. The data structure which is one ended is ………………

A. queue

B. stack

C. tree

D. graph

Answer» B. stack
discuss

281. A list which displays the relationship of adjacency between elements is said to be

A. linear

B. non linear

C. linked list

D. trees

Answer» A. linear
discuss

282. ……………….. level is where the model becomes compatible executable code

A. abstract level

B. application level

C. implementation level

D. all of the above

Answer» C. implementation level


discuss

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

283. Which of the following data structure is not linear data structure?

A. arrays

B. linked lists

C. both of the above

D. none of the above

Answer» D. none of the above


discuss

284. Inserting an item into the stack when stack is not full is called …………. Operation and deletion
of item form the stack, when stack is not empty is called ………..operation.

A. push, pop

B. pop, push

C. insert, delete

D. delete, insert

Answer» A. push, pop


discuss

285. Each array declaration need not give, implicitly or explicitly, the information about

A. the name of array

B. the data type of array

C. the first data from the set to be stored

D. the index set of the array

Answer» C. the first data from the set to be stored


discuss

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

286. The elements of an array are stored successively in memory cells because

by this way computer can keep track only the address of the first element and the addresses of other elements
A.
can be calculated

B. the architecture of computer memory does not allow arrays to store other than serially

C. both of above

D. none of above

Answer» A. by this way computer can keep track only the address of the first element and the addresses of other
elements can be calculated
discuss

287. Linked lists are best suited

A. for relatively permanent collections of data

B. for the size of the structure and the data in the structure are constantly changing

C. for both of above situation

D. for none of above situation

Answer» B. for the size of the structure and the data in the structure are constantly changing
discuss

288. Finding the location of the element with a given value is:

A. traversal

B. search

C. sort

D. none of above

Answer» B. search
discuss

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

289. The operation of processing each element in the list is known as

A. sorting

B. merging

C. inserting

D. traversal

Answer» D. traversal
discuss

290. Arrays are best data structures

A. for relatively permanent collections of data

B. for the size of the structure and the data in the structure are constantly changing

C. for both of above situation

D. for none of above situatio

Answer» A. for relatively permanent collections of data


discuss

291. Which of the following statement is true?


i) Using singly linked lists and circular list, it is not possible to traverse the list backwards.
ii) To find the predecessor, it is required to traverse the list from the first node in case of singly
linked list.

A. i-only

B. ii-only

C. both i and ii

D. none of the above

Answer» C. both i and ii


discuss

292. What will be the value of top, if there is a size of stack STACK_SIZE is 5

A. 5

B. 6

C. 4

D. none of the above

Answer» C. 4
discuss

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

293. ………… is not the operation that can be performed on queue.

A. insertion

B. deletion

C. retrieval

D. traversal

Answer» D. traversal
discuss

294. A data structure where elements can be added or removed at either end but not in the middle
is called …

A. linked lists

B. stacks

C. queue

D. dequeue

Answer» D. dequeue
discuss

295. Which of the following name does not relate to stacks?

A. fifo lists

B. lifo list

C. piles

D. push-down lists

Answer» A. fifo lists


discuss

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

296. The term "push" and "pop" is related to the

A. array

B. lists

C. stacks

D. all of the above

Answer» C. stacks
discuss

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

A. stacks

B. queue

C. dequeue

D. binary search tree

Answer» B. queue
discuss

298. node.next -> node.next.next; will make

A. node.next inaccessible

B. node.next.next inaccessible

C. this node inaccessible

D. none of the above

Answer» A. node.next inaccessible


discuss

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

299. A circular linked list can be used for

A. stack

B. queue

C. both stack & queue

D. neither stack or queue

Answer» C. both stack & queue


discuss

300. In doubly linked lists

A. a pointer is maintained to store both next and previous nodes.

B. two pointers are maintained to store next and previous nodes.

C. a pointer to self is maintained for each node.

D. none of the above

Answer» B. two pointers are maintained to store next and previous nodes.
discuss

3 4 5 6 7 8 9 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

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

Related Topics *
Basics of Computer Architecture

Aptitude and Logical Reasoning

Data Communication and Computer Network

Computer Fundamentals

Operating System Architecture

Information systems and engineering economics

Microprocessors

Basics of Computer Graphics

Multimedia Technology

Linux and PHP

Neural Networks and Fuzzy Control

8085 Microprocessor

Machine Learning (ML)

Software Project Management (SPM)

Fundamentals of Computer Programming 1

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)

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

Your recent visits


Topic: Data Structures (DS)

Topic: Operating System (OS)

Topic: System Software

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=6 18/18

You might also like