A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

Discussion Forum

Que. How many edges must be removed to produce the spanning forest of a graph with N vertices, M edges and C connected components?
a. M+N-C
b. M-N-C
c. M-N+C
d. M+N+C
Answer:M-N+C
Confused About the Answer? Ask for Details Here
Know Explanation? Add it Here

Similar Questions: