1. 10bps
2. 12 bps
3. 11 bps
4. 13 bps
12 bps
1. 0.6
2. 0.1
3. 0.2
4. 0.5
0.6
1. A. The 2-Satisfiability problem is in P.
2. B. A sub exponential function from N to N is one that is O (2nc) for every positive real number
3. C. If there is an NP-complete language in Time(f) for some sub-exponential function f, then NP subexp, where Subexp=U{Time(f) | f is sub exponential}
4. Both a and b
5. None of these
C. If there is an NP-complete language in Time(f) for some sub-exponential function f, then NP subexp, where
Subexp=U{Time(f) | f is sub exponential}
1. k- color ability problem
2. Exact cover problem
3. Sum-of-subset problem
4. None of these
Exact cover problem
1. 2 V
2. (4/3) V
3. 4 V
4. 8 V
4 V
1. 2 V
2. (4/3) V
3. 4 V
4. 8 V
4 V
1. 50 Ω
2. 100 Ω
3. 5 kΩ
4. 10.1 kΩ
50 Ω
1. k2
2. k
3. (1/k)
4. √k
k
1. Y = AB + AB +C
2. Y = + AB +
3. Y = A + B +C
4. Y =AB + B +
Y = + AB +
1. 2
2. 3
3. 4
4. 5
5