Related InterviewSolutions

• A recursive function h, is defined as follows :h(m) = k, if m = 0 = 1, if m = 1 = 2 h(m – 1) + 4h(m – 2), if m ≥ 2If the value of h(4) is 88 then the value of k is :(A) 0(B) 1(C) 2(D) -1
• Given the following two languages :L1 = {an bn | n ≥ 0, n ≠ 100}L2 = {w ∈ {a, b, c}*| na(w) = nb(w) = nc(w)}Which of the following options is correct ?(A) Both L1 and L2 are not context free language(B) Both L1 and L2 are context free language.(C) L1 is context free language, L2 is not context free language.(D) L1 is not context free language, L2 is context free language.
• Match the following for Unix file system:(A) (1)(B) (2)(C) (3)(D) (4)
• In RSA public key cryptosystem suppose n = p ∗ q where p and q are primes. (e, n) and (d, n) are public and private keys respectively. Let M be an integer such that o < M < n and φ(n) = (p – 1)(q – 1). Which of the following equations represent RSA public key cryptosystem ? I. C ≡ Me(mod n) M ≡ (C)d(mod n) II.ed ≡ 1(mod n) III.ed ≡ 1(mod φ(n)) IV. C ≡ Me(mod φ(n)) M ≡ Cd(mod φ(n))Codes :(A) I and II(B) I and III(C) II and III(D) I and IV
• A node X on a 10 Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2 Mbps. Token bucket is initially filled with 16 megabits. The maximum duration taken by X to transmit at full rate of 10 Mbps is _________ secs.(A) 1(B) 2(C) 3(D) 4
• The asymptotic upper bound solution of the recurrence relation given by(A) O(n2)(B) O(n lg n)(C) O(n lg lg n)(D) O(lg lg n)
• Which of the following neural networks uses supervised learning ?(A) Multilayer perceptron(B) Self organizing feature map(C) Hopfield network(A) (A) only(B) (B) only(C) (A) and (B) only(D) (A) and (C) only
• Let R and S be two fuzzy relations defined as :Then, the resulting relation, T, which relates elements of universe x to the elements ofuniverse z using max-min composition is given by :(A) (1)(B) (2)(C) (3)(D) (4)
• Which one is correct w.r.t. RDBMS ?(A) primary key ⊆ super key ⊆ candidate key(B) primary key ⊆ candidate key ⊆ super key(C) super key ⊆ candidate key ⊆ primary key(D) super key ⊆ primary key ⊆ candidate key
• Let pk(R) denotes primary key of relation R. A many-to-one relationship that exists between two relations R1 and R2 can be expressed as follows :(A) pk(R2) → pk(R1)(B) pk(R1) → pk(R2)(C) pk(R2) → R1 ∩ R2(D) pk(R1) → R1 ∩ R2