Algorithm MCQ (Multiple Choice Questions), Algorithm Online Quiz

1 .

Heap is a_________?

A)

Binary tree

B)

Tree structure

C)

Complete binary tree

D)

None of the above

Correct Answer : Option (C) : Complete binary tree

2 .

What is the maximum number of swaps that can be performed in the Selection Sort algorithm?

A)

n - 1

B)

n

C)

1

D)

n - 2

Correct Answer : Option (A) : n - 1

3 .

From a complete graph, by removing maximum _______________ edges, we can construct a spanning tree.

A)

n+e-1

B)

n-e+1

C)

e-n-1

D)

e-n+1

Correct Answer : Option (D) : e-n+1

Explanation : We can remove maximum e-n+1 edges to get a spanning tree from complete graph. Any more deletion of edges will lead the graph to be disconnected.

4 .

The spanning tree of connected graph with 10 vertices contains

A)

9 edges

B)

10 edges

C)

11 edges

D)

11 vertices

Correct Answer : Option (A) : 9 edges

5 .

The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are:

A)

T(n2), T(n2) and T(n Log n)

B)

T(n2), T(n log n) and T(n2)

C)

T(n log n), T(n log n) and T(n2)

D)

T(n2), T(n log n) and T(n log n)

Correct Answer : Option (B) : T(n2), T(n log n) and T(n2)

6 .

A problem in NP is NP-complete

A)

If, It can be reduced to the 3-SAT problem in polynomial time

B)

some problem in NP can be reduced to it in polynomial time

C)

The 3-SAT problem can be reduced to it in polynomial time

D)

It can be reduced to any other problem in NP in polynomial time

Correct Answer : Option (C) : The 3-SAT problem can be reduced to it in polynomial time

7 .

In a graph of n nodes and n edges, how many cycles will be present?

A)

At most 1

B)

At most 2

C)

Exactly 1

D)

Depending on the graph

Correct Answer : Option (C) : Exactly 1

8 .

Kruskal’s Algorithm for finding the Minimum Spanning Tree of a graph is a kind of a?

A)

DP Problem

B)

Adhoc Problem

C)

Both (A) and (B)

D)

Greedy Algorithm

Correct Answer : Option (D) : Greedy Algorithm

9 .

Which of the following algorithms are used for string and pattern matching problems?

A)

Z Algorithm

B)

KMP Algorithm

C)

Rabin Karp Algorithm

D)

All of the above

Correct Answer : Option (D) : All of the above

10 .

Identify the function of the stack that returns the top data element of the stack?

A)

pop()

B)

peek()

C)

push()

D)

findTop()

Correct Answer : Option (B) : peek()