Algorithm - Quiz(MCQ)
A)
Binary tree
B)
Tree structure
C)
Complete binary tree
D)
None of the above

Correct Answer : Option (C) :   Complete binary tree

A)
n - 1
B)
n
C)
1
D)
n - 2

Correct Answer : Option (A) :   n - 1

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.

A)
9 edges
B)
10 edges
C)
11 edges
D)
11 vertices

Correct Answer : Option (A) :   9 edges

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)

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

A)
At most 1
B)
At most 2
C)
Exactly 1
D)
Depending on the graph

Correct Answer : Option (C) :   Exactly 1

A)
DP Problem
B)
C)
Both (A) and (B)
D)
Greedy Algorithm

Correct Answer : Option (D) :   Greedy Algorithm

A)
Z Algorithm
B)
KMP Algorithm
C)
Rabin Karp Algorithm
D)
All of the above

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

A)
pop()
B)
peek()
C)
push()
D)
findTop()

Correct Answer : Option (B) :   peek()