CS and IT GATE 2017 Set-1 Questions with Answer

Ques 27 COA


A cache memory unit with capacity of N words and block size of B words is to be designed. If it is designed as direct mapped cache, the length of the TAG field is 10 bits. If the cache unit is now designed as a 16-way set-associative cache, the length of the TAG field is ______ bits.


14 is the correct answer.


Ques 28 COA


Consider a 2-way set associative cache with 256 blocks and uses LRU replacement, Initially the cache is empty. Conflict misses are those misses which occur due the contention of multiple blocks for the same cache set. Compulsory misses occur due to first time access to the block. The following sequence of accesses to memory blocks

(0,128,256,128,0,128,256,128,1,129,257,129,1,129,257,129)

is repeated 10 times. The number of conflict misses experienced by the cache is ___________.


76 is the correct answer.


Ques 29 COA


Consider a RISC machine where each instruction is exactly 4 bytes long. Conditional and unconditional branch instructions use PC- relative addressing mode with Offset specified in bytes to the target location of the branch instruction. Further the Offset is always with respect to the address of the next instruction in the program sequence. Consider the following instruction sequence

Instr.No Instruction
i: add R2,R3,R4
i+1 sub R5,R6,R7
i+2 cmp R1,R9,R10
i+3 beq R1,offset


If the target of the branch instruction is i, then the decimal value of the Offest is __________.


-16 is the correct answer.


Ques 30 COA


Consider the expression (a-1) * ((( b + c ) / 3 )) + d)). Let X be the minimum number of registers required by an optimal code generation (without any register spill) algorithm for a load/store architecture, in which

(i) only load and store instructions can have memory operands and
(ii) arithmetic instructions can have only register or immediate operands The value of X is ________.


2 is the correct answer.


Ques 31 COA


The n-bit fixed-point representation of an unsigned real number X uses f bits for the fraction part. Let i = n - f. The range of decimal values for X in this representation is

A

2-f

B

2-f to ( 2i-2-f)

C

0 to 2-i

D

0 to (2i - 2-f)



Ques 32 Computer Network


The values of parameters for the Stop-and – Wait ARQ protocol are as given below.

Bit rate of the transmission channel = 1Mbps
Propagation delay from sender to receiver = 0.75 ms
Time to process a frame = 0.25ms
Number of bytes in the information frame = 1980
Number of bytes in the acknowledge frame = 20
Number of overhead bytes in the information frame = 20


Assume that there are no transmission errors. Then the transmission efficiency ( expressed in percentage) of the Stop-and – Wait ARQ protocol for the above parameters is _________( correct to 2 decimal place)


a is the correct answer.


Ques 33 Computer Network


In a RSA cryptosystem a particular A uses two prime numbers p = 13 and q =17 to generate her public and private keys. If the public key of A is 35. Then the private key of A is ____________.


11 is the correct answer.


Ques 34 Computer Network


Consider a TCP client and a TCP server running on two different machines. After completing data transfer, the TCP client calls close to terminate the connection and a FIN segment is sent to the TCP server. Server-side TCP responds by sending an ACK which is received by the client-side TCP. As per the TCP connection state diagram(RFC 793), in which state does the client side TCP connection wait for the FIN from the server-side TCP?

A

LAST-ACK

B

TIME-WAIT

C

FIN-WAIT-1

D

FIN-WAIT-2



Ques 35 Computer Network


A computer network uses polynomial over GF(2) for error checking with 8 bits as information bits and uses x3 + x + 1 as the generator polynomial to generate the check bits. In this network, the message 01011011 is transmitted as

A

01011011010

B

01011011011

C

01011011101

D

01011011100



Ques 36 Computer Network


A sender S sends a message m to receiver R, which is digitally signed by S with its private key. In this scenario, one or more of the following security violations can take place.

(I) S can launch a birthday attack to replace m with a fraudulent message.
(II) A third party attacker can launch a birthday attack to replace m with a fraudulent message.
(III) R can launch a birthday attack to replace m with a fraudulent message.

A

(I) only

B

(II) only

C

(I) and (II) only

D

(II) and (III) only



Ques 37 Data Structure


Let A be an array of 31 numbers consisting of a sequence of 0’s followed by a sequence of 1’s. The problem is to find the smallest index i such that A[i] is 1 by probing the minimum number of locations in A. The worst case number of probes performed by an optimal algorithm is________.


a is the correct answer.


Ques 38 Data Structure


Let T be a tree with 10 vertices. The sum of the degrees of all the vertices in T is _____.


18 is the correct answer.


Ques 39 Data Structure


Let G = (V, E) be any connected undirected edge-weighted graph. The weights of the edges in E are positive any distinct. Consider the following statements:

I. Minimum Spanning Tree of G is always unique.
II. Shortest path between any two vertices of G is always unique.

Which of the above statements is/are necessarily true?

A

I only

B

II only

C

both I and II

D

neither I and II



Unique Visitor Count

Total Unique Visitors

Loading......