Data Structure MCQs

 1) ___________ is a data organization, management, and storage format that enables efficient access and modification.

A) Data Analysis B) Data structure C)Data Science D) Data Load

Correct Ans: Data structure

2) An array is a collection of items stored at ___________ memory locations.

A) contiguous B) permanent C) temporary D) dynamic

Correct Ans: contiguous

3) The elements in a linked list are linked using ___________.

A) object B) structure C) pointers D) classes

Correct Ans: pointers

4) The _______ operation in Doubly Link List is more efficient if pointer to the node to be deleted is given.

A) delete B) update C) insert D) modify

Correct Ans:delete 

5) ___________ is a linear data structure which follows a particular order in which the operations are performed.

A) link list B) Stack C) array D) heap

Correct Ans: Stack 

6) Each element in a _________ can have only 2 children

A) binary tree B) stack C) hash table D) array

Correct Ans: binary tree 

7) In case of binary search trees (BST), inorder traversal gives nodes in ___________ order. 

A) non increasing B) increasing C) non-decreasing D) decreasing

Correct Ans: non-decreasing

8) A __________ is a special Tree-based data structure in which the tree is a complete binary tree. 

A) stack B) Array C) Hash Table D) Heap

Correct Ans: Heap

9) In DS algorithms are known as ______________. 

A) data types B) programs C) constructor D)Abstract data types 

Correct Ans: Abstract data types

10) The insertion operation is called as __________.

A) PUSH B) POP C) PEEP D) CHANGE

Correct Ans: PUSH

11) The procedure to add an element into queue is called __________.

A) enqueue B) dequeue C) FCFS D) FIFO

Correct Ans: enqueue

12) A graph in which every edge is directed is called __________.

A) digraph B) unidirected graph C) mixed graph D) null graph

Correct Ans:digraph 

13) A ___________ of a graph is an undirected tree consisting of only those edges necessary to connect all the nodes in the original graph.

A) spanning tree B) binary tree C) empty tree D) subtree

Correct Ans: spanning tree

14) A node is called balanced, if the ________ path in both the right and left sub tree are equal.

A) longest B) shortest C) mixed path D) none of these

Correct Ans: longest

15) If the items to be searched are labelled by comparable keys, one can order them and store them in such a way that they are _______ already.

A) unsorted B) mixed C) sorted D) none of these

Correct Ans: sorted

16) Rearranging an array of items into heap tree form can be done more efficiently using ______________

A) ‘bubble top’ B) ‘bubble bottom' C) ‘bubble up’ D) ‘bubble down’

Correct Ans: ‘bubble down’

17) A binomial tree of order _________ is a single node.

A)1 B) 0 C) 2 D) 5

Correct Ans: 0

18) A ___________ is another collection of trees that satisfy the standard priority-ordering property.

A) Fibonacci heap B) recursive heap C) circular linked list D) doubly linked list

Correct Ans:  Fibonacci heap

19) If two items are found to be out of order, exchange them. Repeat till all items are in order. This sorting is known as _____________.

A) selection sorting B) exchange sorting C) insertion sorting D) divide & conquer sorting

Correct Ans: exchange sorting

20)  _______________ starts by treating the first entry a[0] as an already sorted array, then checks the second entry a[1] and compares it with the first.

A) bubble sort B) insertion sort C) selection sort D) tree sort

Correct Ans: insertion sort