Discrete Math Quiz
18 questions · no time limit
0:00
GRAPH THEORY
Question 1 of 18
No time limit
Current
Answered
Flagged
Not seen
Consider applying Kruskal's algorithm to a graph where the edges, sorted by weight, are: (A,B):1, (C,D):2, (A,C):3, (B,D):4, (A,D):5, (B,C):6. After processing the first four edges in order, how many connected components remain in the forest?
YOUR PROGRESS
18
QUESTIONS
Ready when you are
Answer in any order. Your progress shows here as you go.
QUESTIONS
KEYBOARD
Pick an answer ABCD
Next question ↵→
Previous ←
Flag for review F
Answers save as you go · flagged questions come back at the end