Menu

Question Discussion & Solution

MCQ

Q.

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

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.

. By Strassen

A

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

B

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

C

p7=(-e+g)d

D

p4=(a-b)h

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 invented by _____________

A

CARHOARE

B

HAMILTON

C

JOHN VON NEUMANN

D

STRASSEN

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.

Which of the following sorting algorithm is of divide-and-conquer type?

A

Bubble sort

B

Insertion sort

C

Quick sort

D

All of above

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