Menu

Question Discussion & Solution

MCQ

Q.

Which of following algorithm scans the list by swapping the entries whenever pair of adjacent keys are out of desired order?

A

Insertion sort

B

Quick sort

C

Shell sort

D

Bubble sort

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.

Average case time complexity of Quick sort is ______________

A

? (nlogn)

B

O(logn)

C

O(nlogn)

D

?(logn)

Discussion

MCQ

2.

Application of quicksort _________

A

Graphic card

B

Data Processing

C

Tape sorting

D

Card Sorting

Discussion

MCQ

3.

Let there be an array of length

A

N log N times

B

log N times

C

N2 times

D

N-1 times

E

N times.

Discussion

MCQ

4.

Worst case time complexity of Quick sort is ______________

A

O(n^2log7)

B

O(nlogn)

C

O(n^2)

D

O(logn)

Discussion

MCQ

5.

Sorting is not possible by using which of the following methods?

A

Insertion

B

Selection

C

Deletion

D

Exchange

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