CS502-Fundamentals of Auditing Quiz MCQS #Objective #Questions #Finalterm

1. There are no ___ edges in an undirected graph.

- Forward
- Back
- Cross
- Both forward and back

- Algorithm
- Solution
- Heuristic
- Result

- True
- False

- can be optimally solved by greedy algorithm
- cannot be optimally solved by greedy algorithm
- cannot be solved by brute force algorithm
- All of the given

- (V+E)
- V.E
- V
- E

- complete
- incomplete
- not graphs
- transportation

- True
- False

- True
- False

- Minimum -size set of interfering activities
- Maximum-size set of mutually non-interfering activities
- Maximum-size set of interfering activities
- Minimum-size set of mutually non-interfering activities

- Kruskal algorithm is a multiple source technique for finding MST
- Kruskal's algorithm is used to find the minimum spanning tree of a graph, time complexity of this algorithm is O(EV)
- Both of the above
- Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best Tree edge) when the graph has relatively few edges.