Menu

Question Discussion & Solution

MCQ

Q.

The advantage of selecting maxmin algorithm using divide and conquer method compared to staightmaxmin algorithm is _____

A

Less time complexity

B

High accuracy

C

Less space complexity

D

High time complexity

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.

Merge sort is _________.

A

External sorting

B

Insertion sorting

C

Internal sorting

D

Exponential sorting

Discussion

MCQ

2.

The number of comparisons of elements for average 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

Discussion

MCQ

3.

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

4.

The complexity of merge sort algorithm is

A

O(n)

B

O(n²)

C

O(log n)

D

O(n log n)

Discussion

MCQ

5.

Application of mergesort _________

A

Graphic card

B

Networking

C

Card Sorting

D

Data Processing

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