CS 6515 Exam 2 | Actual Questions
and Answers Latest Updated
2025/2026 (Graded A+)
Correct 147
Incorrect
CS 6515 Exam 2
What does Dijkstra's algorithm do?
What is the output of the 2SAT
Karp Algorithm solve?
, Don't know?
2 of 147
Definition
Pre/post/ccnum
Give this one a try later!
What is the input for topo sort? What is the output for SCC algo?
What is the output for DFS? What is the input for DFS?
Don't know?
3 of 147
Definition
O(m log n)
Give this one a try later!
What is the output of Prim's What is the runtime of the Bellman-
Algorithm? Ford Algorithm?
, What is the runtime complexity of the What is the runtime of Prim's
Edmunds-Karp Algorithm? Algorithm?
Don't know?
4 of 147
Definition
O(|V| + |E|)
Give this one a try later!
What is the output of Prim's What is the runtime of the Bellman-
Algorithm? Ford Algorithm?
What is the runtime of the SCC What is the runtime of the Ford-
Algorithm? Fulkerson Algorithm?
Don't know?
5 of 147
Definition
O(n+m)
Give this one a try later!
, What is the runtime for
What is the output for SCC algo?
reversing a graph?
What is the runtime of the Ford- What is the input for building a
Fulkerson algo? residual graph?
Don't know?
6 of 147
Term
Goal of Flow Problem
Give this one a try later!
- Find sink SCC, output it, remove it, and repeat
- Why Sink?
- Since it's a sink SCC, then you only visit the other nodes in that sink SCC when you
run explore
- z where gcd(z, r) = 1 that also passes Fermat's Test (z^(r-1) ::: 1 mod r)
- if this is the case, then a composite number has many Fermat Witnesses; thus they
are easy to find
- Pseudoprimes
- Composite # with No nontrivial Fermat Witnesses
- Inefficient to use Fermat's Test to prove a number is a composite number
and Answers Latest Updated
2025/2026 (Graded A+)
Correct 147
Incorrect
CS 6515 Exam 2
What does Dijkstra's algorithm do?
What is the output of the 2SAT
Karp Algorithm solve?
, Don't know?
2 of 147
Definition
Pre/post/ccnum
Give this one a try later!
What is the input for topo sort? What is the output for SCC algo?
What is the output for DFS? What is the input for DFS?
Don't know?
3 of 147
Definition
O(m log n)
Give this one a try later!
What is the output of Prim's What is the runtime of the Bellman-
Algorithm? Ford Algorithm?
, What is the runtime complexity of the What is the runtime of Prim's
Edmunds-Karp Algorithm? Algorithm?
Don't know?
4 of 147
Definition
O(|V| + |E|)
Give this one a try later!
What is the output of Prim's What is the runtime of the Bellman-
Algorithm? Ford Algorithm?
What is the runtime of the SCC What is the runtime of the Ford-
Algorithm? Fulkerson Algorithm?
Don't know?
5 of 147
Definition
O(n+m)
Give this one a try later!
, What is the runtime for
What is the output for SCC algo?
reversing a graph?
What is the runtime of the Ford- What is the input for building a
Fulkerson algo? residual graph?
Don't know?
6 of 147
Term
Goal of Flow Problem
Give this one a try later!
- Find sink SCC, output it, remove it, and repeat
- Why Sink?
- Since it's a sink SCC, then you only visit the other nodes in that sink SCC when you
run explore
- z where gcd(z, r) = 1 that also passes Fermat's Test (z^(r-1) ::: 1 mod r)
- if this is the case, then a composite number has many Fermat Witnesses; thus they
are easy to find
- Pseudoprimes
- Composite # with No nontrivial Fermat Witnesses
- Inefficient to use Fermat's Test to prove a number is a composite number
