Any buddy, please provide me the JEST theoretical computer science previous year paper………

This is the JEST theoretical computer science previous year paper:

(a) Let a and b be positive integers such that a>b and a2 − b2 is a prime number.

Then a2 b2 is equal to

(A) a b

(B) a + b

(C) a b

(D) none of the above

(b) When is the following statement true? (A ∪ B) ∩ C = A ∩ C

(A) If ¯A ∩ B ∩ C = φ

(B) If A ∩ B ∩ C = φ

(C) always

(D) never

(c) If a fair die (with 6 faces) is cast twice, what is the probability that the two

numbers obtained differ by 2?

(A) 1/12

(B) 1/6

(C) 2/9

(D) 1/2

(d) T(n) = T(n/2) + 2; T(1) = 1

When n is a power of 2, the correct expression for T(n) is:

(A) 2(log n + 1)

(B) 2 log n

(C) log n + 1

(D) 2 log n + 1