NEED ASAP PLEASE WILL GIVE GOOD RATE RIGHT AWAY FOR ALL ANSWERS! NEED ASAP PLEAS
ID: 3920029 • Letter: N
Question
NEED ASAP PLEASE WILL GIVE GOOD RATE RIGHT AWAY FOR ALL ANSWERS!NEED ASAP PLEASE WILL GIVE GOOD RATE RIGHT AWAY FOR ALL ANSWERS!
RUE/FALSE: Mark or circle the correct answer-your answer must be clearly marked. TRUE I FALSE I UNKNOWN : P is a subset of NP. TRUE I FALSE: log (n) E 0(log (vn) TRUE FALSE: 23n E 0(32m) TRUE | FALSE : n2 e O(log (n!)) TRUE | FALSE: Prim's Algorithm works correctly for graphs with negative weights. TRUE FALSE : 4n E ?(5n) TRUE I FALSE : All DFS traversals of a given graph will have the same number of tree edges. TRUE | PALSE: A connected weighted graphs with non-distinct edge weights (at least two edges have the same weight) must have more than one Minimum Weight Spanning Tree. TRUE I FALSE: log(Vn) E 0(log (n) TRUE I FALSE : Heap Sort is an in-place sort. TRUE I FALSE: All BFS traversals of a given graph will produce the same number of BFS trees. TRUE I FALSE n4 + n + 1 E ?(n2)
Explanation / Answer
UNKNOWN: P is a subset of NP
Answer: False
Explanation:
since each problem in P can be solved by nonderteministic Turing machine.. hence P is a problem in NP..
so P is a subset of NP, which is KNOWN
log(n) belongs to O(log n^1/2)
Answer: True
Explanation:
logn^1/2 = 1/2*logn = (logn)/2 = O(logn)
2^3n belongs to O(3^2n)
Answer: False
Explantion:
2^3n is O(2^n)
n^2 belongs to O(log^2(n!))
Answer :False
explanation:
n^2 is O(n^2)
does prim's algorithm work for negative weights
Answer:True
4n belongs to omega(5n)
Answer:True
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.