#### Q 1.

###
Didn?t you buy ______ when you went shopping?

(A) any paper | (B) much paper | (C) no paper | (D) a few paper |

Check in with a Doubt. Check out without!

Didn?t you buy ______ when you went shopping?

(A) any paper | (B) much paper | (C) no paper | (D) a few paper |

Which of the following options is the closest in meaning to the sentence below?

(A) She had a terribe time at the party |

(B) She had a horribe time at the party |

(C) She had a terrific time at the party |

(D) She had a terrifying time at the party |

Which one of the following combinations is incorrect?

(A) Acquiescence ? Submission | (B) Wheedle ? Roundabout |

(C) Flippancy ? Lightness | (D) Profligate ? Extravagant |

Based on the given statements, select the most appropriate option to solve the given question.

If two floors in a certain building are 9 feet apart, how many steps are there in a set of stairs that extends from the first floor to the second floor of the building?

Statements:

(I) Each step is ¾ foot high

(II) Each step is 1 foot wide.

(A) Statement I alone is sufficient, but statement II alone is not sufficient. |

(B) Statement II alone is sufficient, but statement I alone is not sufficient. |

(C) Both statements together are sufficient, but neither statement alone is sufficient. |

(D) Statement I and II together are not sufficient. |

If

(A) | (B) |

(C) | (D) |

Match the following:

(P) Prim?s algorithm for minimum spanning tree | (i) Backtracking |

(Q) Floyd ? Warshal algorithm for all pairs shortest paths | (ii) Greedy method |

(R) Mergesort | (iii) Dynamic programming |

(S) Hamiltonian circuit | (iv) Divide and conquer |

(A) P-iii, Q-ii, R-iv, S-i |

(B) P-i, Q-ii, R-iv, S-iii |

(C) P-ii, Q-iii, R-iv, S-i |

(D) P-ii, Q-i, R-iii, S-iv |

Which one of the following is the recurrence equation for the worst case time complexity of the Quicksort algorithm for sorting *n* (*c* is a constant.

(A) T(n)=2T(n/2)+cn |

(B) T(n)=T(n-1)+T(1)+cn |

(C) T(n)=2T(n-1)+cn |

(D) T(n)=T(n/2)+cn |

The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum number of nodes in a binary tree of height 5 are

(A) 63 and 6, respectively |

(B) 64 and 5, respectively |

(C) 32 and 6, respectively |

(D) 31 and 5, respectively |

Match the following:

(P) Condition coverage | (i) Black-box testing |

(Q) Equivalence class partitioning | (ii) System testing |

(R) Volume testing | (iii) White-box testing |

(S) Alpha testing | (iv) Performance testing |

(A) P-ii, Q-iii, R-i, S-iv |

(B) P-iii, Q-iv, R-ii, S-i |

(C) P-iii, Q-i, R-iv, S-ii |

(D) P-iii, Q-i, R-ii, S-iv |

Which of the following is/are correct inorder traversal sequence(s) of binary search tree(s)?

I. | 3, 5, 7, 8, 15, 19, 25 |

II. | 5, 8, 9, 12, 10, 15, 25 |

III. | 2, 7, 10, 8, 14, 16, 20 |

IV. | 4, 6, 7, 9, 18, 20, 25 |

(A) I and IV only | (B) II and III only | (C) II and IV only | (D) II only |

Which one of the following is TRUE at any valid state in shift ? reduce parsing?

(A) Viable prefixes appear only at the bottom of the stack and not inside |

(B) Viable prefixes appear only at the top of the stack and not inside |

(C) The stack contains only a set of viable prefixes |

(D) The stack never contains viable prefixes |

Which one of the following is NOT equivalent to

(A) |

(B) |

(C) |

(D) |

For a set *A*, the power set of *A* is denoted by *A*={5,{6},{7}},which of the following options are TRUE?

I. | II. |

III. | IV. |

(A) I and III only | (B) II and III only |

(C) I, II and III only | (D) I, II and IV only |

Consider a 4-bit Johnson counter with an initial value of 0000. The counting sequence of this counter is

(A) 0, 1, 3, 7, 15, 14, 12, 8, 0 |

(B) 0, 1, 3, 5, 7, 9, 11, 13, 15, 0 |

(C) 0, 2, 4, 6, 8, 10, 12, 14, 0 |

(D) 0, 8, 12, 14, 15, 7, 3, 1, 0 |

For computer based on three-address instruction formats, each address feild can be used to specify which of the following:

(S1) A memory operand

(S2) A processor register

(S3) An implied accumulator register

(A) Either S1 or S2 |

(B) Either S2 or S3 |

(C) only S2 and S3 |

(D) All of S1, S2 and S3 |

Suppose two hosts use a TCP connection to transfer a large file. Which of the following statements is/are FALSE with respect to the TCP connection?

I. | If the sequence number of a segment is m, then the sequence number of the subsequent segment is always +1.m |

II. | If the estimated round trip time at any given point of time is t sec the value of the retransmission timeout is always set to greater than or equal to t sec. |

III. | The size of the advertised window never changes during the curse of the TCP connection. |

IV. | The number of unacknowledged bytes at the sender is always less than or equal to the advertised window. |

(A) III only | (B) I and III only |

(C) I and IV only | (D) II and IV only |

Suppose that everyone in a group of *N* people wants to communicate secretly with the *N*-1 others using symmetric key cryptographic system. The communication between any two persons should not be decodable by the others in the group. The number of keys required in the system as a whole to satisfy the confidentiality requirement is

(A) 2N | (B) N(N-1) | (C) N(N-1)/2 | (D) (N-1)^{2} |

Which of the following statements is/are FALSE?

I. XML overcomes the limitations in HTML to support a structured way of organizing content.

II. XML specification is not case sensitive while HTML specification is case sensitive.

III. XML supports user defined tags while HTML uses pre-defined tags.

IV. XML tags need not be closed while HTML tags be closed

(A) II only | (B) I only |

(C) II and IV only | (D) III and IV only |

Which one of the following fields of an IP header is NOT modified by a typical IP router?

(A) Checksum | (B) Source address | (C) Time to Live (TTL) | (D) Length |

In one of the pairs of protocols given below, both the protocols can use multiple TCP connections between the same client and the server. Which one is that?

(A) HTTP, FTP | (B) HTTP, TELNET |

(C) FTP, SMTP | (D) HTTP, SMTP |

For any two languages *L*_{1} and *L*_{2} such that *L*_{1} is context-free and *L*_{2} is recursively enumerable but not recursive, which of the following is/are necessarily true?

I. *L*_{1}) is recursive

II. *L*_{2}) is recursive

III.

IV.

(A) I only | (B) III only |

(C) III and IV only | (D) I and IV only |

The following two functions P1 and P2 that share a variable B with an initial value of 2 execute concurrently.

P1(){ C=B-1; B=2*c; } | P2(){ D=2*B; B=D-1; } |

The number of distinct values that B can possibly take after the execution is__________.

select operation in SQL is equivalent to

(A) the selection operation in relational algebra |

(B) the selection operation in relational algebra, except that select in SQL retains duplicates |

(C) the projection operation in relational algebra |

(D) the projection operation in relational algebra, except that select in SQL retains duplicates |

A file is organized so that the ordering of data records is the same as or close to the ordering of data entries in some index. Then that index is called

(A) Dense | (B) Sparse | (C) Clustered | (D) Unclustered |

What are the worst-case complexities of insertion and deletion of a key in a binary search tree?

(A) n) for both insertion and deletion |

(B) n) for both insertion and deletion |

(C) n) for insertion and n) for deletion |

(D) n) for insertion and n) for deletion |

Consider a max heap, represented by the array: 40, 30, 20, 10, 15, 16, 17, 8, 4.

Array Index | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 |

Value | 40 | 30 | 20 | 10 | 15 | 16 | 17 | 8 | 4 |

Now consider that a value 35 is inserted into this heap. After insertion, the new heap is

(A) 40, 30, 20, 10, 15, 16, 17, 8, 4, 35 |

(B) 40, 35, 20, 10, 30, 16, 17, 8, 4, 15 |

(C) 40, 30, 20, 10, 35, 16, 17, 8, 4, 15 |

(D) 40, 35, 20, 10, 15, 16, 17, 8, 4, 30 |

The binary operator

p | q | pq |

0 | 0 | 0 |

0 | 1 | 1 |

1 | 0 | 1 |

1 | 1 | 0 |

Which one of the following is true about the binary operator

(A) Both commutative and associative |

(B) Commutative but not associative |

(C) Not commutative but associative |

(D) Neither commutative nor associative |

Suppose *p,q,r,s,t*} is a lattice represented by the following Hasse diagram:

For any *x, y* *x* *y* and *x* *y* are join and meet of *x, y* respectively. Let *x,y,z*): *x,y,z* *L*. Let pr be the probability that an element (*x, y, z*) *x* *y* *z*) = (*x* *y*) *x* *z*). Then

(A) | (B) | (C) | (D) |

Consider the operations *f*(*X,Y,Z*) = *X'YZ*+ *XY'*+*Y'Z'* and *g*(*X,Y,Z*) = *X'YZ*+ *X'YZ'*+*XY*. Which one of the following is correct?

(A) Both {f} and {g} are functionally complete | (B) Only {f} is functionally complete |

(C) Only {g} is functionally complete | (D) Neither {f} nor {g} is functionally complete |

Consider the NPDA *q*_{0} is the initial state,

Which one of the following sequences must follow the string 101100 so that the overall string is accepted by the automation?

(A) 10110 | (B) 10010 | (C) 01010 | (D) 01001 |

Consider a main memory with five page frames and the following sequence of page references: 3, 8, 2, 3, 9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3. Which one of the following is true with respect to page replacement policies First In First Out(FIFO) and Least Recently Used(LRU)?

(A) Both incur the same number of page faults. |

(B) FIFO incurs 2 more page faults than LRU |

(C) LRU incurs 2 more page faults than FIFO |

(D) FIFO incurs 1 more page faults than LRU |

Consider the following 2X2 matrix *A* where two elements are unknown and are marked by *a* and *b*. The eigenvalues of this matrix ar ?1 and 7. What are the values of *a* and *b*?

(A) a = 6, b = 4 | (B) a = 4, b = 6 |

(C) a = 3, b = 5 | (D) a = 5, b = 3 |

An algorithm performs (log *N*)^{1/2} find operations, *N* insert operations, (log *N*)^{1/2} delete operations, and (log *N*)^{1/2} decrease-key operations on a set of data items with keys drawn form a linearly ordered set. For a delete operation, a pointer is provided to the record that must be deleted. For the decrease-key operation, a pointer is provided to the record that has its key decreased. Which one of the following data structures is the most suited for the algorithm to use, if the goal is to achieve the best asymptotic complexity considering all the operations?

(A) Unsorted array | (B) Min?heap |

(C) Sorted array | (D) Sorted doubly linked list |

Consider the following relations:

Student | Performance | ||||

Roll_No | Student _Name | Roll_No | Course | Marks | |

1 | Raj | 1 | Math | 80 | |

2 | Rohit | 1 | English | 70 | |

3 | Raj | 2 | Math | 75 | |

3 | English | 80 | |||

2 | Physics | 65 | |||

3 | Math | 80 |

Consider the following SQL query.

select S. Student_Name, sum (P.Marks)

FROM Student S, Performance P

WHERE S.Roll_No = P.Roll_No

GROUP BY S.Student_Name

The number of rows that will be returned by the SQL query is _______.

What is the output of the following C code? Assume that the address of *x* is 2000 (in decimal) and an integer requires four bytes of memory?

int main( )

{

unsigened int x[4][3] =

{(1,2,3), {4,5,6}, {7, 8, 9}, {10, 11, 12}};

printf(?%u, %u, %u?, x+3, *(x+3),*(x+2)+3);

}

(A) 2036, 2036, 2036 | (B) 2012, 4, 2204 |

(C) 2036, 10, 10 | (D) 2012, 4, 6 |

Consider the following C function.

int fun1 (int n){

int i, j, k, p, q = 0;

for (i = 1; i < n; ++i) {

p = 0;

for(j = n; j > 1; j = j/2)

++p;

for(k =1; k < p; k = k*2)

++q;

}

return q;

}

Which one of the following most closely approximates the return value of the function fun1?

(A) n^{3} | (B) n(log n)^{2} |

(C) n log n | (D) n log(log n) |

Consider the following pseudo code, where *x* and *y* are positive integers.

begin

q: = 0

r : = x

while r

being

r : = r ? y

q : = q + 1

end

end

The post condition that needs to be satisfied after the program terminates is

(A) {r = qx + y r < y} |

(B) {x = qy + r r < y} |

(C) {y = qx + r r < y} |

(D) {q + 1 < r ? y y > 0} |

We ________ our friend?s birthday and we ________ how to make it up to him.

(A) completely forget ? ? don?t just know |

(B) forgot completely ? ? don?t just know |

(C) completely forget ? ? just don?t know |

(D) forgot completely ? ? just don?t know |

Choose the statement where underlined word is used correctly.

(A) The industrialist had 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. |

A generic term that includes various items of clothing such as a skirt, a pair of trousers and a shirt is

(A) fabric | (B) textile |

(C) fibre | (D) apparel |

Based on the given statements, select the most appropriate option to solve the given question.

What will be the total weight of 10 poles each of same weight?

Statements:

(I) One fourth of the weight of a pole is 5 Kg.

(II) The total weight of these poles is 160 kg more than the total weight of two poles.

(A) Statement I alone is not sufficient. |

(B) Statement II alone is not sufficient. |

(C) Either I or II is sufficient. |

(D) Both statements I and II together are not sufficient. |

Consider a function f(*x*) = 1?|*x*| on ?1*x* *x* at which the function attains a maximum, and the maximum value of the function are:

(A) 0, ?1 | (B) ?1, 0 | (C) 0, 1 | (D) ? 1, 2 |

Out of the following four sentences, select the most suitable sentence with respect to grammar and usage:

(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 had been useful to them. |

In a triangle PQR, PS is the angle bisector of ^{o}. What is the length of PS?

(A) | (B) |

(C) | (D) |

If the list of letters, P, R, S, T, U is an arithmetic sequence, which of the following are also in arithmetic sequence?

I. 2P, 2R, 2S, 2T, 2U

II. P?3, R?3, S?3, T?3, U?3

III. P^{2}, R^{2}, S^{2}, T^{2}, U^{2}

(A) I only | (B) I and II |

(C) II and III | (D) I and III |

Consider the following two statements.

*S*1: If a candidate is known to be corrupt, then he will not be elected

*S*2: If a candidate is kind, he will be elected Which one of the following statements follows from *S*1 and *S*2 as per sound inference rules of logic?

(A) If a person is known to be 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 |

Let *R* be the relation on the set of positive integers such that *aRb* if and only if *a* and *b* distinct and have a common divisor other than 1. Which one of the following statements about *R* is true?

(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 |

An unordered list contains *n* distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is

(A) | (B) | (C) | (D) |

Consider the following statements.

I. The complement of every Turing decidable language is Turing decidable

II. There exists some language which is in NP but is not Turing decidable

III. If L is a language in NP, L is Turing decidable

Which of the above statements is/are true?

(A) Only II | (B) Only III |

(C) Only I and II | (D) Only I and III |

Consider the following function written in the C programming languages.

void foo(char *a)

{

if(*a && *a != ? ?)

{

foo(a+1);

putchar(*a);

}

}

The output of the above function on input ?ABCD EFGH? is

(A) ABCD EFCH | (B) ABCD |

(C) HGFE DCBA | (D) DCBA |

Consider a complete binary tree where the left and the right subtrees of the root are max-heaps. The lower bound for the number operations to convert the tree to a heap is

(A) | (B) |

(C) | (D) |

A software requirements specification (SRS) document should avoid discussing which one of the following?

(A) User interface issues |

(B) Non-functional requirements |

(C) Design specification |

(D) Interfaces with third party software |

Consider two decision problems *Q*1, *Q*2 such that *Q*1 reduces in polynomial time to 3?SAT and 3?SAT reduces in polynomial time to *Q*2. Then which one of the following is consistent with the above statement?

(A) Q1 is in NP, Q2 is NP hard. |

(B) Q2 is in NP, Q1 is NP hard. |

(C) Both Q1 and Q2 in NP. |

(D) Both Q1 and Q2 are NP hard. |

Match the following:

P. Lexical analysis Q. Parsing R. Register allocation S. Expression evaluation | 1. Graph coloring 2. DFA minimization 3. Post-order traversal 4. Production tree |

(A) P-2, Q-3, R-1, S-4 |

(B) P-2, Q-1, R-4, S-3 |

(C) P-2, Q-4, R-1, S-3 |

(D) P-2, Q-3, R-4, S-1 |

In the context of abstract-systax-tree (AST) and control-flow-graph (CFG), which one of the following is TRUE?

(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 N2 is present after the code corresponding to 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 in AST and CFG corresponds to at most one statement in the input program. |

Consider the basic COCOMO model where *E* is the effort applied in person-months, *D* is the development time in chronological months, *KLOC* is the estimated number of delivered lines of code(in thousands) and *a _{b}*,

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

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

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

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

Consider the following transaction involving two bank accounts x and y.

read(x); x : = x?50; write(x); read(y); y:=y+50; write(y)

The constraint that the sum of the accounts *x* and *y *should remain constant is that of

(A) Atomicity | (B) Consistency |

(C) Isolation | (D) Durability |

Identify the correct order in which a server process must invoke the function calls accept, bind, listen, and recv according to UNIX socket APL.

(A) listen, accept, bind, recv |

(B) bind, listen, accept, recv |

(C) bind, accept, listen, recv |

(D) accept, listen, bind, recv |

Which one of the following statements is NOT correct about HTTP cookies?

(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 |

Consider the following routing table at an IP router.

Network No. | Net Mask | Next Hop |

128.96.170.0 | 255.255.254.0 | Interface 0 |

128.96.168.0 | 255.255.254.0 | Interface 1 |

128.96.166.0 | 255.255.254.0 | R2 |

128.96.164.0 | 255.255.252.0 | R3 |

0.0.0.0 | Default | R4 |

For each IP address in Group I identify the correct choice of the next hop form Group II using the entries from the routing table above.

Group I | Group II |

i) 128.96.171.92 | a) Interface 0 |

ii) 128.96.167.151 | b) Interface 1 |

iii) 128.96.163.151 | c) R2 |

iv) 128.96.165.121 | d) R3 |

e) R4 |

(A) i-a, ii-c, iii-e, iv-d |

(B) i-a, ii-d, iii-b, iv-e |

(C) i-b, ii-c, iii-d, iv-e |

(D) i-b, ii-c, iii-e, iv-d |

Host A sends a UDP datagram containing 8880 bytes of user data to host B over an Ethernet LAN. Ethernet frames may carry data up to 1500 bytes (i.e. MTU = 1500 bytes).Size of UDP header is 8 bytes and size of IP header is 20 bytes. There is no option field in IP header. How many total number of IP fragments will be transmitted and what will be the contents of offset field in the last fragment?

(A) 6 and 925 | (b) 6 and 7400 |

(C) 7 and 1110 | (d) 7 and 8880 |

Assume that the bandwidth for a TCP connection is 1048560 bits/sec. Let

(A) 63 milliseconds, 65535 X 2^{14} |

(B) 63 milliseconds, 65535 X 2^{16} |

(C) 500 milliseconds, 65535 X 2^{14} |

(D) 500 milliseconds, 65535 X 2^{16} |

Consider a simple checkpointing protocol and the following set of operations in the log.

(start, T4); (write, T4, *y*, 2, 3); (start, T1); (commit, T4); (write, T1, *z*, 5, 7);

(checkpoint);

(start, T2); (write, T2, *x*, 1, 9); (commit, T2); (start, T3), (write, T3, *z*, 7, 2);

If a crash happens now the system tries to recover using both undo and redo operations, what are the contents of the undo list and the redo list?

(A) Undo: T3, T1; Redo: T2) |

(B) Undo: T3, T1; Redo: T2, T4 |

(C) Undo: none; Redo; T2, T4, T3, T1 |

(D) Undo: T3, T1, T4; Redo: T2) |

Consider two relations R_{1}(A,B) with the tuples(1, 5), (3, 7) and R_{2}(A, C) = (1, 7), (4, 9). Assume that R(A,B,C) is the full natural outer join of R_{1} and R_{2}. Consider the following tuples of the form (A, B, C): *a* =(1, 5, *null*), *b *=(1, *null*, 7), *c* = (3, *null*, 9), *d* = (4, 7, *null*), *e* = (1, 5, 7), *f* = (3, 7, *null*), *g* = (4, *null*, 9). Which one of the following statements is correct?

(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. |

Consider six memory partitions of sizes 200 KB, 400 KB, 600 KB, 500 KB, 300 KB and 250 KB, where KB refers to kilobyte. These partitions need to be allotted to four processes of sizes 357 KB, 210 KB, 468 KB and 491 KB in that order. If the best fit algorithm is used, which partitions are NOT allotted to any process?

(A) 200 KB and 300 KB |

(B) 200 KB and 250 KB |

(C) 250 KB and 300 KB |

(D) 300 KB and 400 KB |

Consider the intermediate code given below.

(1) i = 1

(2) j = 1

(3) t1 = 5 * i

(4) t2 = t1+ j

(5) t3 = 4 * t2

(6) t4 = t3

(7) a[t4] = ? 1

(8) j = j + 1

(9) if j < = 5 goto (3)

(10) i = i + 1

(11) if i < 5 goto (2)

The number of nodes and edges in the control-flow-graph constructed for the above code, respectively, are

(A) 5 and 7 | (B) 6 and 7 |

(C) 5 and 5 | (D) 7 and 8 |

Which of the following languages is/are regular?

L_{1}:{*wxw*^{R}|*w, x* *a,b*}^{*} and |*w*|, |*x*| > 0},w^{R} is the reverse of string *w*

L_{2}: {*a ^{n}b^{m}* |

L

(A) L_{1} and L_{3} only | (B) L_{2} only |

(C) L_{2} and L_{3} only | (D) L_{3} only |

Given below are some algorithms, and some algorithm design paradigms.

1. Dijkstra?s Shortest Path | i. Divide and Conquer |

2. Floyd-Warshall algorithm to computeall paris shortest path | ii. Dynamic Programming |

3. Binary search on a sorted array | iii. Greedy design |

4. Backtracking search on a graph | iv. Depth-first search |

v. Breadh-first search |

Match the above algorithms on the left to the corresponding design paradigm they follow.

(A) 1-i, 2-iii, 3-i, 4-v | (B) 1-iii, 2-ii, 3-i, 4-v |

(C) 1-iii, 2-ii, 3-i, 4-iv | (D) 1-iii, 2-ii, 3-i, 4-v |

A Young tableau is a 2D array of integers increasing from left to right and from top to bottom. Any unfilled entries are marked with

1 | 2 | 5 | 14 |

3 | 4 | 6 | 23 |

10 | 12 | 18 | 25 |

31 | | | |

When an element is removed from a Young tableau, other elements should be moved into its place so that the resulting table is still a Young tableau(unfilled entries may be filled in with a

Suppose you are provided with the following function declaration in the C programming language.

int partition(int a[ ], int n);

The function treats the first element of a[ ] as s pivot, and rearranges the array so that all elements less than or equal to the pivot is in the left part of the array, and all elements greater than the pivot is in the right part. In addition, it moves the pivot so that the pivot is the last element of the left part. The return value is the number of elements in the left part.

The following partially given function in the C programming language is used to find the kth smallest element in an array a[ ] of size n using the partition function. We assume k

int kth_smallest(int a[ ], int n, int k)

{

int left_end = partition(a, n);

if (left_end+1 = =k)

{

Return a[left_end];

}

if(left_end+1) > k)

{

return kth_smallest(________);

}

else

{

return kth_smallest(________);

}

}

The missing argument lists are respectively

(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) |

Which one of the following hash functions on integers will distribute keys most uniformly over 10 buckets numbered 0 to 9 for *i* ranging from 0 to 2020?

(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 |

The secant method is used to find the root of an equation f(x) = 0. It is started from two distinct estimates x_{a} and x_{b} for the root. It is an iterative procedure involving linear interpolation to a root. The iteration stops if f(x_{b}) is very small and then xb is the solution. The procedure is given below. Observe that there is an expression which is missing and is marked by? Which is the suitable expression that is to be put in place of ? so that it follows all steps of the secant method?

Secant

Initialize: x_{a}, x_{b},

//

// N = maximum number of iterations

f_{b} =f (x_{b})

i = 0

while (i < N and |f_{b}| >

i = i + 1 // update counter

x_{t} = ? // missing expression for

x_{a} = x_{b}

x_{b} = x_{t} // intermediate value

f_{b} = f (x_{b}) // function value at new xb

end while

if |f_{b}| >

write ?Non-convergence?

else

write ?return x_{b}?

end if

(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})) |

Let *f*(*x*) = *x*^{?(1/3)} and A denote the area of the region bounded by *f*(*x*) and the X?axis, when *x* varies from ?1 to 1. Which of the following statements is/are TRUE?

I. f is continuous in [?1, 1]

II. f is not bounded in [?1, 1]

III. A is nonzero and finite

(A) II only | (B) III only |

(C) II and III only | (D) I, II and III |

Consider the alphabet

X0 = 1 X1

X1 = 0 X1 + 1 X2

X2 = 0 X1 + {

Which one of the following choices precisely represents the strings in X0?

(A) 10(0*+(10)*)1 |

(B) 10(0*+(10*)*1 |

(C) 1(0+10)*1 |

(D) 10(0+10)*1+110(0+10)*1 |

A graph is self-complementary if it is isomorphic to its complement. For all selfcomplementary graphs on *n* vertices, *n* is

(A) A multiple of 4 |

(B) Even |

(C) Odd |

(D) Congruent to 0 mod 4, 1 mod 4. |

In a connected graph, a bridge is an edge whose removal disconnects a graph. Which one of the following statements is true?

(A) A tree has no bridge |

(B) A bridge cannot be part of a simple cycle |

(C) Every edge of a clique with size |

(D) A graph with bridge cannot have a cycle |

Which one of the following well formed formulae is a tautology?

(A) x y R(x, y)y x R(x, y) |

(B) x [y R(x,y)x,y)]) xyS(x,y) |

(C) [xy (P(x,y) x,y)] xy ( ¬P(x,y) x,y)] |

(D) x?y P(x,y) xyP(y,x) |

Which one of the following assertions concerning code inspection and code walkthrough is true?

(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 |

Extreme focus on syllabus and studying for tests has become such a dominant concern of Indian students that they close their minds to anything _____ to the requirements of the exam.

(A) related | (B) extraneous |

(C) outside | (D) useful |

select the pair that best expresses a relationship similar to that expressed in the pair

Children : Pediatrician

(A) Adult: Orthopaedist |

(B) Females : Gynaecologist |

(C) Kidney : Nephrologist |

(D) Skin: Dermatologist |

The Tamil version of _________ John Abraham ? starrer* Madras Cafe* _______ cleared by the Censor Board with no cuts last week, but the film?s distributors ______ no takers among the exhibitors for a release in Tamil Nadu _______ this Friday.

(A) Mr., was, found, on |

(B) a, was, found, at |

(C) the, was, found, on |

(D) a, being, find, at |

If ROAD is written as URDG, then SWAN should be written as:

(A) VXDQ |

(B) VZDQ |

(C) VZDP |

(D) UXDQ |

A function f(*x*) is linear and has a value of 29 at *x* = ? 2 and 39 at *x* = 3. Find its value at *x* =5.

(A) 59 | (B) 45 | (C) 43 | (D) 35 |

Alexander turned his attention towards India, since he had conquered Persia. Which one of the statements below is logically valid and can be inferred from the above sentence?

(A) Alexander would not have turned his attention towards India had he not conquered Persia. |

(B) Alexander was not ready to rest on his laurels, and wanted to march to India |

(C) Alexander was completely in control of his army and could command it to move towards India. |

(D) Since Alexander?s kingdom extended to Indian borders after the conquest of Persia, he was keen to move further. |

Most experts feel that in spite of possessing all the technical skills required to be a batsman of the highest order, he is unlikely to be so due to lack of requisite temperament. He was guilty of throwing away his wicket several times after working hard to lay a strong foundation. His critics pointed out that until he addressed this problem, success at the highest level will continue to elude him. Which of the statement (s) below is/are logically valid and can be inferred from the above passage?

I. He was already a successful batsman at the highest level.

II. He has to improve his temperament in order to become a great batsman.

III. He failed to make many of his good starts count.

IV. Improving his technical skills will guarantee success.

(A) (III) and (IV) | (B) (II) and (III) |

(C) (I), (II), and (III) | (D) (II) only |

Choose the most appropriate equation for the function drawn as a thick line, in the plot below.

(A) x = y?|y| | (B) x = ?(y?|y|) | (C) x = y+ |y| | (D) x = ? (y+|y|) |

The head of a newly formed government desires to appoint five of the six selected members P, Q, R, S, T, and U to portfolios of Home, Power, Defense, Telecom, and Finance. U does not want any portfolio if S gets one of the five. R wants either Home or Finance or no portfolio. Q says that if S gets either Power or Telecom, then she must get the other one. T insists on a portfolio if P get one.

Which is the valid distribution of portfolios?

(A) P ? Home, Q ? Power, R ? Defense, S ? Telecom, T ? Finance |

(B) R ? Home, S ? Power, P ? Defense, Q ? Telecom, T ? Finance |

(C) P ? Home, Q ? Power, T ? Defense, S ? Telecom, U ? Finance |

(D) Q ? Home. U ? Power, T ? Defense, R ? Telecom, P ? Finance |

Suppose *U* is the power set of the set *S* = {1, 2, 3, 4, 5, 6}. For any *T* *U*, let |*T*| denote the number of elements in *T* and *T'* denote the complement of *T*. For any *T* *R* be the set of all elements in *T* which are not in *R*. Which one of the following is true?

(A) X U (|X| = |X'|) |

(B) X U Y U (|X| = 2, |Y| = 5 and X Y = 0) |

(C) X U Y U (|X| = 2, |Y| = 3 and X Y = 0) |

(D) X U Y U (XY = Y'X') |

Consider the relation *X*(*P*, *Q*, *R*, *S*, *T*, *U*) with the following set of functional dependencies

*F* = {

{*P*, *R*} ? {*S*, *T*},

{*P*, *S*, *U*} ? {*Q*, *R*}

}

Which of the following is the trivial functional dependency in *F*^{+}, where *F*^{+} is closure of *F*?

(A) {P, R} ? {S, T} |

(B) {P, R} ? {R, T} |

(C) {P, S} ? {S} |

(D) {P, S, U} ? {Q} |

The maximum number of processes that can be in Ready state for a computer system with *n* CPUs is

(A) n | (B) n^{2} | (C) 2^{n} | (D) Independent of n |

Among simple LR (SLR), canonical LR, and look ? ahead LR (LALR), which of the following pairs identify the method that is very easy to implement and the method that is the most powerful, in that order?

(A) SLR, LALR |

(B) Canonical LR, LALR |

(C) LSR, canonical LR |

(D) LALR, canonical LR |

Let # be a binary operator defined as

*X* # *Y* = *X*' +*Y*' where *X* and *Y* are Boolean variables.

Consider the following two statements

*S*1 (*P* # *Q*) # *R* = *P* # (*Q* # *R*)

*S*2 *Q* # *R* = *R* # *Q*

Which of the following is/are true for hte Boolean variables *P*, *Q* and *R*?

(A) Only S1 is true |

(B) Only S2 is true |

(C) Both S1 and S2 are true |

(D) Neither S1 nor S2 are true |

In a web server, ten WebPages are stored with the URLs of the form http://www.yourname.com/*var*.html; where, *var* is a different number from 1 to 10 for each Webpage. Suppose, the client stores the Webpage with *var* = 1 (say W1) in local machine, edits and then tests. Rest of the WebPages remains on the web server. W1 contains several relative URLs of the form ?*var*.html? referring to the other WebPages. Which one of the following statements needs to be added in W1, so that all the relative URLs in W1 refer to the appropriate WebPages on the web server?

(A) <a href: ?http://www.yourname.com/?, href: ??var.html?> |

(B) <base href: ?http://www.yourname.com/?> |

(C) <a href: ?http://www.yourname.com/?> |

(D) <base href: ?http://www.yourname.com/?,range ??var.html?> |

Consider the following statements

I. TCP connections are full duplex

II. TCP has no option for selective acknowledgment

III. TCP connections are message streams

(A) Only I is correct |

(B) Only I and III are correct |

(C) Only II and III are correct |

(D) All of I, II, and III are correct |

Consider the equality *X*.

I.

II.

III.

IV.

The equality above remains correct if *X* is replaced by

(A) Only I |

(B) Only II |

(C) I or III or iv but not II |

(D) II or III or iv but not I |

In the given matrix

(A) |

(B) |

(C) |

(D) |

In a room there are only two types of people, namely Type 1 and Type 2. Type 1 people always tell the truth and Type 2 people always lie. You give a fair coin to a person in that room, without knowing which type he is from and tell him to toss it and hide the result from you till you ask for it. Upon asking, the person replies the following

?The result of the toss is head if and only if I am telling the truth.?

Which of the following options is correct?

(A) The result is head |

(B) The result is tail |

(C) If the person is of Type 2, then the result is tail |

(D) If the person is of Type 1, then the result is tail |

The result evaluating the postfix expression 10 5 + 60 6 / * 8 ? is

(A) 284 | (B) 213 | (C) 142 | (D) 71 |

Consider the following relation

Cinema (theater, address, capacity)

Which of the following options will be needed at the end of the SQL query

select P1. address

FROM Cinema P1

Such that it always finds the addresses of theaters with maximum capacity?

(A) WHERE P1. capacity >= All (select P2.capacity from Cinema P2) |

(B) WHERE P1. capacity >= Any (select P2. capacity from Cinema P2) |

(C) WHERE P1. capacity > All (select max(P2. capacity) form Cinema P2) |

(D) WHERE P1. capacity > Any (select max (P2. capacity) from Cinema P2) |

Two processes *X* and *Y* need to access a critical section. Consider the following synchronization construct used by both the processes

Process X/* other code for process X */while(true) { varP=true; while(varQ==true) { /* Critical Section */ varP=false; } } /* other code for process X*/ | Process Y/* other code for process Y */while(true) { varQ=true; while(varP==true) { /* Critical Section */ varQ=false; } } /* other code for process Y */ |

Here, varP and varQ are shared variables and both are initialized to false. Which one of the following statements is true?

(A) The proposed solution prevents deadlock but fails to guarantee mutual exclusion |

(B) The proposed solution guarantees mutual exclusion but fails to prevent deadlock |

(C) The proposed solution guarantees mutual exclusion and prevents deadlock |

(D) The proposed solution fails to prevent deadlock and fails to guarantee mutual exclusion |

Consider a machine with a byte addressable main memory of 2^{20} bytes, block size of 16 bytes and a direct mapped cache having 2^{12} cache lines. Let the addresses of two consecutive bytes in main memory be (E201F)_{16} and (E2020)_{16}. What are the tag and cache line address (in hex) for main memory address (E201F)_{16}?

(A) E, 201 | (B) F, 201 |

(C) E, E20 | (D) 2, 01F |

The velocity *v* (in kilometer/minute) of a motorbike which starts from rest, is given at fixed intervals of time t(in minutes) as follows:

t | 2 | 4 | 6 | 8 | 10 | 12 | 14 | 16 | 18 | 20 |

v | 10 | 18 | 25 | 29 | 32 | 20 | 11 | 5 | 2 | 0 |

The approximate distance (in kilometers) rounded to two places of decimals covered in 20 minutes using Simpson?s 1/3^{rd} rule is _______.

Given the function *F* = *P*' + *QR*, where F is a function in three Boolean variables *P*, *Q* and *R* and *P*' = !*P*, consider the following statements.

(S1) *F* =

(S2) *F* =

(S3) *F* =

(S4) *F* =

(A) (S1) ? False, (S2) ? True, (S3) ? True, (S4) ? False |

(B) (S1) ?True, (S2) ? False, (S3)- False, (S4) ? True |

(C) (S1) ? False, (S2)-False (S3)-True, (S4)-True |

(D) (S1)?True, (S2)-True, (S3)-False, (S4)-False |

Language L1 is polynomial time reducible to language L2. Language L3 is polynomial time reducible to L2, which in turn is polynomial time reducible to language L4. Which of the following is/are true?

I. if L4

II. if L1

III. L1

IV. if L4

(A) II only | (B) III only |

(C) I and iv only | (D) I only |

Which of the following languages are context-free?

L1 = {a^{m}b^{n}a^{n}b^{m} |m, n

L2 = {a^{m}b^{n}a^{m}b^{n}|m, n

L3 = {a^{m}b^{n}|m = 2n+1}

(A) L1 and L2 only | (B) L1and L3 only |

(C) L2 and L3 only | (D) L3 only |

Consider the following policies for preventing deadlock in a system with mutually exclusive resources.

i. Processes should acquire all their resources at the beginning of execution. If any resource is not available, all resources acquired so far are released.

ii. The resources are numbered uniquely, and processes are allowed to request for resources only in increasing resource numbers

iii. The resources are numbered uniquely, and processes are allowed to request for resources only in decreasing resource numbers

iv. The resources are numbered uniquely. A process is allowed to request only for a resource with resource number larger than its currently held resources

Which of the above policies can be used for preventing deadlock?

(A) Any one of i and iii but not ii or iv |

(B) Any one of i, iii, and iv but not ii |

(C) Any one of ii, and iii but not i or iv |

(D) Any one of i, ii, iii, and iv |

Consider the following code sequence having five instructions I1 to I5. Each of these instructions has the following format.

OP Ri, Rj, Rk

Where operation Op is performed on contents of registers Rj and Rk and the result is stored in register Ri.

I1: ADD R1, R2, R3

I2: MUL R7., R1, R3

I3: SUB R4, R1, R5

I4: ADD R3, R2, R4

I5: MUL R7, R8, R9

Consider the following three statements.

S1:There is an anti-dependence between instruction I2 and I5

S2:There is an anti-dependence between instructions I2 and I4

S3:Within an instruction pipeline an anti-dependence always creates one or more stalls

Which one of above statements is/are correct?

(A) only S1 is true |

(B) only S2 is true |

(C) Only S1 and S3 are true |

(D) Only S2 and S3 are true |

Consider the following two C code segments. Y and X are one and two dimensional arrays of size *n* and n

Code segment 1:

//initialize elements of Y to 0

//initialize elements X[i] [j] of X to i+j

for (i = 0; i < n; i++)

Y[i] += X[0] [i];

Code segment 2:

//initialize elements of Y to 0

//initialize elements X[i] [j] of X to i+j

for (i = 0; i < n; i++)

Y[i] += X[i] [0];

Which of the following statements is/are correct?

S1:Final contents of array Y will be same in both code segments

S2:Elements of array X accessed inside the for loop shown in code segment 1 are contiguous in main memory

S3:Elements of array X accessed inside the for loop shown in code segment 2 are contiguous in main memory

(A) Only S2 is correct |

(B) Only S3 is correct |

(C) Only S1 and S2 are correct |

(D) Only S1 and S3 are correct |

Consider the following partial Schedule S involving two transactions *T*1 and *T*2. Only the read and the write operations have been shown. The read operation on data item P is denoted by read (P) and the write operation on data item P is denoted by write (P).

Time | Transaction-id | |

T1 | T2 | |

1 | read(A) | |

2 | write(A) | |

3 | read(C) | |

4 | write(C) | |

5 | read(B) | |

6 | write(B) | |

7 | read(A) | |

8 | commit | |

9 | read(B) | |

Schedule S |

Suppose that the transaction *T*1 fails immediately after time instance 9. Which one of the following statements is correct?

(A) T2 must be aborted and then both T1 and T2 must be re ? started to ensure transaction atomicity |

(B) Schedule S is non ? recoverable and cannot ensure transaction atomicity |

(C) Only T2 must be aborted and then re ? started to ensure transaction atomicity |

(D) Schedule S is recoverable and can ensure atomicity and nothing else needs to be done |

If the following system has non ? trivial solution

*px* +*qy* + *rz* = 0

*qx* + *ry* + *pz* = 0

*rx* + *py* +*qz* = 0

then which one of the following Options is TRUE?

(A) p ? q +r = 0 or p = q = ? r |

(B) p + q ? r = 0 or p = ? q = r |

(C) p + q +r = 0 or p = q = r |

(D) p ? q +r = 0 or p = ? q = ? r |

If for non-zero x,

(A) |

(B) |

(C) |

(D) |

For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time?

Process | Arrival Time | Processing Time |

A | 0 | 3 |

B | 1 | 6 |

C | 4 | 4 |

D | 6 | 2 |

(a) First Come First Serve |

(b) Non ? preemptive Shortest Job First |

(c) Shortest Remaining Time |

(d) Round Robin with Quantum value two |

Consider three software items: Program? *X*, Control Flow Diagram of Program ? *Y* and Control Flow Diagram of Program ? *Z* as shown below

Program-X:sumcal (int maxint, int value) { int result=0, i=0; if(value < 0) { value= -value; } while((i<value) AND (result <= maxint)) { i=i+1; result=result+i; } if(result <= maxint) { printf(result); } else { printf("large"); } printf("end of program"); } | |

The values of McCabe?s Cyclomatic complexity of Program-*X*, Program-*Y*, and Program-*Z* respectively are

(A) 4, 4, 7 | (B) 3, 4, 7 |

(C) 4, 4, 8 | (D) 4, 3, 8 |

Let *R* be a relation on the set of ordered pairs of positive integers such that ((*p*,*q*), (*r*,*s*)) *R* if and only if *p*?*s* = *q*?*r*. Which one of the following is true about *R *

(A) Both reflexive and symmetric |

(B) Reflexive but not symmetric |

(C) Not reflexive but symmetric |

(D) Neither reflexive nor symmetric |

Let *f*(*n*) = *n* and *g*(*n*) = *n*^{(1+sin n)}, where *n* is a positive integer. Which of the following statements is/are correct?

i. *f*(*n*) = O(*g*(*n*))

ii. *f*(*n*) = *g*(*n*))

(A) only i | (B) Only ii |

(C) Both i and ii | (D) Neither i nor ii |

Consider the following grammar *G*

*S* ? *F* | *H*

*F*? *p* | *c*

*H*? *d* | *c*

Where *S*, *F*, and *H* are non ? terminal symbols, *p*, *d*, and *c* are terminal symbols. Which of the following statements (s) is/are correct?

S1. LL(1) can parse all strings that are generated using grammar *G*

S2. LR(1) can parse all strings that are generated using grammar *G*

(A) only S1 | (B) only S2 |

(C) Both S1 and S2 | (D) Neither S1 nor S2 |