# Data Structure MCQ Questions and Answers

## The following quiz “Data Structure MCQ Questions and Answers” provides Multiple Choice Questions (MCQs) related to Data Structure. These Data Structure MCQs are also Interviews (campus interview, walk-in interview, company interview), Placement or recruitment, entrance examinations, and competitive examinations oriented. You can practice the below questions to improve your Data structure skills. You can click on the View Answer button to check the answer if you needed. Let’s solve this Data Structure MCQ Questions and Answers Quiz. In simple words, the data structure is a way of organizing the data so that it can be used efficiently.

You can practice these Data Structure MCQs here and if you want a pdf of Data Structure MCQ Questions and Answers, we will provide a downloading link here soon so please keep visiting here for further modifications.

## 01. Which of the following is/are the levels of implementation of data structure

1. Abstract level
2. Application level
3. Implementation level
4. All of above

Explanation: All of the above are the levels of implementation of data structure.

## 02. How can we describe an array in the best possible way?

1. The Array shows a hierarchical structure
2. Arrays are immutable
3. Container that stores the elements of similar types
4. The Array is not a data structure

Explanation: The array stores the elements in a contiguous block of memory of similar types. Therefore, we can say that array is a container that stores elements of similar types.

## 03. Which of the following concepts make extensive use of arrays?

1. Binary trees
2. Scheduling of processes
3. Caching
4. Spatial locality

Explanation: Whenever a particular memory location is referred to, it is likely that the locations nearby are also referred to, arrays are stored as contiguous blocks in memory, so if you want to access array elements, spatial locality makes it to access quickly and hence spatial locality makes extensive use of the array.

## 04. Prefix notation is also known as

1. Reverse Polish Notation
2. Reverse Notation
3. Polish Reverse Notation
4. Polish Notation

Explanation: Prefix notation is also known as Polish Notation.

## 05. Which of the following sorting algorithms can be used to sort a random linked list with minimum time complexity?

1. Merge Sort
2. Insertion Sort
3. Quick Sort
4. Heap Sort

Explanation: Since worst case time complexity of Merge Sort is O(nLogn) and Insertion sort is O(n^2), merge sort is preferred.

## 06. Which of the following data structure is linear type?

1. Lists
2. Strings
3. Queues
4. All of the above

Explanation: All of the above mentioned.

## 07. A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called

1. AVL tree
2. Red-black tree
3. Lemma tree
4. None of the above

Explanation: A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called AVL tree.

## 08. What is the worst-case run-time complexity of binary search algorithms?

1. Ο(n2)
2. Ο(n)
3. Ο(nlog n)
4. Ο(n3)

Explanation: O(n) is the worst-case run-time complexity of binary search algorithms.

1. nf(m)
2. mf(n)
3. ƒ(n)
4. f(m)