Question 1 
A  Statement I alone is not sufficient 
B  Statement II alone is not sufficient 
C  Either I or II alone is sufficient 
D  Both statements I and II together are not sufficient. 
Question 2 
A  0, 1

B  1, 0

C  0, 1

D  1, 2

Question 3 
A  fabric 
B  textile 
C  fibre 
D  apparel 
Question 4 
A  The industrialist load a personnel jet.

B  I write my experience in my personnel diary. 
C  All personnel are being given the day off. 
D  Being religious is a personnel aspect. 
Question 5 
A  Completely forgot    don’t just know

B  Forgot completely    don’t just know 
C  Completely forgot    just don’t know 
D  Forgot completely    just don’t know

Question 7 
A  Since the report lacked needed information, it was of no use to them.

B  The report was useless to them because there were no needed information in it.

C  Since the report did not contain the needed information, it was not real useful to them

D  Since the report lacked needed information, it would not have been useful to them.

Question 8 
A  I only 
B  I and II 
C  II and III 
D  I and III 
Question 9 
A  8 
B  9 
C  7 
D  6 
Question 10 
A  5.34 
B  6.74 
C  28.5 
D  45.49 
Question 11 
A  Θ(nlog n) 
B  Θ(n) 
C  Θ(log n) 
D  Θ(1) 
Question 12 
A  R is symmetric and reflexive but not transitive 
B  R is reflexive but not symmetric and not transitive 
C  R is transitive but not reflexive and not symmetric 
D  R is symmetric but not reflexive and not transitive 
Question 13 
A  Atomicity 
B  Consistency 
C  Isolation 
D  Durability 
Question 14 
A  19 
B  20 
C  21 
D  22 
Question 15 
A  E=a _{b}(KLOC)exp (b _{b} , D=c _{b}(E)exp (d _{b})

B  E=a _{b}(KLOC)exp (b _{b} , D=c _{b}(E)exp (d _{b})

C  E=a _{b}exp(b _{b}), D=c _{b}(KLOC)exp (d _{b}) 
D  E=a _{b}exp(D _{b}),D=c _{b}(KLOC)exp (b _{b}) 
Question 16 
A  If a person is known to corrupt, he is kind

B  If a person is not known to be corrupt, he is not kind

C  If a person is kind, he is not known to be corrupt

D  If a person is not kind, he is not known to be corrupt

Question 17 
A  14 
B  15 
C  16 
D  17 
Question 18 
A system has 6 identical resources and N processes competing for them. Each process can request atmost 2 resources. Which one of the following values of N could lead to a deadlock?
A  1 
B  2 
C  3 
D  6 
Question 19 
A  Ω(logn) 
B  Ω(n) 
C  Ω(nlog n) 
D  Ω(n^{2}) 
Question 20 
A  In both AST and CFG, let node, N_{2} be the successor of node N_{1}. In the input program, the code corresponding to N_{2} is present after the code corresponding in N_{1}.

B  For any input program, neither AST nor CFG will contain a cycle

C  The maximum number of successors of a node in an AST and a CFG depends on the input program

D  Each node is AST and CFG corresponds to at most one statement in the input program

Question 21 
A  6 
B  7 
C  5 
D  9 
Question 22 
A  User interface issues

B  Nonfunctional requirements

C  Design specification

D  Interfaces with third party software

Question 23 
A  listen, accept, bind recv

B  bind, listen, accept, recv 
C  bind, accept, listen, recv 
D  accept, listen, bind recv 
Question 24 
A  6 
B  7 
C  8 
D  9 
Question 25 
A  2046 
B  2047 
C  2048 
D  2049 
Question 26 
A  A cookie is a piece of code that has the potential to compromise the security of an internet user

B  A cookie gains entry to the user’s work area through an HTTP header 
C  A cookie has an expiry date and time

D  Cookies can be used to track the browsing pattern of a user at a particular site

Question 27 
A  ABCD EFGH

B  ABCD 
C  HGFE DCBA

D  DCBA 
Question 28 
A  12 
B  13 
C  14 
D  15 
Question 29 
A  2 
B  3 
C  4 
D  5 
Question 30 
A  P2,Q3,R1,S4 
B  P2,Q1,R4,S3 
C  P2,Q4,R1,S3 
D  P2,Q3,R4,S1 
Question 31 
A  Q_{1} is in NP, Q_{2} in NP hard

B  Q_{1} is in NP, Q_{2} is NP hard 
C  Both Q_{1} and Q_{2} are in NP

D  Both Q_{1} and Q_{2} are NP hard

Question 32 
A  22 
B  23 
C  24 
D  25 
Question 33 
A  51 
B  52 
C  53 
D  54 
Question 34 
A  Only II 
B  Only III 
C  Only I and II 
D  Only I and III 
Question 35 
A  36 
B  37 
C  38 
D  39 
Question 36 
A  A tree has no bridges 
B  A bridge cannot be part of a simple cycle 
C  Every edge of a clique with size 3 is a bridge (A clique is any complete sub graph of a graph) 
D  A graph with bridges cannot have a cycle

Question 37 
A  200KBand 300 KB

B  200KBand 250 KB 
C  250KBand 300 KB 
D  300KBand 400 KB 
Question 38 
A  Code inspection is carried out once the code has been unit tested 
B  Code inspection and code walkthrough are synonyms 
C  Adherence to coding standards is checked during code inspection

D  Code walkthrough is usually carried out by an independent test team

Question 39 
A  1i, 2iii, 3i, 4v. 
B  1iii, 2iii, 3i, 4v. 
C  1iii, 2ii, 3i, 4iv. 
D  1iii, 2ii, 3i, 4v. 
Question 40 
A  (a, left_end, k) and (a + left_end + 1, n – left_end – 1, k – left_end – 1)

B  (a, left_end, k) and (a, n – left_end – 1, k – left_end – 1)

C  (a + left_end + 1, n – left_end – 1, k – left_end – 1) and (a, left_end, k)

D  (a, n – left_end – 1, k – left_end – 1) and (a, left_end, k)

Question 41 
A  6 
B  6.1 
C  6.2 
D  6.3 
Question 42 
A  5 and 7 
B  6 and 7 
C  5 and 5 
D  7 and 8 
Question 43 
A  1 
B  2 
C  3 
D  4 
Question 44 
A  36 
B  37 
C  38 
D  39 
Question 45 
A  L_{1} and L_{3} only

B  L_{2} only

C  L_{2} and L_{3} only

D  L_{3} only

Question 46 
A  (016A)_{16} 
B  (016C)_{16} 
C  (0170)_{16} 
D  (0172)_{16} 
Question 47 
A  3 
B  4 
C  5 
D  6 
Question 48 
A  6 and 925 
B  6 and 7400 
C  7 and 1110 
D  7 and 8880 
Question 49 
A  ia, iic, iiie, ivd 
B  ia, iid, iiib, ive 
C  ib, iic, iiid, ive 
D  ib, iic, iiie, ivd 
Question 50 
A  R contains a,b,e,f,g but not c, d.

B  R contains all of a,b,c,d,e,f,g

C  R contains e,f,g but not a,b

D  R contains e but not f,g

Question 51 
A  Undo T_{3}, T_{1}; Redo T_{2}

B  Undo T_{3}, T_{1}; Redo T_{2}, T_{4}

C  Undo: none; redo: T_{2}, T_{4}, T_{3}, T_{1}

D  Undo T_{3}, T_{1}; T_{4}; Redo: T_{2}

Question 52 
A  36 
B  37 
C  38 
D  39 
Question 53 
A  h(i) = i^{2} mod 10

B  h(i) = i^{3} mod 10

C  h(i) = (11 *i^{2}) mod 10

D  h(i) = (12 * i) mod 10 
Question 54 
A  63 milliseconds, 65535×2^{14} 
B  63 milliseconds, 65535×2^{16}

C  500 milliseconds, 65535×2^{14}

D  500 milliseconds, 65535×2^{16}

Question 55 
A younf tableau is a 2D array of integers iniceasing from left to right and from top to bottom. Any unfilled entries are marked with
A  4 
B  5 
C  6 
D  7 
Question 56 
A  19.1 
B  19.2 
C  18.1 
D  18.2 
Question 57 
Consider the sequence of machine instruction given below
MUL R5,R0,R1 DIV R6,R2,R3 ADD R7,R5,R6 SUB R8,R7,R4 In the above sequence, R0 to R8 are general purpose registraters. In the instructions shown, the first register stores the result of the operation performed on the second and the third registers. This sequence of instructions is to be executed in a pipelined instruction processor with the following 4 stages: (1) Instruction Fetch and Decode (IF), (2) Operand Fetch (OF), (3) Perfom Operations (PO) and (4) Write back the result (WB). The IF, OF and WB stages take 1 clock cycle each instruction The PO stahe takes 1 clock cycle for ADD or SUB instruction, 3 clock cycles for MUL instruction and 5 clock cycles for DIV instructions. The pipelined processor uses operand foewarding from the PO stage to the OF stage. The number of clock cycles taken for the execution of the aboce sequence of instructions is _______
A  11 
B  12 
C  13 
D  14 
Question 58 
A  0 
B  1 
C  2 
D  3 
Question 59 
A  ∀x ∃y R(x,y)↔ ∃y ∀x R(x,y)

B  (∀x [∃y R(x,y)→S(x,y)])→ ∀x∃y S(x,y)

C  [∀x ∃y (P(x,y)→R(x,y)]↔[∀x ∃y ( ¬ P(x,y)∨R(x,y)] 
D  ∀x ∀y P(x,y)→ ∀x ∀y P(y,x)

Question 60 
A  A multiple of 4 
B  Even 
C  Odd 
D  Congruent to 0 mod 4, or, 1 mod 4

Question 61 
A  x_{b} – (f_{b}–f(x_{a}))f_{b} /(x_{b}–x_{a}) 
B  x_{a} – (f_{a}–f(x_{a}))f_{a} /(x_{b}–x_{a}) 
C  x_{b} – (x_{b}–x_{a})f_{b} /(f_{b}–f(x_{a})) 
D  x_{a} – (x_{b}–x_{a}) f_{a} /(f_{b}–f(x_{a})) 
Question 62 
A  2 
B  2 
C  1 
D  15 
Question 63 
A  II only 
B  III only 
C  II and III only 
D  I, II and III 
Question 64 
A  0.95 
B  0.96 
C  0.97 
D  0.98 
Question 65 
A  10(0* + (10*)* 1 
B  10(0* + (10)*)* 1 
C  1(0 + 10)* 1 
D  10(0 + 10)* 1 + 110(0 + 10)* 1 