Menu

Question Discussion & Solution

MCQ

Q.

The time complexity of Strassen

A

O(E log V)

B

O(V2)

C

O(nlog7)

D

O(log n7)

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 sorting , which works very well for small file is ______________

A

Count sort

B

Selection sort

C

Merge sort

D

Quick sort

Discussion

MCQ

2.

Merge sort is _________.

A

External sorting

B

Insertion sorting

C

Internal sorting

D

Exponential sorting

Discussion

MCQ

3.

Which of the following versions of merge sort algorithm does uses space efficiently?

A

Contiguous version

B

Array version

C

Linked version

D

Structure version

E

Heap version.

Discussion

MCQ

4.

. The divide and conquer merge sort algorithm

A

? (long n)

B

?(n)

C

? (n log n)

D

? (n log n)

Discussion

MCQ

5.

. 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

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