# Data Structures Algorithms Online Quiz

Following quiz provides Multiple Choice Questions (MCQs) related to **Data Structures Algorithms**. You will have to read all the given answers and click over the correct answer. If you are not sure about the answer then you can check the answer using **Show Answer** button. You can use **Next Quiz** button to check new set of questions in the quiz.

Q 1 - Which one of the below is not divide and conquer approach?

### Answer : B

### Explanation

Among the options, only Merge sort divides the list in sub-list, sorts and then merges them together

Q 2 - Which one of the below mentioned is linear data structure −

### Answer : D

### Explanation

All mentioned data structures are linear in nature.

Q 3 - The following formular is of

left_subtree (keys) ≤ node (key) ≤ right_subtree (keys)

### Answer : C

### Explanation

A binary search tree (BST) is a tree in which all nodes follows the below mentioned properties −

The left sub-tree of a node has key less than or equal to its parent node's key.

The right sub-tree of a node has key greater than or equal to its parent node's key.

Q 4 - Maximum degree of any vertex in a simple graph of vertices n is

### Answer : D

### Explanation

In a simple graph, a vertex can have edge to maximum n - 1 vertices.

Q 5 - Which of the below given series is Non-Increasing Order −

### Answer : C

### Explanation

A sequence of values is said to be in non-increasing order, if the successive element is less than or equal to its previous element in the sequence.

Q 6 - Quick sort running time depends on the selection of

### Answer : B

### Explanation

If the pivot element is balanced, quick sort running time will be less.

Q 7 - Which of these alogrithmic approach tries to achieve localized optimum solution −

### Answer : A

### Explanation

Greedy approach focuses only on localized optimum solution.

Q 8 - Program with highest run-time complexity is

### Answer : A

### Explanation

Tower of hanoi has the highest run time complexity

Q 9 - A pivot element to partition unsorted list is used in

### Answer : B

### Explanation

The quick sort partitions an array using pivot element and then calls itself recursively twice to sort the resulting two subarray.

Q 10 - An adaptive sorting algorithm −

B - takes advantage of already sorted elements.

### Answer : B

### Explanation

A sorting algorithm is said to be adaptive, if it takes advantage of already 'sorted' elements in the list that is to be sorted.