Q1: Which of the following is false in the case of a spanning tree of a graph G ?

Select one:

a. It is tree that spans G

b. It can be either cyclic or acyclic

c. It includes every vertex of the G

d. It is a subgraph of the G

Q5: Which of the following is false about Prims algorithm?

Select one:

a. It is a greedy algorithm

b. It never accepts cycles in the MST

c. It can be implemented using the Minheap

d. It constructs MST by selecting edges in increasing order of their weights

Q7: Kruskals algorithm is a __________________

Select one:

a. approximation algorithm

b. divide and conquer algorithm

c. dynamic programming algorithm

d. greedy algorithm