Menu

Question Discussion & Solution

MCQ

Q.

The number of comparisons of elements for worst case is ____________ in the case of maxmin algorithm based on divide and conquer method

A

3n/2

B

n/4

C

n/2

D

n-1

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.

Which of thefollowing sorting algorithm is of divide-and-conquer type?

A

Bubble sort

B

Quick sort

C

Insertion sort

D

All of above

Discussion

MCQ

2.

By Strassen

A

p1=(a+d)(e+h)

B

p3=(a-c)(e+f)

C

p2=(-e+g)d

D

p4=(a+b)h

Discussion

MCQ

3.

Merge sort is _________.

A

External sorting

B

Insertion sorting

C

Internal sorting

D

Exponential sorting

Discussion

MCQ

4.

Advantage of finding maximum and minimum using divide and conquer method instead of using conditional operators is __________________

A

Reduce Space complexity

B

Get accurate value

C

Reduce Time complexity

D

Simple calculations

Discussion

MCQ

5.

. The divide and conquer merge sort algorithm

A

? (long n)

B

?(n)

C

? (n log n)

D

? (n log n)

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