Trees Questions

MCQ bookmark_border

1.

How do you determine the cost of a spanning tree?

A

By the sum of the costs of the edges of the tree

B

By the sum of the costs of the edges and vertices of the tree

C

By the sum of the costs of the vertices of the tree

D

By the sum of the costs of the edges of the graph

E

By the sum of thecosts of the edges and vertices of the graph.

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

2.

In an arbitrary tree ( not a search tree) of order M. Its size is N, and its height is K. The computation time needed to find a data item on T is

A

O(K*K)

B

O(M*M)

C

O(N)

D

O(K)

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

3.

What would be the cost value for any answering node of a sub tree with root

A

Maximum

B

Minimum

C

Optimal

D

Average

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

4.

How many nodes are there in a full state space tree with n = 6?

A

65

B

64

C

63

D

32

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

5.

How many minimum number of spanning trees, one can have from a given connected graph with N nodes is having different weights for the edges.

A

N-1

B

One

C

1/(N+1) 2NCN

D

2NCN

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

6.

The following formula is of :

left_subtree (keys) ? node (key) ? right_subtree (keys)

A

Bianry Tree

B

Complete Binary Tree

C

Binary Search Tree

D

All of the above

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

7.

Binary search tree has best case run-time complexity of ?(log n). What could the worst case?

A

?(n)

B

?(n2)

C

?(n3)

D

None of the above

Correct Answer: A

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

8.

In order traversal of binary search tree will produce ?

A

unsorted list

B

reverse of input

C

sorted list

D

none of the above

Correct Answer: C

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

9.

In binary heap, whenever the root is removed then the rightmost element of last level is replaced by the root. Why?

A

It is the easiest possible way.

B

To make sure that it is still complete binary tree.

C

Because left and right subtree might be missing.

D

None of the above.

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

10.

If we choose Prim's Algorithm for uniquely weighted spanning tree instead of Kruskal's Algorithm, then

A

we'll get a different spanning tree.

B

we'll get the same spanning tree.

C

spanning will have less edges.

D

spanning will not cover all vertices.

Correct Answer: B

None.

Check Answer report_problem Report forum Discussion