Scribd
Upload
43 views3 pages

Week 12 Assignment Solution

This document contains 10 multiple choice questions about concepts in computational complexity theory including: 1) The value of any flow in a network is bounded by the capacity of any cut. 2) For any flow f and cut (S,T), the flow value equals the net flow across the cut. 3) The capacity of a specific cut (S,T) in a sample flow network is 5.

Uploaded by

shreyash
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
43 views3 pages

Week 12 Assignment Solution

This document contains 10 multiple choice questions about concepts in computational complexity theory including: 1) The value of any flow in a network is bounded by the capacity of any cut. 2) For any flow f and cut (S,T), the flow value equals the net flow across the cut. 3) The capacity of a specific cut (S,T) in a sample flow network is 5.

Uploaded by

shreyash
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Week 12 Assignment Solution

1. In a flow network, the value of any flow is ______________________ by capacity


of any cut.

A. bounded above
B. bounded below
C. Both A and B
D. None of the above

2. In a flow network, for any flow f and any cut (S,T), we have

A. | f | < f(S,T)
B. | f | > f(S,T)
C. | f | = f(S,T)
D. None of the above

3. Find the net flow across the cut (S,T) in the given flow network. Here S = {v 1 ,v 2 ,s}
and T = {v 3, v 4 ,t}.

A. 17
B. 19
C. 26
D. 23

Hints: Flow=12+11-4=19
4. When computing the nth fibonacci number, which of the following is a better idea, in
terms of computational complexity?

A. Recurrence relation F n =F n-1 + F n-2 without memoization


B. Dynamic Programming
C. Both A and B are equally good
D. Greedy Algorithm

5. In dynamic programming the technique of storing the previously calculated values is


called ___________

A) Combining
B) Hashing
C) Memoization
D) Dividing

6. What is meant by P-problem? (In terms of computational complexity )

A. Problems solvable in polynomial time


B. Problems solvable in exponential time
C. Problems solvable in finite time
D. Unsolvable problems

7. Which of the following is true?

A. P⊃EXP⊃R
B. (P−R)⊃EXP
C. P⊂EXP⊂R
D. P⊂EXP⊃R

8. Which of the following is true (assume that P ≠ NP)? (Here NPC stands for NP-
complete)

A. NP=NPC
B. P ⊂ NPC
C. P=NPC
D. NPC ∩ P= Φ
9. Decision problems which are solvable in polynomial time via a lucky algorithm are:

A. NP problems
B. EXP problems
C. R problems
D. All of the above

10. What is the capacity of the cut (S,T) in the flow network given below? S contains the
vertices s, o and p. T contains the vertices q, r and t.

A. 9
B. 5
C. 11
D. 8
Hints: Capacity=3+2=5

You might also like