WWW.TOPPERSEXAM.

COM
2016 (SET-1)

GATE – 2016

CS: COMPUTER SCIENCE

& INFORMATION TECHNOLOGY

Set -1

No. of Questions : 65 Maximum Marks : 100

INSTRUCTIONS

1. Total of 65 questions carrying 100 marks. Out of which 10 questions

carrying a total of 15 marks are in General Aptitude (GA)
2. The Engineering Mathematics will carry around 15% of the total marks,
the General Aptitude section will carry 15% of the total marks and the
remaining 70% of the total marks.
3. Types of Questions
(a) Multiple Choice Questions (MCQ) carrying 1 or 2 marks each in all
papers and sections. These questions are objective in nature, and each
will have a choice of four options, out of which the candidate has to
mark the correct answer(s).
(b) Numerical Answer Questions of 1 or 2 marks each in all papers and
sections. For these questions the answer is a real number, to be entered
by the candidate using the virtual keypad. No choices will be shown for
these type of questions.
4. For 1 – mark multiple-choice questions, 1/3 marks will be deducted for
a wrong answer. Likewise, for 2 –marks multiple-choice questions, 2/3
marks will be deducted for a wrong answer. There is no negative
marking for numerical answer type questions.

GENERAL APTITUDE (GA)

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
(Q.1 – 5): Carry One Mark Each

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

(a) I will not leave the place until the minister does not meet me .

(b) I will not leave the place until the minister doesn’t not meet me.

(c) I will not leave the place until the minister does not meet me.

(d) I will not leave the place until the minister does not meets me .

An (d)

2. A rewording of something written or spoken is a __________

(a) paraphrase

(b)paradox

(c) paradigm

(d) paraffin

An (a)

3. Archimedes said , Give me a lever long enough and a fulcrum on which to place
it , and I will move the world. “

The sentence above id an example of a ______ statement.

(a) figurative

(b) collateral

(c) literal

(d) figurine

An (a)

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
4. if ‘reflags ‘ manse carefree , ‘otage ‘ means careful and ‘fertaga’ means
careless ,which of the following could mean ‘aftercare “ ?

(a)Zentaga

(b) tagafer

(c) tagazen

(d) relffer

An (c)

5. A cube is built using 64 cubic blocks of side one unit. After it is built ,one cubic
block is removed from every corner of the cube .The resulting surface area of the
body (in square units) after the removal is ______

(a) 56

(b)64

(c)72

(d)96

An (d)

(Q.6 – 10): Carry Two Marks Each

6. A shaving set company sells 4 different types of razors , Elegance , Smooth

Soft, and Executive Elegance sells at Rs 48 , Smooth at Rs. 173per piece . The
table below shows the numbers of each razor sold in each quarter of a year .

Quarter Elegance Smooth Soft Executive

/product
Q1 27300 20009 17602 9999
Q2 25222 19392 18445 8942
Q3 28973 22429 19544 10234
Q4 21012 18229 16595 10109

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
Which product contributes the greatest fraction to the revenue of the company in
that year ?

(a) Elegance

(b)Executive

(c) Smooth

(d) Soft

An (b)

7. Indian currency notes show the denomination indicated in at least seventeen

languages if this is not an indication of the nation’s diversity nothing else is .

Which of the following can be logically inferred from the above sentences ?

(a) India is a country of exactly seventeen languages .

(b)Linguistic pluralism is the only indicator of a nation’s diversity .

(c)Indian currency notes have sufficient space for all the Indian languages .

(d) Linguistic pluralism is strong evidence of India’s diversity .

An (d)

8. Consider the following statements relating to the level of poker play of four
players P, Q ,R and S .

I. P always beats Q

II. R always beats S

III. S loses to P only sometimes

IV. R always loses to Q

Which of the following can be logically inferred from the above statements ?

(i) P is likely to beat all the three other players

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
(ii) S is the absolute worst player in the set

(a) (i) only

(b)(ii) only

(c) (i) and (ii)

(d) neither (i)nor (ii)

An (a)

9. If which of the following is a factor of ?

(a)

(b)

(c) )

(d) )

An (b)

10.In a process , the number of cycles to failure decreases exponentially with an

increase in load At a load of 80 units it takes 100 cycles for failure. when the load
is halved, it takes 10000 cycles for failure the load for which the failure will
happen in 5000 cycles is_______.

(a) 40.00

(b)46.02

(c)60.01

(d) 92.02

An (b)

TECHNICAL SECTION

1. Let p, q , r, s represent the following propositions

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM

The integer   q) ^(  r˅  s)) is _____ .

(a)11

(b)25

(c)12

(d)10

An (a)

2. Let be the numbe of n- bit strings that do NOT contain two consecutive 1s
Which one of the following is the recurrence relation for ?

(a)

(b)

(c)

(d)

An (b)

3.

(a)6

(b)1

(c)0

(d)8

An (b)

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
4.A probability density function on the interval [a, 1 ] is given by 1/ and outside
this interval the value of the function is zero the value of a is ___ .

(a)0.9

(b)6.0

(c)0.5

(d)2.9

An (c)

5. Two eigenvalues of a 3 x 3 real matrix P are (2+ ) and 3 . The determinant of

P is ____ .

(a)6

(b)15

(c)12

(d)7

An (b)

6 . Consider the Boolean operator # with the following properties:

is equivalent to

(a)

(b) +

(c)

(d)

An (a)

7.The 16 bit 2’s complement representation of an integer is 1111 1111 1111

0101 ; its decimal representation is __________.
WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
(a)+45

(b)-11

(c)+88

(d)-56

An (b)

8. We want to design a synchronous counter that counts the sequence 0-1-2-0-3

and then repeats. The minimum number of J-K flip – flops required to implement
this counter is ________ .

(a)36

(b)44

(c)4

(d)7

An (c

9. A processor can support a maximum memory of 4 GB , where the memory is

word –addressable (a word consists of two bytes). The size of the address bus of
the processor is at least ____ bits .

(a)12

(b)30

(c)31

(d)65

An (c)

10. A queue is implemented using an array such that ENQUEUE and DEQUEUE
operations are performed efficiently which one of the following statements is
CORRECT (n refers to the number of items in the queue)?

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
(a) Both operations can be performed in O (1) time

(b)At most one operation can be performed in O (1) time but the worst case time
for the other operation will be Ω(n)

(c) The worst case time complexity for both operations will be Ω(n)

(d) Worst case time complexity of both operations will be Ω( log n)

An (a)

11. Consider the following directed graph :

The number of different topological orderings of the vertices of the graph is

_________ .

(a)09

(b)78

(c)6

(d)12

An (c)

12. Consider the following C program .

void f (int , short );

Void main ( )

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
Int i = 100 ;

Short s = 12;

Short * P = & s;

_____ ; // call to f ()

Which one of the following expressions , when placed in the blank above , will
NOT result in a type checking error ?

(a)f(s,*s)

(b) i =f (i,s)

(c) f (i,*s)

(d) f(i,*p)

An (d)

13. The worst case running times of

respectively are :

(a) Θ Θ (n log n ) , and Θ ( )

(b) Θ( ), Θ( ), and (n log n)

(c) Θ( ), Θ(n log n ) and Θ (n log n)

(d) Θ ( ), Θ (n log n ) , and Θ( ),

An (d)

14. Let G be a weighted connected undirected graph with distinct positive edge
weights .if every edge weight is increased by the same value ,then which of the
following statements is / are TRUE ?

P: Minimum spanning tree of G does not change

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
Q : shortest path between any pair of vertices does not change

(a) P only

(b) Q only

(c) Neither P nor Q

(d) Both p and Q

An (d)

15. Consider the following C program.

# include < stdio .h >

Void mystery (int * ptra , int * ptrb ) {

Int * temp ;

Temo = ptrb;

ptrb = ptra ;

ptra = temp ;

In main ( ) {

Int a = 2016 , b=0 , c=4 , d=42 ;

mystery (&a , &b );

If (a<c)

Mystery (&c , &a );

Mystery (&a , &d );

Print f (“% d \n” , a ) ;

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
The output of the program is _________ .

(a)2016

(b)2012

(c)2022

(d)2011

An (a)

16. Which of the following languages is generated by the given grammar ?

(a) In,m

(b){ I has equal number of a’s and b’s }

(c){ In I In

(d){a, b}*

An (d)

17. Which of the following decision problems are undesirables ?

I. Given NFAs N1and N2’ is L |( N1)  L (N2) =  ?

II . Give a CFG G = (N ,  ,P, S ) and a string  *, does L (G) ?

III. Give CFGs G1 and G2 ‘is L (G1)=L (G2) ?

Iv . Given a TM M , is L(M) =  ?

(a I and IV only

(b) II and III only

(c) III and IV only

(d) II and IV only

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
An (c)

18.Which one of the following regular expressions represents the language : the
set of all binary strings having two consecutive 0s and two consecutive 1s?

(a) (0+1) * 0011 (0+1)* +( 0+1)* 1100 (0+1)*

(b) (0+1) * (00 (0+1)*11 +11( 0+1)* 00) (0+1)*

(c) (0+1) * 00 (0+1)* +( 0+1)* 11 (0+1)*

(d) 00(0+1) * 11 (0+1)* +11( 0+1)* 00

An (b)

19. Consider the following code segment .

X=u –t ;

y=x* v ;

X=y +w ;

y=t –z ;

y=x* y;

The minimum number of total variables required to convert the above code
segment to static single assignment form is ___________.

(a)9

(b)24

(c)7

(d)45

An c)

20. Consider an arbitrary set of CPU – bound processes with unequal CPU burst
lengths submitted at the same time to a computer system .Which one of the

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
following process scheduling algorithms would minimize the average waiting time
in the ready queue ?

(a) Shortest remaining time first

(b) Round – robin with time quantum less than the shortest CPU burst

(c) Uniform random

(d) Highest priority first with priority proportional to CPU burst length

An (a)

21. Which of the following is NOT a superkey in a relational schema with

attributes V , W ,X ,Y ,Z and primary key V Y ?

(a) VXYZ

(b)VWXZ

(c) VWXY

(d) VWXYZ

An (b)

22. Which one of the following is NOT a part of the ACID properties of database
transactions ?

(a )A tomicity

(b)Consistency

(c)Isolation

(d) Deadlock – freedom

An (d)

23. A database of research articles in a journal uses the following schema .

(VOLUME NUMVER ,START PAGE END PAGE TIRLE YEAF PRICE )

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
The primary key is( VOLUME NUMVER ,START PAGE ,END PAGE ) and the following
functional dependencies exist in the schema .

(VOLUME NUMVER ,START PAGE END PAGE TIRLE

(VOLUME NUMVER YEAF

(VOLUME NUMVER ,START PAGE END PAGE PRICE

The database is redesigned to use the following schemas .

(VOLUME NUMVER ,START PAGE END PAGE

(VOLUME NUMVER YEAF)

Which is the weakest normal form that the now database satisfies but the old one
does not

(a) 1NF

(b)2NF

(c) 3NF

(d) BCNF

An (b)

24. Which one of the following protocols is NOT used to resolve one form of
address to another one ?

(a) DNS

(b)ARP

(c)DHCP

(d) RARP

An (a)

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
25. Which of the following is / are example (s) of stateful application layer
protocols ?

(i) HTTP

(ii)FTP

(iii) TCP

(iv) POP3

(a) (i) and (ii) only

(b) (ii) and (iii only

(c) (ii) and (iv) only

(d) (iv) only

An (c)

(Q.26 – 55): Carry Two Marks Each

26. The coefficient of is __________ .

(a)85

(b)12

(c)10

(d)1

An (c)

27. Consider the recurrence relation + Let

The value of K is __________.

(a)098

(b)673

(c)198
WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
(d)345

An (c)

28. A function , defined on the set of positive integers satisfies

the following properties :

Let R = { l΅ be the set of distinct values that F takes. The maximum

possible size of R is _________.

(a)4

(b)18

(c)57

(d)3

An (d)

29. Consider the following experiment ,

Step 1 . Flip a fair coin twice .

Step 2 . If the outcomes are (T AILS ,HEADS ) then out put Y and stop .

Step 3 . if the outcomes are either (HEADS HEADS ) or (HEADS TAILS ) , then output
N and stop

Step 4 . if the outcomes are (T AILS , T AILS) then go to step 1.

The probability that the output of the experiment is Y is (up to two decimal
places) _________ .

(a)00.88

(b)0.33

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
(c)88.0

(d)76.4

An (b)

30. Consider the two cascaded 2- to -1 multiplexers as shown in the figure .

The minimal sum of products form of the output x is

(a) +PQR

(b) QQ+ QR

(c) PQ + R

(d) R+ PQR

An (d)

31.The size o f the data count register of a DMA controller is 16 bits .The
processor needs to transfer a file of 29 ,154 kilobytes from disk to main
memory . The memory is byte addressable The minimum number of times the
DMA controller needs to get the control of the system bus from the processor
to transfer the file from the disk t main memory is _________.

(a)987

(b)234

(c)456

(d)333

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
An (c)

32.The stage delays in a 4-stage pipeline are 800, 500, 400 and 300
picoseconds. The first stage (with delay 800 picoseconds) is replaced with a
functionally equivalent design involving two stages with respective delays
600 and 350 picoseconds The throughput increase of the pipeline is ____
percent .

(a)99.89

(b)45.78

(c)23.78

(d)33.28

An (d)

33. Consider a carry look ahead adder for adding two n- bit integers built
using gates of fan –in at most two. The time to perform addition using this
adder is

(a)  (1)

(b)  (log (n) )

(c)  ( )

(d)  (n)

An (b)

34.The following function computes the maximum value contained in an

integer array

P[ ] of size

n (n > = 1) .

int max (int * p, int n ){

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
Int a =0 b= n -1;

While (___________) {

If (p[a] < = p [b] ) { a=a +1 ; }

Else {b=b -1 ;}

Return p[a];

The missing loop condition is

(a) a!=n

(b)b!=0

(c)b> (a+1)

(d)b! =a

An (d)

35. What will be the output of the following c program ?

Void count (int n ){

Static int d =1 ;

Pr tf (“% d” );

Pr tf (“% d” d);

D++;

If (n>1 )count (n-1 ) ;

Pr tf (“% d” d);

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
Void main ( ) {

Count (3) ;

(a)312213444

(b)312111222

(c)3122134

(d)3121112

An (a)

36. What will be the output of the following pseudo code when parameters are
passed by reference and dynamic scoping scoping is assumed ?

a=3 ;

Void n (x) {x=x* a; print (x) ; }

Void m (y) {a=1; a =y –a; n (a) ; -print (a) ;}

Void main ( ) {m(a) ;}

(a)6,2

(b)6,6

(c)4,2

(d)4,4

An (c)

37. An operator delete (i) for a binary heap data structure is to designed to
delete the item in the i=th node Assume that the heap is implemented in as
array and I refers to the I the index of the array if th heap tree has depth d
(number of edges on the path from the root to the farthest leaf ) them what is

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
the time complexity to re fix the heap efficiently after the removal of the
element ?

(a) O(1)

(b)O (d) but not O(1)

(c) O (2d) but not O (d)

(d) O (d2d) but not O (2d)

An (b)

38. Consider the weighted undirected graph with 4 vertices where the weight of
edge {I ,j} is given by the entry Wig in the matrix W.

W=

The largest possible integer value of x for which at least one shortest path
between some pair of vertices will contain the edge with weight x is_________ .

(a) 44

(b)11

(c)34

(d)22

An (b)

39. Let G be a complete undirected graph on 4 vertices ,having 6 edges with

weights being 1,2,3,4,5, and 6, The maximum possible weight that a minimum
weight spanning tree of F can have is ___________.

(a)7

(b)2

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
(c)0

(d)9

An (a)

40. G = (v ,E) is an undirected simple graph in which each edge has a distinct
weight , and e is a particular edge of G . Which of the following statements about
the minimum spanning trees( MsTs )of G is /are TRUE ?

I. if e is the lightest edge of some cycle in G , then every MST of G includes e

II. if e is the heavies edge of some cycle in G then every MST of G excludes e

(a) I only

(b)II only

(c) both I and II

(d) neither I nor II

An (c)

41. Let Q denote a queue containing sixteen number and S be an empty stack
.Head (Q) returns the element at the head of the queue Q without removing it
from Q Similarly Top (s) returns the element at the top of S without removing
it from S Consider the algorithm given below .

The maximum possible number of iterations of the while loop in the algorithm
is ___________ .

(a)456

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
(b)345

(c)256

(d)876

An ( c)

42. Consider the following context – free grammars : I,B bIbB

Which one of the following pairs of languages is generated by and

respectively ?

(a){ {

(b) { {

(c) { {

(d) { {

An (d)

43.Condider the transition diagram of a PDA given below with input alphabet
 = { X,Z } ,Z is the initial stack symbol, Let L
denote the language accepted by the PDA .

Which one of the following is TRUE ?

(a)L={ and is not accepted by any finite automata

(b)L= { and is not accepted by any deterministic PDA

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
(c) L is not accepted by any Turing machine that halts on every input

(d) L= { an I n In and is deterministic context free

An d)

44. Let X be a recursive language and Y be a recursively enumerable out not

recursive language Let W and Z be two languages such that reduces to W and Z
reduces to (reduction means the standard many one reduction). Which one fo
the following statements is TRUE ?

(a)W can be recursively enumerable and Z is recursive.

(b) W can be recursive and Z is recursively.

(c) W is not recursively enumerable and Z is recursive.

(d) W is not recursive enumerable and Z is not recursive.

An (c)

45. The attributes of three arithmetic operators in some programming language

are given below .

Operator Precedence Associatively Arty

+ High Left Binary

- Medium Right Binary

* Low Left Binary

The value of the expression 2- 5 + 1- 7* 3 in this language is _________.

(a)8

(b)4

(c)9

(d)3

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
An (c)

46. Consider the following Syntax Directed Translation Scheme (SDTS ) with non –
terminals {s ,A } and terminals {a,b}

S aA {print 1 }

S a { print 2 }

A Sb { print 3 }

Using the above SDTS the output printed by a bottom –up parser for the input alb
is :

(a) 132

(b) 223

(c) 231

(d) syntax error

An (c)

47. Consider a computer system with 40- bit virtual addressing and page size of
sixteen kilobytes if the computer system has a one level page table per process
and each page table entry requires 48 bits, then the size of the per process page
table is________ megabytes

(a)385MB

(b)384MB

(c)987MB

(d)099MB

An (b)

48. Consider a disk queue with requests for I/O to blocks on cylinders 47 ,38 121,
191, 87, 11. 92 ,10, The C – LOOK scheduling algorithm is used he head is initially

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
at cylinder number 63 ,moving towards larger cylinder numbers on its surviving
pass. The cylinders are numbered from0 to199.The total head movement (in
number of cylinders ) incurred while servicing these requests is _________

(a)342

(b)987

(c)456

(d)346

An (d)

49. Consider a computer system with ten physical page frames .the system is
provided wing an access sequence ( a1, a1……, a20, a1, a2…………. a20 ) Where each a1 is a
distinct virtual page number. The difference in the number of page faults between
the last in first out page replacement policy and the optimal page replacement
policy is ____________

(a)1

(b)8

(c)7

(d)10

An (a)

50. Consider the following proposed solution for the critical section problem
.There are n processes : p0 ………. pn-1 ,In the code, function pmax returns an
integer not smaller than any of its arguments For all It [i]is initialized to zero ,

Code for P:

do {

C[i]= 1; t[i]=pmax (t[0]……….t[n-1]) + 1; c [i]=0;for every J# I in { 0……….. n -1 }{

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
While (c[j]) ;

While (t [k ] ! = 0 && t [ k] < = t [i] ) ;

Critical Section ;

Remainder Section ;

} while (true ) ;

Which one of the j following is TRUE about the above solution ?

(a)At most one process can be in the critical section at any time

(b) The bounded wait condition is satisfied

(c)The progress condition is satisfied

(d) it cannot cause a deadlock

An (a)

51. Consider the following two phase locking protocol .Suppose a transaction T
accesses (for read or write operations ), a certain set of objects { O1 ,………. Ok }.This is
done in the following manner.

Step 1 . T acquires exclusive locks to O1 ,……,…. Ok in increasing order of their

addresses.

Step 2. The required operations are performed .

Step 3 . All locks are released .

This protocol will

(a) guarantee serializability and deadlock freedom

(b) guarantee neither serializability nor deadlock –freedom

(c) guarantee serializability but not deadlock freedom

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
(d) guarantee deadlock freedom but not serializability

Ans (a)

52.Consider that B wants to send a message m that t is digitally signed to A .Let

the pair o frigate and public keys for A and B be denoted by Kx and Kx+for x = A,B,
respectively Let kx(m) represent the operation of encrypting m with a key kx and H
(m) represent the message digest .which one of the following indicates the
CORRECT way of sending the message m along with the digital signature to A ?

(a) {m, kb+(H(m))}

(b) {m, kb- (H(m))}

(c) {m, kA -(H(m))}

(d) {m, kA +(H(m))}

An (b)

53. An IP datagram of size 1000 bytes arrives at a router. The router has to
forward this packet on a link who’s MTY (,maximum transmission unit is 100
bytes. Assume that the size of the IP header is 20 bytes.

The number of fragments that the IP datagram will be divided into for
transmission is _________

(a)11

(b)13

(c)90

(d)12

An (b)

54. For a host machine that uses the token bucket algorithm for congestion the
token bucket has a capacity of 1 megabyte and the maximum output rate is 20
megabytes per second. Tokens arrive at a rate to sustain output at a rate of 10

WWW.TOPPERSEXAM.COM
 WWW.TOPPERSEXAM.COM
megabytes per second .the token bucket is currently full and the machine needs
to send 12 megabytes of data. he minimum time required to transmit the data is
______seconds.

(a)0.9

(b)1.8

(c)1.1

(d)0.2

An (c)

55. A sender uses the Stop – and –Wait ARQ protocol for reliable transmission of
frames age of size 1000 bytes and the transmission rate at the sender is 80 Kbps
(1 kbps = 1000 bits / second ) Size of an acknowledgement is 100 bytes and the
transmission rate at the receiver is 8 Kbps. The one – way propagation delay is
1000 milliseconds. Assuming no frame is lost the sender throughput is _________
bytes/ second .

(a)2500

(b)2200

(c)4000

(d)2600

An (a)

WWW.TOPPERSEXAM.COM