Home

Data Structure MCQ Question with Answer

Data Structure MCQ with detailed explanation for interview, entrance and competitive exams. Explanation are given for understanding.

Download Data Structure MCQ Question Answer PDF

Try Data Structure Mock Test

Question No : 29
Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

Stack
Input restricted dequeue
Priority queues
Output restricted qequeue

Question No : 30
The complexity of Binary search algorithm is

O(n)
O(log )
O(n2)
O(n log n)

Question No : 31
Each array declaration need not give, implicitly or explicitly, the information about

the name of array
the data type of array
the index set of the array
the first data from the set to be stored

Question No : 32
Arrays are best data structures

for relatively permanent collections of data
for the size of the structure and the data in the structure are constantly changing
for both of above situation
for none of above situation

Question No : 33
The operation of processing each element in the list is known as

Sorting
Merging
Inserting
Traversal

Question No : 34
Which of the following case does not exist in complexity theory

Best case
Null case
Worst case
Average case

Question No : 35
Finding the location of the element with a given value is:

Traversal
Search
Sort
None of above

Wanna test your skill? Here are some exams we prepared for you. So if you need to test your skill just attempt any exam from bellow.

Exam Name No. Of Q Link
Computer set 1 30 Start
Computer set 2 30 Start
Computer set 3 30 Start
Computer set 4 30 Start
Computer set 5 30 Start
Computer set 6 30 Start
Computer set 7 30 Start
Computer set 8 30 Start
Computer set 9 30 Start
Computer set 10 30 Start
Computer set 11 30 Start
Computer set 12 30 Start