6/19/25, 10:42 PM CS 6515 Exam 2
CS 6515 Exam 2 | Questions and Answers
| 2025 Update | 100% Correct – GT.
Correct 96
Incorrect 00
CS 6515 Exam 2
96 Correct terms
Questions and answers
Term
Give this one a go later!
Graph in which there is a path
,6/19/25, 10:42 PM CS 6515 Exam 2
Given a directed acyclic graph
G, a topological sort on the
O(mC) where C is capacity vertices is an ordering such that
all edges go from an earlier
vertex to a later vertex
Don't know?
2 of 96
Definition
It may be necessary to understand the component structure of a graph
- can understand which vertices are mutually reachable
Give this one a go later!
Pre-processing Graph
Graph Traversal With Randomized Approaches: Strongly
Algorithms Connected Components
Decomposition
Post-processing Graph Techniques: Dynamic Programming For Graph
Vertex Coloring Optimization
Don't know?
3 of 96
,6/19/25, 10:42 PM CS 6515 Exam 2
Definition
When running BFS or DFS to determine reachability we may want to
analyze the output of BFS or DFS
Give this one a go later!
Post-processing Graph
Graph Theory Basics: Node Degree
Approaches: Evaluate BFS/DFS
Calculation
Traversal
Algorithm Complexity Analysis: Big O Pre-processing Techniques: Graph
Notation Normalization
Don't know?
4 of 96
Term
What is the runtime of Ford-Fulkerson?
Give this one a go later!
post(u) < post(v) Connected, directed, weighted
pre(u)> pre(v) O(mC) where C is capacity
, 6/19/25, 10:42 PM CS 6515 Exam 2
Don't know?
5 of 96
Term
Can you assume that you have found all sources and sinks if you have
topological ordering?
Give this one a go later!
It may be necessary to understand
False, the shortest path between the component structure of a graph -
vertices may not be part of the MST can understand which vertices are
mutually reachable
No, we can assume that first
False, it may not cover shorter paths SCC is a source and last SCC is
between vertices since Dijkstra is only a sink (assuming topological
shortest path from a specific vertex sort, vice versa if reverse
topological sort)
Don't know?
CS 6515 Exam 2 | Questions and Answers
| 2025 Update | 100% Correct – GT.
Correct 96
Incorrect 00
CS 6515 Exam 2
96 Correct terms
Questions and answers
Term
Give this one a go later!
Graph in which there is a path
,6/19/25, 10:42 PM CS 6515 Exam 2
Given a directed acyclic graph
G, a topological sort on the
O(mC) where C is capacity vertices is an ordering such that
all edges go from an earlier
vertex to a later vertex
Don't know?
2 of 96
Definition
It may be necessary to understand the component structure of a graph
- can understand which vertices are mutually reachable
Give this one a go later!
Pre-processing Graph
Graph Traversal With Randomized Approaches: Strongly
Algorithms Connected Components
Decomposition
Post-processing Graph Techniques: Dynamic Programming For Graph
Vertex Coloring Optimization
Don't know?
3 of 96
,6/19/25, 10:42 PM CS 6515 Exam 2
Definition
When running BFS or DFS to determine reachability we may want to
analyze the output of BFS or DFS
Give this one a go later!
Post-processing Graph
Graph Theory Basics: Node Degree
Approaches: Evaluate BFS/DFS
Calculation
Traversal
Algorithm Complexity Analysis: Big O Pre-processing Techniques: Graph
Notation Normalization
Don't know?
4 of 96
Term
What is the runtime of Ford-Fulkerson?
Give this one a go later!
post(u) < post(v) Connected, directed, weighted
pre(u)> pre(v) O(mC) where C is capacity
, 6/19/25, 10:42 PM CS 6515 Exam 2
Don't know?
5 of 96
Term
Can you assume that you have found all sources and sinks if you have
topological ordering?
Give this one a go later!
It may be necessary to understand
False, the shortest path between the component structure of a graph -
vertices may not be part of the MST can understand which vertices are
mutually reachable
No, we can assume that first
False, it may not cover shorter paths SCC is a source and last SCC is
between vertices since Dijkstra is only a sink (assuming topological
shortest path from a specific vertex sort, vice versa if reverse
topological sort)
Don't know?
