CSE 310 FINAL EXAM REVIEW
QUESTIONS AND ANSWERS 100% PASS
Worst case run time for union by rank - ANS Theta(m lg n)
Worst case run time for path compression - ANS Theta(n + f * (1 + lg2 + f/n))
Make-set worst case run time - ANS Theta(1)
Find-set worst case run time - ANS Theta(1)
Union worst case run time - ANS Theta(n)
When building disjoint sets, if there are n Make-Set operations and m operations total, the
worst case run time is - ANS Theta(m + n lg n)
BFS worst case linked list - ANS Theta(V + E)
BFS worst case adjacency matrix - ANS Theta(V^2)
Make-Set algo - ANS Make-Set(x){
1 @COPYRIGHT 2025/2026 ALLRIGHTS RESERVED.
QUESTIONS AND ANSWERS 100% PASS
Worst case run time for union by rank - ANS Theta(m lg n)
Worst case run time for path compression - ANS Theta(n + f * (1 + lg2 + f/n))
Make-set worst case run time - ANS Theta(1)
Find-set worst case run time - ANS Theta(1)
Union worst case run time - ANS Theta(n)
When building disjoint sets, if there are n Make-Set operations and m operations total, the
worst case run time is - ANS Theta(m + n lg n)
BFS worst case linked list - ANS Theta(V + E)
BFS worst case adjacency matrix - ANS Theta(V^2)
Make-Set algo - ANS Make-Set(x){
1 @COPYRIGHT 2025/2026 ALLRIGHTS RESERVED.