My Report

Data Structure II Mock Test 5


Correct Answer: 2 points | Wrong: -1 point
Grades: A* (100% score) | A (80%-99%) | B (60%-80%) | C (40%-60%) | D (0%-40%)
advertisement
 10%

Question 1 of 10

1. What is the total number of iterations used in a maximum- matching algorithm?

Question 1 of 10

Question 2 of 10

2. The problem of maximizing the sum of weights on edges connecting matched pairs of vertices is?

Question 2 of 10

Question 3 of 10

3. What happens when a free man approaches a married woman?

Question 3 of 10

Question 4 of 10

4. Consider a complete graph G with 4 vertices. The graph G has ____ spanning trees.

Question 4 of 10

Question 5 of 10

5. Consider the following graph. Using Kruskal’s algorithm, which edge will be selected first?
kruskals-algorithm-questions-answers-q5

Question 5 of 10

Question 6 of 10

6. Which one of the following is not an application of max-flow min-cut algorithm?

Question 6 of 10

Question 7 of 10

7. Under what condition can a vertex combine and distribute flow in any manner?

Question 7 of 10

Question 8 of 10

8. What is the condition for proper edge coloring of a graph?

Question 8 of 10

Question 9 of 10

9. An optimal solution satisfying men’s preferences is said to be?

Question 9 of 10

Question 10 of 10

10. Who was the first person to solve the maximum matching problem?

Question 10 of 10


 

Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & discussions at Telegram SanfoundryClasses.