6/19/25, 10:44 PM CS6515 GA Exam 3 NP
CS 6515 Exam 3 | Questions and Answers |
2025 Update | 100% Correct – GT.
Correct 54
Incorrect 00
CS 6515 Exam 3
54 Correct terms
Questions and answers
Term
What is the input for clique?
Give this one a go later!
G = (V, E) (graph) & a goal "g"
,6/19/25, 10:44 PM CS6515 GA Exam 3 NP
A collection of strings and a search
A set of numbers and a target sum
pattern
Don't know?
2 of 54
Term
GRAPH STRATEGIES
Outputs often require the removal of only any added edges and/or
vertices
Give this one a go later!
TRUE, meaning that when looking at neighbors that optimize better, we can only go
up in our maximization, there is only one local maximum which is the global
maximum
TRUE
FALSE, We want to make sure the graph always is in the form that our blackbox
returns TRUE. For example, in the KITE problem we remove anything edges
and vertices not apart of the clique of the original graph.
FALSE, finding a clique is not polynomial
,6/19/25, 10:44 PM CS6515 GA Exam 3 NP
Don't know?
3 of 54
Term
What is the output of independent set?
Give this one a go later!
Set of vertices "S" where S is a subset S of {1,2,...n} where the sum of
independent set of size |S| >= g the subset = t if such a subset exists
if one exists otherwise NO exists otherwise NO
O(n+m) for checking every edge for Set of vertices S where S is a vertex
one vertex being S O(n) for checking cover of size |S| <= b if one exists
the size of S is <= b otherwise NO
Don't know?
4 of 54
Term
What is the output of vertex cover?
Give this one a go later!
, 6/19/25, 10:44 PM CS6515 GA Exam 3 NP
Set of vertices S where S is a Set of vertices "S" where S is a clique
vertex cover of size |S| <= b if of size |S| >= g if one exists otherwise
one exists otherwise NO NO
subset S of {1,2,...n} where the sum of Set of vertices "S" where S is a
the subset = t if such a subset exists independent set of size |S| >= g if one
exists otherwise NO exists otherwise NO
Don't know?
5 of 54
Term
How does the simplex algorithm work?
Give this one a go later!
1. start at x=0
2. look for neighboring vertex with higher objective value
if there is: then move there an repeat starting at step 1
otherwise: output(x)
Set of vertices S where S is a vertex cover of size |S| <= b if one exists otherwise NO
subset S of {1,2,...n} where the sum of the subset = t if such a subset exists exists
otherwise NO
CS 6515 Exam 3 | Questions and Answers |
2025 Update | 100% Correct – GT.
Correct 54
Incorrect 00
CS 6515 Exam 3
54 Correct terms
Questions and answers
Term
What is the input for clique?
Give this one a go later!
G = (V, E) (graph) & a goal "g"
,6/19/25, 10:44 PM CS6515 GA Exam 3 NP
A collection of strings and a search
A set of numbers and a target sum
pattern
Don't know?
2 of 54
Term
GRAPH STRATEGIES
Outputs often require the removal of only any added edges and/or
vertices
Give this one a go later!
TRUE, meaning that when looking at neighbors that optimize better, we can only go
up in our maximization, there is only one local maximum which is the global
maximum
TRUE
FALSE, We want to make sure the graph always is in the form that our blackbox
returns TRUE. For example, in the KITE problem we remove anything edges
and vertices not apart of the clique of the original graph.
FALSE, finding a clique is not polynomial
,6/19/25, 10:44 PM CS6515 GA Exam 3 NP
Don't know?
3 of 54
Term
What is the output of independent set?
Give this one a go later!
Set of vertices "S" where S is a subset S of {1,2,...n} where the sum of
independent set of size |S| >= g the subset = t if such a subset exists
if one exists otherwise NO exists otherwise NO
O(n+m) for checking every edge for Set of vertices S where S is a vertex
one vertex being S O(n) for checking cover of size |S| <= b if one exists
the size of S is <= b otherwise NO
Don't know?
4 of 54
Term
What is the output of vertex cover?
Give this one a go later!
, 6/19/25, 10:44 PM CS6515 GA Exam 3 NP
Set of vertices S where S is a Set of vertices "S" where S is a clique
vertex cover of size |S| <= b if of size |S| >= g if one exists otherwise
one exists otherwise NO NO
subset S of {1,2,...n} where the sum of Set of vertices "S" where S is a
the subset = t if such a subset exists independent set of size |S| >= g if one
exists otherwise NO exists otherwise NO
Don't know?
5 of 54
Term
How does the simplex algorithm work?
Give this one a go later!
1. start at x=0
2. look for neighboring vertex with higher objective value
if there is: then move there an repeat starting at step 1
otherwise: output(x)
Set of vertices S where S is a vertex cover of size |S| <= b if one exists otherwise NO
subset S of {1,2,...n} where the sum of the subset = t if such a subset exists exists
otherwise NO
