8/23/25, 9:57 AM 310+ Data Structures (DS) Solved MCQs with PDF Download
Search MCQ | Topic | Course
→ Computer Science Engineering (CSE) → Data Structures (DS) → more mcqs → Set 6
213 101.5k 9 Save
Chapter:
310+ more mcqs Solved MCQs
in Data Structures (DS)
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 6 of 7 Sets
More MCQs
251. ______ is not a technique of tree traversal.
A. pre-order
B. post-order
C. prefix
D. in-order
Answer» C. prefix
discuss
https://mcqmate.com/topic/data-structures/c/more-mcqs?page=6 1/18
8/23/25, 9:57 AM 310+ Data Structures (DS) Solved MCQs with PDF Download
252. Selection sort and quick sort both fall into the same category of sorting algorithms._________ is
that category.
A. O(n log n) sorts.
B. Divide-and-conquer sorts.
C. Interchange sorts.
D. Average time is quadratic.
Answer» C. Interchange sorts.
discuss
253. The possibility of two different keys k1 & k2 yielding the same hash address is called__________.
A. merge.
B. obstacle.
C. overlapping.
D. collision.
Answer» C. overlapping.
discuss
254. Uniform distribution of the hash address throughout the given set L is __________.
A. reduce the number of collision.
B. increase the number of collision.
C. totally avoid collision.
D. manage address.
Answer» A. reduce the number of collision.
discuss
255. An edge E is called _________ if it has identical endpoints.
A. multiple edges.
B. loops.
C. finite.
D. digraph.
Answer» B. loops.
discuss
https://mcqmate.com/topic/data-structures/c/more-mcqs?page=6 2/18
8/23/25, 9:57 AM 310+ Data Structures (DS) Solved MCQs with PDF Download
256. __________involves maintaining two tables in memory.
A. Arranging.
B. Bonding.
C. Combing.
D. Chaining.
Answer» D. Chaining.
discuss
257. An _________ is a well defined list of steps for solving a problem.
A. Algorithm.
B. Program.
C. Procedure.
D. Process.
Answer» A. Algorithm.
discuss
258. The data items in a record form a ________ structure which can be described by means of level
numbers.
A. hierarchical.
B. procedural.
C. indexed.
D. leveled.
Answer» A. hierarchical.
discuss
259. A path P of length n from a node u to a node v is defined as a sequence of _________ nodes.
A. n.
B. n+1.
C. n+2.
D. n-1.
Answer» B. n+1.
discuss
https://mcqmate.com/topic/data-structures/c/more-mcqs?page=6 3/18
8/23/25, 9:57 AM 310+ Data Structures (DS) Solved MCQs with PDF Download
260. A vertex of degree one is called __________.
A. padent
B. isolated vertex
C. null vertex
D. colored vertex
Answer» A. padent
discuss
261. A connected graph T without any cycles is called _____________.
A. a tree graph.
B. free tree.
C. a tree.
D. all of the above.
Answer» D. all of the above.
discuss
262. If every node u in G is adjacent to every other node v in G, A graph is said to be _______.
A. isolate.
B. complete.
C. finite.
D. Strongly connected.
Answer» B. complete.
discuss
https://mcqmate.com/topic/data-structures/c/more-mcqs?page=6 4/18
8/23/25, 9:57 AM 310+ Data Structures (DS) Solved MCQs with PDF Download
263. In a graph G if e=(u,v), then u and v are called ___________.
A. endpoints.
B. adjacent nodes.
C. neighbours.
D. all of the above.
Answer» D. all of the above.
discuss
264. Which of the following is true while inserting a new node in the list?
A. Check there is node in the list.
B. Check in the free node in the pool.
C. There is no node.
D. Underflow.
Answer» B. Check in the free node in the pool.
discuss
265. Which of the following data structures are indexed structures?
A. Linear arrays.
B. Linked lists.
C. Arrays.
D. First address.
Answer» A. Linear arrays.
discuss
https://mcqmate.com/topic/data-structures/c/more-mcqs?page=6 5/18
8/23/25, 9:57 AM 310+ Data Structures (DS) Solved MCQs with PDF Download
266. The efficiency of a BFS algorithm is dependent on _______.
A. Algorithm.
B. Tree.
C. Problem.
D. Graph.
Answer» D. Graph.
discuss
267. The average number of key comparisons done in a successful sequential search in a list of
length n is ____________.
A. log n.
B. n-1/2.
C. n/2.
D. n+1/2.
Answer» D. n+1/2.
discuss
268. Divide and conquer is an important algorithm design paradigm based on _______.
A. multi-branched recursion.
B. single-branched recursion.
C. two-way recursion.
D. None.
Answer» A. multi-branched recursion.
discuss
269. The correctness of a divide and conquer algorithm is usually proved by _________.
A. mathematical theorem.
B. de-Morgan `s law.
C. mathematical induction.
D. none.
Answer» C. mathematical induction.
discuss
https://mcqmate.com/topic/data-structures/c/more-mcqs?page=6 6/18
8/23/25, 9:57 AM 310+ Data Structures (DS) Solved MCQs with PDF Download
270. The ____________ is used in an elegant sorting algorithm.
A. Heap sort.
B. Quick sort.
C. Merge sort.
D. Radix sort.
Answer» A. Heap sort.
discuss
271. ____________ is finding a path/tour through the graph such that every vertex is visited exactly
once.
A. Travelling Salesman tour.
B. Eulerian tour.
C. Hamiltonian tour.
D. None.
Answer» C. Hamiltonian tour.
discuss
272. ____________ data structure is used to implement Depth First search.
A. Array.
B. Linked list.
C. Queue.
D. Stack.
Answer» D. Stack.
discuss
https://mcqmate.com/topic/data-structures/c/more-mcqs?page=6 7/18
8/23/25, 9:57 AM 310+ Data Structures (DS) Solved MCQs with PDF Download
273. The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is
A. log2N
B. n-1
C. n
D. None of the above
Answer» B. n-1
discuss
274. Each entry in a linked list is a called a_______________.
A. Link.
B. Node.
C. Data Structure.
D. Avail.
Answer» B. Node.
discuss
275. Which of the following is two way lists?
A. Grounded header list.
B. Circular header list.
C. Linked list with header and trailer nodes.
D. List traversed in two directions.
Answer» D. List traversed in two directions.
discuss
https://mcqmate.com/topic/data-structures/c/more-mcqs?page=6 8/18
8/23/25, 9:57 AM 310+ Data Structures (DS) Solved MCQs with PDF Download
276. A list that has no nodes is called________.
A. End list.
B. Zero list.
C. Null list.
D. Sentinel list.
Answer» C. Null list.
discuss
277. The special list which consists of unused memory space is called __________.
A. Free space.
B. Empty space.
C. Available space.
D. Free storage list.
Answer» D. Free storage list.
discuss
278. To insert a new node in linked list free node will be available in ___________.
A. Available list.
B. Avail list.
C. Free node list.
D. Memory space list.
Answer» B. Avail list.
discuss
279. A ______________ list is a header list where the node points back to the header node.
A. Circular header.
B. Grounded header.
C. Two way header.
D. One way header.
Answer» A. Circular header.
discuss
https://mcqmate.com/topic/data-structures/c/more-mcqs?page=6 9/18
8/23/25, 9:57 AM 310+ Data Structures (DS) Solved MCQs with PDF Download
280. How many pointers are necessarily changed for the insertion in a Linked List?
A. 1.
B. 2.
C. 3.
D. 5.
Answer» B. 2.
discuss
281. An algorithm that calls itself directly or indirectly is known as ____________.
A. Sub algorithm. .
B. Recursion.
C. Polish notation.
D. Traversal algorithm.
Answer» B. Recursion.
discuss
282. Minimum number of fields in each node of a doubly linked list is____
A. 2
B. 3
C. 4
D. None of the above
Answer» B. 3
discuss
https://mcqmate.com/topic/data-structures/c/more-mcqs?page=6 10/18
8/23/25, 9:57 AM 310+ Data Structures (DS) Solved MCQs with PDF Download
283. A graph in which all vertices have equal degree is known as ____
A. Complete graph
B. Regular graph
C. Multi graph
D. Simple graph
Answer» A. Complete graph
discuss
284. A vertex of in-degree zero in a directed graph is called a/an
A. Root vertex
B. Isolated vertex
C. Sink
D. Articulation point
Answer» C. Sink
discuss
285. A graph is a tree if and only if graph is
A. Directed graph
B. Contains no cycles
C. Planar
D. Completely connected
Answer» B. Contains no cycles
discuss
https://mcqmate.com/topic/data-structures/c/more-mcqs?page=6 11/18
8/23/25, 9:57 AM 310+ Data Structures (DS) Solved MCQs with PDF Download
286. The elements of a linked list are stored
A. In a structure
B. In an array
C. Anywhere the computer has space for them
D. In contiguous memory locations
Answer» C. Anywhere the computer has space for them
discuss
287. A parentheses checker program would be best implemented using
A. List
B. Queue
C. Stack
D. Any of the above
Answer» C. Stack
discuss
288. To perform level-order traversal on a binary tree, which of the following data structure will be
required?
A. Hash table
B. Queue
C. Binary search tree
D. Stack
Answer» B. Queue
discuss
289. Which of the following data structure is required to convert arithmetic expression in infix to its
equivalent postfix notation?
A. Queue
B. Linked list
C. Binary search tree
D. None of above
Answer» D. None of above
discuss
https://mcqmate.com/topic/data-structures/c/more-mcqs?page=6 12/18
8/23/25, 9:57 AM 310+ Data Structures (DS) Solved MCQs with PDF Download
290. A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the
nodes in the last level have only one child it will be its left child. Name the tree.
A. Threaded tree
B. Complete binary tree
C. M-way search tree
D. Full binary tree
Answer» B. Complete binary tree
discuss
291. Which of following data structure is more appropriate for implementing quick sort iteratively?
A. Deque
B. Queue
C. Stack
D. Priority queue
Answer» C. Stack
discuss
292. The number of edges in a complete graph of n vertices is
A. n(n+1)/2
B. n(n-1)/2
C. n2/2
D. n
Answer» B. n(n-1)/2
discuss
https://mcqmate.com/topic/data-structures/c/more-mcqs?page=6 13/18
8/23/25, 9:57 AM 310+ Data Structures (DS) Solved MCQs with PDF Download
293. If two trees have same structure and but different node content, then they are called ___
A. Synonyms trees
B. Joint trees
C. Equivalent trees
D. Similar trees
Answer» D. Similar trees
discuss
294. If two trees have same structure and node content, then they are called ____
A. Synonyms trees
B. Joint trees
C. Equivalent trees
D. Similar trees
Answer» C. Equivalent trees
discuss
295. Finding the location of a given item in a collection of items is called ……
A. Discovering
B. Finding
C. Searching
D. Mining
Answer» C. Searching
discuss
https://mcqmate.com/topic/data-structures/c/more-mcqs?page=6 14/18
8/23/25, 9:57 AM 310+ Data Structures (DS) Solved MCQs with PDF Download
296. Quick sort is also known as ……..
A. merge sort
B. tree sort
C. shell sort
D. partition and exchange sort
Answer» D. partition and exchange sort
discuss
297. ………. sorting is good to use when alphabetizing a large list of names.
A. Merge
B. Heap
C. Radix
D. Bubble
Answer» C. Radix
discuss
298. The total number of comparisons in a bubble sort is ….
A. O(n logn)
B. O(2n)
C. O(n2)
D. O(n)
Answer» A. O(n logn)
discuss
299. ……… form of access is used to add and remove nodes from a queue.
A. LIFO, Last In First Out
B. FIFO, First In First Out
C. Both a and b
D. None of these
Answer» B. FIFO, First In First Out
discuss
https://mcqmate.com/topic/data-structures/c/more-mcqs?page=6 15/18
8/23/25, 9:57 AM 310+ Data Structures (DS) Solved MCQs with PDF Download
300. New nodes are added to the ……… of the queue.
A. Front
B. Back
C. Middle
D. Both A and B
Answer» B. Back
discuss
1 2 3 4 5 6 7
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/c/more-mcqs?page=6 16/18
8/23/25, 9:57 AM 310+ Data Structures (DS) Solved MCQs with PDF Download
Related Topics *
Software Project Management (SPM)
Python Programming
Discrete Mathematics
Computer Architecture
Object Oriented Programming (OOP)
Muli-core Architectures and Programming
.NET Programming
Design and Analysis of Algorithms
Internet of Things (IoT)
Problem Solving and Python Programming
Green Computing (GC)
Data Mining and Business Intelligence
Theory of Computation
Social Media Analytics (SMA)
Data Mining and Data Warehouse
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)
https://mcqmate.com/topic/data-structures/c/more-mcqs?page=6 17/18
8/23/25, 9:57 AM 310+ Data Structures (DS) Solved MCQs with PDF Download
Bachelor of Science in Computer Science (BSc CS)
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: [email protected]
Privacy & Cookies Policy Disclaimer
© Copyright 2025 McqMate. All rights reserved.
https://mcqmate.com/topic/data-structures/c/more-mcqs?page=6 18/18
