1. Let X be a problem that belongs to the class NP.
Then which one of the following
is TRUE?
a) There is no polynomial time algorithm for X.
b) If X can be solved deterministically in polynomial time, then P = NP.
c) If X is NP-hard, then it is NP-complete.
d) X may be undecidable.
Ans. C
2. Any integer strictly greater than the degree of a polynomial is a ___________ of that
polynomial.
a. coefficient
b. degree-bound
c. convolution
d. none of these.
Ans: b
3. _________ is the class of decision problems that can be solved by non-deterministic
polynomial algorithms?
a) NP
b) P
c) Hard
d) Complete
Ans. a
4. A non-deterministic algorithm is said to be non-deterministic polynomial if the time-efficiency of
its verification stage is polynomial.
a) true
b) false
Ans. A
5. To which of the following class does a CNF-satisfiability problem belong?
a) NP class
b) P class
c) NP complete
d) NP hard
Ans. C
6. If a ≡ b mod n , then
a) a and b leave the same nonnegative remainder when divided by n.
b) a and b leave the different nonnegative remainder when divided by n.
c) a and b need not leave the same nonnegative remainder when divided by n
d) none of the above
Ans. A
7. Solve the system of linear congruences
x ≡ 1 (mod 5)
x ≡ 2 (mod 7)
x ≡ 3 (mod 9)
x ≡ 4 (mod 11).
a) 693
b) 1731
c) 315
d) 495
Ans. B
8. Using Horners method, n-point evaluation takes
a. Θ(n)
b. Θ(n2)
c. Θ(n log n)
d. Θ(n3)
Ans: b
9. The inverse of evaluation is called
a. convolution
b. interpolation
c. modulation
d. none of these
Ans. B
10. In point-value representation of multiplication, if A and B are of degree - bound n, then C is of
degree-bound
a. 2n
b. n+1
c. 2n-1
d. 2n+1
Ans. a