Menu

Question Discussion & Solution

MCQ

Q.

What do you call the selected keys in the quick sort method?

A

Outer key

B

Inner Key

C

Partition key

D

Pivot key

E

Recombine key.

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.

Graphical representation of algorithm is _____________________

A

Pseudo-code

B

Graph Coloring

C

Flow Chart

D

Dynamic programming

Discussion

MCQ

2.

Which of the following belongs to the algorithm paradigm?

A

Minimum & Maximum problem

B

Knapsack problem

C

Selection problem

D

Merge sort

E

Quick sort.

Discussion

MCQ

3.

The complexity of linear search algorithm is

A

O(n)

B

O(log n)

C

O(n^2)

D

O(n log n)

Discussion

MCQ

4.

The running time of quick sort depends heavily on the selection of

A

No of inputs

B

Size o elements

C

Arrangement of elements in array

D

Pivot element

Discussion

MCQ

5.

. In pseudo-code conventions output express as __________

A

input

B

Read

C

Write

D

Return

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