Menu

Question Discussion & Solution

MCQ

Q.

Quick sort is based on divide and conquer paradigm; we divide the problem on base of pivotelementand:

A

There is explicit combine process as well to conquer the solution.

B

No work is needed to combine the sub-arrays, the array is already sorted

C

Merging the subarrays

D

None of above.

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

The complexity of the average case of an algorithm is

A

Much more complicated to analyze

B

Sometimes more complicated and than that of worst case some other times simpler than that of

C

Much more simpler to analyze than worst case that of worst case

D

None or above

Discussion

MCQ

2.

Which of the following is a non linear data structure?

A

Array

B

Linked list

C

Stack

D

Graph

Discussion

MCQ

3.

The disadvantage in using a circular linked list is

A

It is possible to get into infinite loop.

B

Last node points to first node.

C

Time consuming

D

Requires more memory space

Discussion

MCQ

4.

The application of heap tree is

A

To Sort the elements in array

B

To evaluate the mathematical expression

C

To search the element in array

D

None of these

Discussion

MCQ

5.

Which of the following is not a primitive data structure?

A

Boolean

B

Integer

C

Arrays

D

Character

Discussion

More Design and Analysis of Algorithms Topics

Design and Analysis of Algorithms Basics

76 MCQs

Asymptotic Notation

38 MCQs

Divide and Conquer Strategy

18 MCQs

Sorting

14 MCQs

Linear Time Sorting

8 MCQs

Dynamic Programming

18 MCQs

Greedy Algorithms

10 MCQs

Backtracking Algorithms

13 MCQs

Graphs

18 MCQs

Complexity Theory

11 MCQs