GATE – 2 0 1 6

CS : COM PU T ER SCI EN CE
& I N F ORM AT I ON T ECH N OL OGY
Set - 2
N o. of Qu est i on s : 65 M a xi m u m M a r k s : 100

I N ST R U CT I ON S
1. Tot al of 65 quest ions car r ying 100 mar ks, out of which 10 quest ions car r ying a t ot al of 15 mar ks ar e in
Gener al Apt it ude (GA)
2. The Engineer ing M at hemat ics will car r y ar ound 15% of t h e t ot al m ar k s, t he Gener al Apt it ude sect ion
will car r y 15% of t h e t ot al m ar k s and t he r em ai n i n g 70% of t h e t ot al m ar k s.
3. Ty p es of Qu est i on s
(a ) M u l t i p l e Ch oi ce Qu est i on s (M CQ) car r ying 1 or 2 mar ks each in all paper s and sect ions. These
quest i ons ar e object i ve i n nat ur e, and each will have a choice of four opt i ons, out of whi ch t he
candidat e has t o mar k t he cor r ect answer (s).
(b) N u m er i cal An sw er Qu est i on s of 1 or 2 mar ks each in all paper s and sect ions. For t hese quest ions
t he answer is a r eal number, t o be ent er ed by t he candidat e using t he vir t ual keypad. No choices will
be shown for t hese t ype of quest ions.
4. For 1-m ar k mult iple-choice quest ions, 1/3 m ar k s will be deduct ed for a wr ong answer. L ikewise, for
2-m ar k s mult iple-choice quest ions, 2/3 mar ks will be deduct ed for a wr ong answer. Ther e is no negat ive
mar king for numer ical answer t ype quest ions.

GEN ERAL APT I T U D E (GA) 4. Pick the odd one from the following options.
(a) CADBE (b) JHKIL
(Q. 1 – 5) : Carry One Mark Each.
(c) XVYWZ (d) ONPMQ
1. The man who is now Municipal Commissioner
5. In a quadratic function, the value of the product
worked as____________________.
of the roots (, ) is 4. Find the value of
(a) the security guard at a university
(b) a security guard at the university  n  n
(c) a security guard at university   n   n
(d) the security guard at the university (a) n4
2. Nobody knows how the Indian cricket team is (b) 4n
going to cope with the difficult and seamer- (c) 22n–1
friendly wickets in Australia.
(d) 4n–1
Choose the option which is closest in meaning to
(Q. 6 – 10) : Carry Two Marks Each.
the underlined phrase in the above sentence.
6. Among 150 faculty members in an institute, 55
(a) put up with
are connected with each other through Facebook®
(b) put in with and 85 are connected through WhatsApp ®. 30
(c) put down to faculty members do not have Facebook ® or
(d) put up against WhatsApp ® accounts. The number of faculty
3. Find the odd one in the following group of words. members connected only through Facebook ®
mock, deride, praise, jeer accounts is______________.

(a) mock (a) 35

(b) deride (b) 45
(c) praise (c) 65
(d) jeer (d) 90
2 SOLVED PAPER – 2016 (SET - 2)

7. Computers were invented for performing only

high-end useful computations. However, it is no
T ECH N I CAL SECT I ON
understatement that they have taken over our (Q. 1 – 25) : Carry One Mark Each.
world today. The internet, for example, is 1. Consider the following expressions:
ubiquitous. Many believe that the internet itself (i) false (ii) Q
is an unintended consequence of the original
(iii) true (iv) P  Q
invention. With the advent of mobile computing
on our phones, a whole new dimension is now (v)  Q  P
enabled. One is left wondering if all these
The number of expressions given above that are
developments are good or, more importantly,
logically implied by P  (P  Q) is __________.
required.
2. Let f(x) be a polynomial and g(x) = f(x) be its
Which of the statement(s) below is/are logically
derivative. If the degree of (f(x) + f(–x)) is 10,
valid and can be inferred from the above
paragraph? then the degree of (g(x) – g(– x)) is __________.
(i) The author believes that computers are not 3. The minimum number of colours that is sufficient
good for us. to vertex-colour any planar graph is __________.
(ii) Mobile computers and the internet are both 4. Consider the systems, each consisting of m linear
intended inventions equations in n variables.
(a) (i) only (b) (ii) only (i) If m < n, then all such systems have a solution
(c) both (i) and (ii) (d) neither (i) nor (ii) (ii) If m > n, then none of these systems has a
8. All hill-stations have a lake. Ooty has two lakes. solution
Which of the statement(s) below is/are logically (iii)If m = n, then there exists a system which
valid and can be inferred from the above has a solution
sentences? Which one of the following is CORRECT?
(i) Ooty is not a hill-station. (a) I, II and III are true
(ii) No hill-station can have more than one lake. (b) Only II and III are true
(a) (i) only (b) (ii) only (c) Only III is true
(c) both (i) and (ii) (d) neither (i) nor (ii) (d) None of them is true
9. In a 2 × 4 rectangle grid shown below, each cell 5. Suppose that a shop has an equal number of LED
is a rectangle. How many rectangles can be bulbs of two different types. The probability of
observed in the grid? an LED bulb lasting more than 100 hours given
that it is of Type 1 is 0.7, and given that it is of
Type 2 is 0.4. The probability that an LED bulb
chosen uniformly at random lasts more than 100
hours is______________.
(a) 21 (b) 27
6. Suppose that the eigenvalues of matrix A are
(c) 30 (d) 36 1, 2, 4. The determinant of (A–1)T is _____.
10. 7. Consider an eight-bit ripple-carry adder for
2.5 computing the sum of A and B, where A and B
f(x)
2 are integers represented in 2’s complement form.
1.5 If the decimal value of A is one, the decimal value
1 of B that leads to the longest latency for the sum
0.5 to stabilize is______.
0
–4 –3 –2 –1 0 1 2 3 x4
8. Let, x1  x2 x3 x4 = 0 where x1, x2, x3, x4 are
–0.5 Boolean variables, and  is the XOR operator.
–1 Which one of the following must always be
–1.5
TRUE?
–2
(a) x1 x2 x3 x4 = 0
–2.5
(b) x1 x3 + x2 = 0
Choose the correct expression for f(x) given in
the graph. (c) x1  x 3  x 2  x 4
(a) f(x) = 1 – |x – 1| (b) f(x) = 1 + |x – 1| (d) x1 + x2 + x3 + x4 = 0
(c) f(x) = 2 – |x – 1| (d) f(x) = 2 + |x – 1|
SOLVED PAPER – 2016 (SET - 2)
9. Let X be the number of distinct 16-bit integers in
2’s complement representation. Let Y be the
number of distinct 16-bit integers in sign magnitude
representation. Then X – Y is __________.
10. A processor has 40 distinct instructions and
24 general purpose registers. A 32-bit instruction
word has an opcode, two register operands and
an immediate operand. The number of bits
available for the immediate operand field
is___________.
11. Breadth First Search (BFS) is started on a binary
tree beginning from the root vertex. There is a
vertex t at a distance four from the root. If t is
the n-th vertex in this BFS traversal, then the
maximum possible value of n is_________.
12. The value printed by the following program
is___________.
void f(int* p, int m){
m = m + 5;
*p = *p + m;
return;
}
void main()
{ (c) P is false and Q is true
int i=5, j=10;
f(&i, j);
printf("%d", i+j);
} is/are TRUE?
13. Assume that the algorithms considered here sort
the input sequences in ascending order. If the
input is already in ascending order, which of the
following are TRUE?
I. Quicksort runs in (n2) time
II. Bubblesort runs in (n2) time
III.Mergesort runs in (n) time
IV. Insertion sort runs in (n) time
(a) I and II only (b) I and III only
(c) II and IV only (d) I and IV only
14. The Floyd-Warshall algorithm for all-pair
shortest paths computation is based on
(a) Greedy paradigm
(b) Divide-and-Conquer paradigm.
(c) Dynamic Programming paradigm.
(d) neither Greedy nor Divide-and-Conquer nor
Dynamic Programming paradigm.
15. N items are stored in a sorted doubly linked list.
For a delete operation, a pointer is provided to
the record to be deleted. For a decrease-key
operation, a pointer is provided to the record on
which the operation is to be performed.
3
An algorithm performs the following operations
on the list in this order: (N) delete, O(logN)
insert, O(logN) find, and (N) decrease-key. What
is the time complexity of all these operations put
together?
(a) O(log2N) (b) O(N)
2
(c) O(N ) (d) (N2 log N)
16. The number of states in the minimum sized DFA
that accepts the language defined by the regular
expression
(0 + 1)* (0 + 1) (0 + 1)* is _________.
17. Language L1 is defined by the grammar:
S1  aS1b|
Language L2 is defined by the grammar:
S2  abS2 | 
Consider the following statements:
P: L1 is regular
Q: L2 is regular
Which one of the following is TRUE?
(a) Both P and Q are true
(b) P is true and Q is false
(d) Both P and Q are false
18. Consider the following types of languages: L1 :
Regular, L2 : Context-free, L3 : Recursive, L4 :
Recursively enumerable. Which of the following
I. L3  L4 is recursively enumerable
II. L2  L3 is recursive
III. L*1  L 2 is context-free
IV. L1  L2 is context-free
(a) I only(b) I and III only
(c) I and IV only(d) I, II and III only
19. Match the following:
(P) Lexical analysis (i) Leftmost derivation
(Q) Top down parsing (ii) Type checking
(R) Semantic analysis (iii) Regular expressions
(S) Runtime (iv) Activation records
environments
(a) P  i, Q  ii, R  iv, S  iii
(b) P  iii, Q  i, R  ii, S  iv
(c) P  ii, Q  iii, R  i, S  iv
(d) P  iv, Q  i, R  ii, S  iii
4 SOLVED PAPER – 2016 (SET - 2)
20. In which one of the following page replacement
algorithms it is possible for the page fault rate to
increase even when the number of allocated
frames increases?
(a) LRU (Least Recently Used)
(b) OPT (Optimal Page Replacement)
(c) MRU (Most Recently Used)
(d) FIFO (First In First Out)
21. B+ Trees are considered BALANCED because
(a) the lengths of the paths from the root to all
leaf nodes are all equal.
(b) the lengths of the paths from the root to all
leaf nodes differ from each other by at most 1.
(c) the number of children of any two non-leaf
sibling nodes differ by at most 1.
(d) the number of records in any two leaf nodes
differ by at most 1.
22. Suppose a database schedule S involves
transactions T1, ..., Tn. Construct the precedence
graph of S with vertices representing the
transactions and edges representing the conflicts.
If S is serializable, which one of the following
orderings of the vertices of the precedence graph
is guaranteed to yield a serial schedule?
(a) Topological order
(b) Depth-first order
(c) Breadth-first order
(d) Ascending order of transaction indices
23. Anarkali digitally signs a message and sends it
to Salim. Verification of the signature by Salim
requires
(a) Anarkali’s public key
(b) Salim’s public key
(c) Salim’s private key
(d) Anarkali’s private key
24. In an Ethernet local area network, which one of
the following statements is TRUE?
(a) A station stops to sense the channel once it
starts transmitting a frame.
(b) The purpose of the jamming signal is to pad
the frames that are smaller than the
minimum frame size.
(c) A station continues to transmit the packet
even after the collision is detected.
(d) The exponential backoff mechanism reduces
the probability of collision on retransmissions.
25. Identify the correct sequence in which the
following packets are transmitted on the network
by a host when a browser requests a webpage
from a remote server, assuming that the host has
just been restarted.
(a) HTTP GET request, DNS query, TCP SYN
(b) DNS query, HTTP GET request, TCP SYN
(c) DNS query, TCP SYN, HTTP GET request
(d) TCP SYN, DNS query, HTTP GET request
(Q. 26 – 55) : Carry Two Marks Each.
26. A binary relation R on N × N is defined as follows:
(a,b)R(c,d) if a  c or b  d. Consider the following
propositions:
P : R is reflexive
Q : R is transitive
Which one of the following statements is TRUE?
(a) Both P and Q are true
(b) P is true and Q is false
(c) P is false and Q is true
(d) Both P and Q are false
27. Which one of the following well-formed formulae
in predicate calculus is NOT valid?
(a) (xp(x)  xq(x))  (  x  p(x)  xq(x))
(b) (  xp(x)   xq(x))   x(p(x)  q(x))
(c)  x(p(x)  q(x))  (  xp(x)   xq(x))
(d) x(p(x)  q(x))  (xp(x)  xq(x))
28. Consider a set U of 23 different compounds in a
Chemistry lab. There is a subset S of U of
9 compounds, each of which reacts with exactly
3 compounds of U. Consider the following
statements:
I. Each compound in U\S reacts with an odd
number of compounds.
II. At least one compound in U\S reacts with an
odd number of compounds.
III.Each compound in U\S reacts with an even
number of compounds.
Which one of the above statements is ALWAYS
TRUE?
(a) Only I
(b) Only II
(c) Only III
(d) None
29. The value of the expression 1399 (mod 17), in the
range 0 to 16, is________
30. Suppose the functions F and G can be computed
in 5 and 3 nanoseconds by functional units
UF and UG, respectively. Given two instances of
UF and two instances of U G, it is required to
implement the computation F(G(X i )) for
1  i  10. Ignoring all other delays, the minimum
time required to complete this computation
is________nanoseconds.
SOLVED PAPER – 2016 (SET - 2) 5

31. Consider a processor with 64 registers and an (a) + – 1 6 7  2 ˆ 5 – 3 4 

instruction set of size twelve. Each instruction (b) – + 1  6 7 ˆ 2 – 5  3 4
has five distinct fields, namely, opcode, two source (c) – + 1  7 6 ˆ 2 – 5 * 4 3
register identifiers, one destination register
(d) 1 7 6  + 2 5 4 3  – ˆ –
identifier, and a twelve-bit immediate value. Each
instruction must be stored in memory in a byte- 37. Consider the following program:
aligned fashion. If a program has 100 int f(int *p, int n)
instructions, the amount of memory (in bytes) {
consumed by the program text is____________. if (n <= 1) return 0;
32. The width of the physical address on a machine else return max(f(p+1,n-1),p[0]-
is 40 bits. The width of the tag field in a 512 KB p[1]);
8-way set associative cacheis____________bits. }
33. Consider a 3 GHz (gigahertz) processor with a
int main()
three-stage pipeline and stage latencies 1, 2, and
{
3 such that 1 = 32/4 = 23. If the longest pipeline
stage is split into two pipeline stages of equal int a[] = {3,5,2,6,4};
latency, the new frequency is________GHz, printf("%d", f(a,5));
ignoring delays in the pipeline registers. }
34. A complete binary min-heap is made by including Note: max(x,y) returns the maximum of x and y.
each integer in [1,1023] exactly once. The depth The value printed by this programis___________.
of a node in the heap is the length of the path
38. Let A 1 , A 2 , A 3 , and A 4 be four matrices of
from the root of the heap to that node. Thus, the
dimensions 10 × 5, 5 × 20, 20 × 10, and 10 × 5,
root is at depth 0. The maximum depth at which
respectively. The minimum number of scalar
integer 9 can appear is __________.
multiplications required to find the product A1
35. The following function computes XY for positive A2 A3 A4 using the basic matrix multiplication
integers X and Y. method is___________.
int exp(int X, int Y) {
39. The given diagram shows the flowchart for a
int res = 1, a = X, b = Y; recursive function A(n). Assume that all
while ( b != 0 ){ statements, except for the recursive calls, have
if ( b%2 == 0) { a = a*a; b = b/2;} O(1) time complexity. If the worst case time
else { res = res*a; b = b-1; complexity of this function is O(n), then the least
} possible value (accurate up to two decimal
} positions) of  is_______.
return res; Flowchart for Recursive Function A(n)
} Start
Which one of the following conditions is TRUE A(n/2)
before every iteration of the loop?
(a) XY = ab
Return A(n/2) A(n/2) A(n/2) Return
(b) (res  a)Y = (res  X)b
(c) XY = res  ab A(n/2)
(d) XY = (res  a)b
36. Consider the following New-order strategy for Return A(n/2) Return
traversing a binary tree:
 Visit the root;
40. The number of ways in which the numbers
 Visit the right subtree using New-order;
1, 2, 3, 4, 5, 6, 7 can be inserted in an empty
 Visit the left subtree using New-order; binary search tree, such that the resulting tree
The New-order traversal of the expression tree has height 6, is__________.
corresponding to the reverse polish expression 3 Note: The height of a tree with a single node is 0.
4  5 – 2 ˆ 6 7  1 + – is given by:
6 SOLVED PAPER – 2016 (SET - 2)

41. In an adjacency list representation of an undirected 45. Which one of the following grammars is free from
simple graph G = (V,E), each edge (u, v) has two left recursion?
adjacency list entries: [v] in the adjacency list of u, (a) S  AB
and [u] in the adjacency list of v. These are called A  Aa | b
twins of each other. A twin pointer is a pointer from
Bc
an adjacency list entry to its twin. If |E| = m and
|V| = n, and the memory size is not a constraint, (b) S  Ab | Bb | c
what is the time complexity of the most efficient A  Bd | 
algorithm to set the twin pointer in each entry in Be
each adjacency list? (c) S  Aa | B
(a) (n2) A  Bb | Sc | 
(b) (n + m) Bd
(c) (m2) (d) S  Aa | Bb | c
(d) (n4) A  Bd | 
42. Consider the following two statements: B  Ae | 
I. If all states of an NFA are accepting states 46. A student wrote two context-free grammars G1
then the language accepted by the NFA is *. and G2 for generating a single C-like array
II. There exists a regular language A such that declaration. The dimension of the array is at least
for all languages B, A  B is regular. one. For example,
Which one of the following is CORRECT? int a[10][3];
(a) Only I is true The grammars use D as the start symbol, and
(b) Only II is true use six terminal symbols int ; id [ ] num.
(c) Both I and II are true Grammar G1Grammar G2
(d) Both I and II are false D  intL; D  intL;
43. Consider the following languages: L  id[E L  idE
L1 = {anbmcn+m : m, n =  1}
E  num] E  E[num]
L2 = {anbnc2n : n  1}
E  num][E E  [num]
Which one of the following is TRUE?
Which of the grammars correctly generate the
(a) Both L1 and L2 are context-free
declaration mentioned above?
(b) L1 is context-free while L2 is not context-free
(a) Both G1 and G2
(c) L2 is context-free while L1 is not context-free
(b) Only G1
(d) Neither L1 nor L2 is context-free
(c) Only G2
44. Consider the following languages.
(d) Neither G1 nor G2
L1 =  M | M takes at least 2016 steps on some 47. Consider the following processes, with the arrival
input}, time and the length of the CPU burst given in
L2 =  M | M takes at least 2016 steps on all milliseconds. The scheduling algorithm used is
inputs} and preemptive shortest remaining-time first.

L3 = M | M accepts }, Process Arrival Time Burst Time

P1 0 10
where for each Turing machine M, M denotes
P2 3 6
a specific encoding of M. Which one of the
following is TRUE? P3 7 1
(a) L1 is recursive and L2, L3 are not recursive P4 8 3
(b) L2 is recursive and L1, L3 are not recursive
The average turn around time of these processes
(c) L1, L2 are recursive and L3 is not recursive
is__________milliseconds.
(d) L1, L2, L3 are recursive
SOLVED PAPER – 2016 (SET - 2) 7

48. Consider the following two-process The smallest cache size required to ensure an
synchronization solution. average read latency of less than 6 ms
Process 0 is_______ MB.
-------- 51. Consider the following database schedule with
two transactions, T1 and T2.
Entry: loop while (turn == 1);
S = r2(X); r1(X); r2(Y); w1(X); r1(Y); w2(X); a1; a2
critical section)
where r i (Z) denotes a read operation by
Exit: turn=1;
transaction Ti on a variable Z, wi(Z) denotes a
Process 1 write operation by T i on a variable Z and a i
-------- denotes an abort by transaction Ti.
Entry: loop while (turn == 0); Which one of the following statements about the
critical section) above schedule is TRUE?
Exit: turn=0; (a) S is non-recoverable
The shared variable turn is initialized to zero. (b) S is recoverable, but has a cascading abort
Which one of the following is TRUE? (c) S does not have a cascading abort
(a) This is a correct two-process synchronization (d) S is strict
solution 52. Consider the following database table named
(b) This solution violates mutual exclusion water_schemes :
requirement water_schemes
(c) This solution violates progress requirement scheme_no district_name capacity
1 Ajmer 20
(d) This solution violates bounded wait
1 Bikaner 10
requirement
2 Bikaner 10
49. Consider a non-negative counting semaphore S.
3 Bikaner 20
The operation P(S) decrements S, and V(S)
1 Churu 10
increments S. During an execution, 20 P(S)
2 Churu 20
operations and 12 V(S) operations are issued in
1 Dungargarh 10
some order. The largest initial value of S for
which at least one P(S) operation will remain The number of tuples returned by the following
blocked is________. SQL query is_______.
50. A file system uses an in-memory cache to cache with total(name, capacity) as
disk blocks. The miss rate of the cache is shown select district_name, sum(capacity)
in the figure. The latency to read a block from from water_schemes
the cache is 1 ms and to read a block from the
disk is 10 ms. Assume that the cost of checking group by district_name
whether a block exists in the cache is negligible. with total_avg(capacity) as
Available cache sizes are in multiples of 10 MB. select avg(capacity)
90 from total
80 select name
70
from total, total_avg
Miss rate (%)

60
where total.capacity =
50 total_avg.capacity
40
53. A network has a data transmission bandwidth of
30 20 × 106 bits per second. It uses CSMA/CD in the
20 MAC layer. The maximum signal propagation
10 time from one node to another node is 40
0 microseconds. The minimum size of a frame in
0 10 20 30 40 50 60 70 80 90 the network is_______bytes.
Cache size (MB)
8 SOLVED PAPER – 2016 (SET - 2)

54. For the IEEE 802.11 MAC protocol for wireless 55. Consider a 128 × 10 3 bits/second satellite
communication, which of the following communication link with one way propagation
statements is/are TRUE? delay of 150 milliseconds. Selective retrans-
I. At least three non-overlapping channels are mission (repeat) protocol is used on this link to
available for transmissions. send data with a frame size of 1 kilobyte. Neglect
the transmission time of acknowledgement. The
II. The RTS-CTS mechanism is used for collision minimum number of bits required for the
detection. sequence number field to achieve 100% utilization
III.Unicast frames are ACKed. is__________.
(a) All I, II, and III (b) I and III only
(c) II and III only (d) II only

A N SWE R S
Gen er al Ap t i t u d e (GA)

1. (b) 2. (a) 3. (c) 4. (d) 5. (b) 6. (a) 7. (b) 8. (d)

9. (c) 10. (c)

Tech n i cal Sect i on

1. (3) 2. (9) 3. (4) 4. (c) 5. (0.55) 6. (0.125) 7. (– 1)

8. (c) 9. (1) 10. (16) 11. (31) 12. (30) 13. (d) 14. (c)

15. (c) 16. (2) 17. (c) 18. (d) 19. (b) 20. (d) 21. (a)

22. (a) 23. (a) 24. (d) 25. (c) 26. (a) 27. (d) 28. (b)

29. (4) 30. (30) 31. (500) 32. (24) 33. (4) 34. (8) 35. (c)

36. (c) 37. (3) 38. (1500) 39. (2.32) 40. (64) 41. (b) 42.(d)

43. (b) 44. (c) 45. (b) 46. (a) 47. (8.25) 48. (c) 49. (7)

50. (30) 51. (c) 52. (2) 53. (200) 54. (b) 55. (4)
SOLVED PAPER – 2016 (SET - 2) 9

E XP L AN T I ON S
GEN ERAL APT I T U D E (GA)  The number of faculty members connected
2. ‘Cope with’ means to put up with an unpleasant only through Facebook accounts
difficult situation. = 55 – 20 = 35
3. From the given words mock, deride and jeer are Facebook
synonyms of mockery. So, the word 'praise' is odd
one. 150
4. From option (a) From option (b)
35 20 65
C A D B E J H K I L WhatsApp

+1 +1 +1 +1
+1 +1 9. In given 2  4 rectangle grid, the following type of
From option (c) From option (d) rectangles are present.

X V Y W Z
The number of one figured rectangles = 8
O N P M Q
The number of two figured rectangles = 10
+1 +1 +1 +1 The number of three figured rectangles = 4
+1 +1
The number of four figured rectangles = 5
In options A, B and C, the letters skipped between
consecutive pair of letters in the English alphabet The number of six figured rectangles = 2
is in increasing order (i,e) A and B, H and I and V The number of eight figured rectangles = 1
and W but in option 'D' N and M are present Total no. of rectangles = 8 + 10 + 4 + 5 + 2 + 1 = 30
instead of M and N so, option 'D' is odd one from  The No. of rectangles observed in the given
the group. grid = 30.
 n  n  n  n 10. At x = 3 from given graph f(x) must be equals to
5. Given =
  n   n 1 1 zero
n
 n
  From option a
n n
   = n   n f(x) = 1 – x – 1
n   n at x = 3
 n  n f(x) = 1 – 3 – 1 = 1 – 2 = – 1
n  n = ()n So, it is false.
= (4)n From option b
(Since the value of the product of the roots f(x) = 1 + x – 1
= 4) at x = 3
n
So, the required value is 4 . f(x) = 1 + 3 – 1 = 1 + 2 = 3
6. Total number of faculty members = 150 So, it is false.
The number of faculty members having facebook  From option c
account = FB = 55 f(x) = 2 – x – 1
The number of faculty members having at x = 3
whatsApp = W = 85 f(x) = 2 – 3 – 1 = 2 – 2 = 0
The number of faculty members do not have So, it is true
facebook (or) WhatsApp accounts = 30
From option d
The number of faculty members having any
f(x) = 2 + x – 1
account = 150 – 30 = 120
at x = 3
The faculty members having both the accounts
f(x) = 2 + 3 – 1 = 2 + 2 = 4
= (FB + W) – (FB or W)
So, it is false.
= (55 + 85) – 120 = 20
10 SOLVED PAPER – 2016 (SET - 2)

T ECH N I CAL SECT I ON Now we use P(A)P(E / A) + P(B)P(E / B)

1. (a) P  (P  Q)  Q 1 1
=
 0.7 +  0.4 = 0.55
(b) P  (P  Q)  P Q 2 2
(c) P  (P  Q)  ~ Q P 6. Given the eigen values of matrix A is
So, the number of expression is 3.  = 1, 2, 4

2. From the given question A = 1  2  4 = 8

If f(x) is a polynomial of degree 'n' 1 1

 A–1 = =
Then f (x) is a polynomial of degree (n – 1) A 8

f(x) + f(–x) is a polynomial of degree 10 1 T

 A  = A–1
 g(x) – g(–x) is a polynomial of degree 9
: 10 : SET-2 Afternoon Session = 1 = 0.125
(OR) 8
If degree of {f(x) + f(x)} = 10, then the largest even 1
So the determinant of (A–1)T is (i.e. 0.125).
exponent of x in f(x) = 10. 8
Now, the largest odd exponent of x in g(x) = 9 7. When all bits in 'B' register is '1', then it gives
only the highest delay.
 degree of {g(x) – g(–x)} = 9
 '–1' in 8 bit notation of 2's complement
3. By 4 – color theorem, Every planar graph is
is 1111 1111
4 – colorable
9. The number of distinct values
4. Statement I
For 2's complement – (2n – 1 ) to + (2n – 1 – 1)
Consider 2 equations in three variables.
For sign magnitude – (2n – 1 –1) to + (2n – 1 – 1)
x–y+z=1
In 2's complement, let n = 2
–x + y – z = 2
 (– 22 – 1) to (22 – 1 – 1)
This system has no solution (inconsistent)
– 2 to +1  –2, –1, 0, +1
x = 1 and y = 1
 X=4
 Statement I is false
n = 2 in sign magnitude  –1 to +1
Statement II
 Y=3
Consider 3 equations in two variables.
 X–Y=4–3=1
x + y = 2,
10. 32 bits
x – y = 0,
3x + y = 4 A1 A2 Operand
Operation
This system has a unique solution
 Statement II is false. log240 log224 log224
Statement III 6 5 5 xxx
Consider a system with 2 equations and two  32 – 16 = 16
variables So, the number of bits available for the immediate
x + y = 2 and x – y = 0. operand field is 16.
The system has a solution x = 1 and y = 1 11. Maximum possible value of n for which we have
 Statement III is true complete tree and our 't' node is the last leaf node
at height 4.
5. From the given question
So, the maximum possible value of n
A  event of selection of type-1 bulb
= 1 + 2 + 4 + 8 + 16
B  event of selection of type-2 bulb
= 31
E  event of selection of bulb glow for more than
100 hrs
SOLVED PAPER – 2016 (SET - 2) 11
12. i j (iv) L1 is RL
*p = 5 10 L 2 is recursive
1001 1000 2001 2000
L1  L 2 is CFL is not possible
p m
So, the statements (i), (ii) and (iii) are correct.
1000 10
21. A Tree is called balanced, if the length of the paths
from the root to all leaf nodes are all equal.
m = m + 5; // m = 15
22. If a schedule(s) is serializable, the topological
*p = *p + m; // * p = *p + m = 5 + 15 order of a graph (also called precedence graph)
*p = 20 (i.e., i = 20) yields a serial schedule.
i + j = 20 + 10 = 30 23. Sign is sender's private key and the receiver side
So, the output of the given program is 30. verification of the signature is done with sender
13. 1. Quicksort will take worst case, if the input is public key.
in ascending order i.e (n2) 24. According to the concept of binary exponential
2. Insertion sort runs in (n) time. backoff algorithm the exponential backoff
mechanism reduces the probability of collision on
14. Dynamic programming
retransmissions.
0, 1
25. Theere are following steps in which packets are
16. q0 0, 1 q1 transmitted on the network by a host when
a browser requests a webpage from a remote
Given regular expression server :
(r) = (0 + 1)* (0 + 1) (0 + 1)* Step 1 : The client(browser) initiates a DNS
=2 query for remote server. It may be that
So, the number of states in minimal DFA is 2. they already have this server in their
17. From the given question DNS cache, in which case the client may
L1 : S1  aS1 b  simply send a TCP SYN directly to the
application server.
L2 : S2  abS2 
Step 2 : The client will next send a connection
L1 : {an bn  n > 0}  CFL
request to the application server. This
L2 : (ab)*  RL will be a TCP SYN packet, the first in
So, the given statements P is false and Q is true. the TCP three-way handshake.
18. From the given question Step 3 : Next, after the TCP connection has been
L1 : Regular established, the client will request data
L2 : CFL (Context-free) from the server. In the web-based
application, the client performs an
L3 : Recursive language
HTTP GET.
L4 : REL (Recursively enumerable.)
26. A binary relation R on N  N is defined as
(i) L 3 is Recursive (a, b) R(C, d)
L 3  L4 is REL (Recursively enumerable) Reflexive: (a, a) R(a, a)
(ii) L 2 is recursive Since a  a, and a  a
Transitive: (a, b) R (c, d) and (c, d) R(m, n) then
L 3 is recursive (a, b) R(m, n)
 L 2  L3 is also recursive Suppose (a, b) R(c, d)
(iii) L*1 is regular  a  c and b  d
and (c, d) R(m, n)
L2 is CFL (Context-free)
 c  m, d  n
 L*1 L2 is CFL
Since a  c, and c  m so a  m
Since CFL is closed under the intersection b  d and d  n, so b  n
with RL
 (a, b) R(m, n)
 RL CFL is CFL
12 SOLVED PAPER – 2016 (SET - 2)

(OR)  1316 = 1 (mod P)

P. we have a  a and b  b 1399 = (13)96.(13)3
 (a, b) R(a, b) = (1316)6.2197
 R is reflexive = 16.2197 (mod 17)
 P is true  1399 (mod 17) = 2197 (mod 17) = 4
Q. Let (a, b) R(c, d) and (c, d) R (e, f) (The remainder obtained by dividing 2197 with
17)
 {a  c and b  d} and { c  e and d  f}
So, the value of the given expression is 4.
 {a  e and b  f}
30. From the given question
 (a, b) R (e, f)
5*G + 3*F = 3*5 + 5*3 = 30 ns
 R is transitive
31. According to question
Hence both the statements P and Q are true.
One instruction needs 34 bits
27. (A) The well formed formula is valid, because
So number of bytes needed
L.H.S  R.H.S
= 5 (Since 1 byte = 8 bits)
(B) The well formed formula is valid, because
L.H.S  R.H.S.  Program size = 100
(C) 1. x{p(x)  q(x)} premise  Size of the memory (in bytes) = 500

2. p(a)  q(a) (1) E.S So the amount of memory consumed by the

program text is 500 bytes.
3. p(a) (2) simplification
32. Final Tag
4. q(a) (2) simplification cache
5. x p(x) (3) E.G Tag 219 Bytes Tag 16
3 2 Bytes
6. x q(x) (4) E.G
40 bits 40 bits
7. x p(x)  xq(x) (5), (6) conjunction It uses 8 way set associative
Proved  Tag size = 24 bits.
(D) Let p(x): x is a musician So the width of the tag field is 24 bits.
and q(x): x is a filmstar 33. From question
Let U = {Amitabh Bachchan, Arjun Rampal, Stage 1 (t1 ) Stage 2 (t 2 ) Stage 3 (t 3 )
Akshay Kumar, Ravi Shankar,
(3 / 4)t 2 1t2 (3 / 8)t2
Bismillah Khan }
Be the universe of discourse. Old pipeline Clock frequency is 3GHz if time
is t2.
Here antecedent of the implication is true but
consequent is false. Stage 1 (t1 ) Stage 21(t21 ) Stage 22(t 22 ) Stage 3(t3 )
(3/4)t 2 (t 2 / 2) (t 2 / 2) (3 / 8)t2
So option (D) is not valid.
28. Let us denote the problem by a non directed graph Clock frequency of new pipeline with time
with 23 vertices (compounds). If two compounds 4
(3/4)t2   3 GHz = 4 GHz
in chemistry lab react with each other, then there 3
exists an edge between the corresponding vertices. So, the new frequency is 4 GHz.
In the graph, we have 9 vertices with degree 35. XY = res * ab
3 (i.e. odd degree). By sum of degrees of vertices 36. –
theorem atleast one of the remaining vertices
should have odd degree.
 +
29. By Fermat's theorem,
– 2 * 1
If P is a prime number and P is not a divisor of a,
then aP – 1 = 1 (mod P) * 5 6 7
Here, 17 is a prime number and 17 is not a divisor 3 4
of 13.
SOLVED PAPER – 2016 (SET - 2) 13

Given expression is 34 * 5 – 2  6 7 * 1 + – 42. Both I and II are false.

Now Converse it into preorder 43. Given language is
1. Root L1: {an bm cn+m  m, n  1} – CFL
2. RST L2: {an bn c2n  n  1} – CSL
3. LST So, from the above language is is clear that L1
37. From the given program, we have is context-free language (CFL) but L 2 is not
context-free language (CFL)
0 1 2 3 4
Q 44. From the given language.
3 5 2 6 4
main () 100 L1 is Recursive
100 102 104 106 108
 P
L2 is Recursive
f(100, 5) 100
 and L3 is Not Recursive
max (f(102, 4); –2) 45. From option (b)

max (f(104, 3), 3) S  Ab  Bb 

 A  Bd   Generates finite language
max (f(106, 2), –4) Be 


max (f(108, 1), 2) No Recursion at all
 So, the given option (b) is free from left recursion.
0 46. Grammar1: Grammar2:
So, the value printed by the program is 3. D  int L; D  int L;
38. Let m 14 be the minimum number of scalar L  id [E L  id E
multiplication for which multiply sequence is E  num] E  E[num]
M1M2M3M4.
E  num][E E  [num]
where M1 = A, M2 = B, M3 = C, M4 = D
int a[10] [3];
Let d0 = 10, d1 = 5, d2 = 20, d3 = 10, d4 = 5
From Grammar1:
 m11 = m22 = m33 = m44 = 0
m12 = 1000 m23 = 1000 m34 = 1000 D  int L; D  int L;
m13 = 1500 m24 = 1250  int id [E]; (or)  int a[E];
 int a [num];  int a [num] [E
 m11  m 21  d 0  d1  d 4 , 
   int a [num] [num]
m14 = min  m12  m 34  d1  d 2  d 4 ,  = 1500
m  m  d  d  d   int a [10] [3];
 13 44 0 3 4 

From the given matrices From Grammar2:

OR D  int L;
There are 5 possible cases  int id E;
A(B(C D)), A((BC)D), ((AB)C)D, (A(BC))D, (AB)(CD).  int a E[num];
The scalar multiplications required are 1750,  int a [num] [num];
1500, 3500, 2000, 3000 respectively.  int a [10] [3];
 Minimum number of scalar multiplications
 Both G1 and G2 generates the string.
= 1500
int a[10] [3];
40. Formula is 2n, here n is 6
Hence, both the grammars G1 and G2 generate
26 = 64
the declaration.
The number of ways = 2n = 26 = 64
51. As there is no dirty-read in the given schedule,
(Here n = height of a tree = 6)
the schedule is both recoverable and cascadeless.
14 SOLVED PAPER – 2016 (SET - 2)

52. The result of the query is: 55. From the given question, we have 5 step problem
name 1. Calculate RTT = 2(Tp)
Bikaner 2. Calculate BR, window size in bits
churu 3. Calculate W = window in packets = BR/L
Total 4. For selective repeat, ASN is set to 2W
District Capacity 5. Sequence number, k
name Bandwidth (B) = 128  103 bps
Ajmeer 20 Propagation delay (TP) = 150 msec
Bikaner 40 Packet size(L) = 1 kilobyte
Churu 30 L
Transmission delay (Tt) =
Dungargarh 10 B
1  8  103 bits
Capacity of (Ajmer  Bikaner Tt =
Churu  Dung arg arh) 128  103 bps
Total – Average =
4 1
 Tt = sec
20  40  30  10 16
=
4 Tt = 64 msec
110 WS = sender window size
= = 25
4 Wc  Tt
 =
Total – avg Tt  2Tp
capacity WS  64
1 = 64  2  150
25
So, the number of tables returned by the given 364
= WS
SQL query is 2. 64
53. From the given data WS = 5.6875
The size of a frame(L) = ? WS + WR = Available sequence numbers for SR,
Transmission bandwidth (B) = 20 Mbps WS = WR (Here WR = receiver window size)
Propagation time (Tp) = 40 microse conds ASN = 2  WS
Tx = L/B = 100 ms ASN = 2  5.6875
Tx = 2Tp ASN = 11.375
The minimum size of a frame No. of bits in the sequence number
(Lmin) = 2Tp B = 2(40) (20)/8 = 200 Bytes = [log2 ASN]
54. In case of IEEE 802.11 MAC protocol for = [log2 11.375] = 4
wireless communication RTS and CTS mechanism So, the minimum number of bits required for the
is used for collision avoidance, not for collision sequence number field to achieve 100% utilization
detection. is 4.

