GATE CSE 2016 SET-1


Q1.

Which of the following is/are example(s) of stateful application layer protocols? (i) HTTP (ii) FTP (iii) TCP (iv) POP3
GateOverflow

Q2.

Consider a carry lookahead 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
GateOverflow

Q3.

\lim_{x\rightarrow 4}\frac{sin(x-4)}{x-4}=_________.
GateOverflow

Q4.

The attributes of three arithmetic operators in some programming language are given below. The value of the expression 2-5+1-7*3 in this language is_______ .
GateOverflow

Q5.

Which of the following languages is generated by the given grammar? S\rightarrow aS|bS|\varepsilon
GateOverflow

Q6.

Consider the following context-free grammars: G1: S\rightarrowaS|B, B\rightarrowb|bB G2: S\rightarrowaA|bB, A\rightarrowaA|B|\varepsilon, B\rightarrowbB|varepsilon Which one of the following pair of languages is generated by G1 and G2, respectively?
GateOverflow

Q7.

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 following process scheduling algorithms would minimize the average waiting time in the ready queue?
GateOverflow

Q8.

A sender uses the Stop-and Wait ARQ protocol for reliable transmission of frames. Frames are of size 1000bytes and the transmission rate at the sender is 80Kbps(1Kbps=1000 bits/second). Size of anacknowledgement is 100bytes and the transmission rate at the receiver is 8Kbps. The one-way propagation delay is 100milliseconds. Assuming no frame is lost, the sender throughput is _____bytes/second.
GateOverflow

Q9.

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. The head is initially at cylinder number 63, moving to wards larger cylinder numbers on its servicing pass. The cylinders are numbered from 0to 199. The total head movement (in number of cylinders) incurred while servicing these requests is____ .
GateOverflow

Q10.

Consider the Boolean operator with the following properties: x \# 0=x, x \# 1=\bar{x}, x \# x=0 and x \# \bar{x}=1. Then x \# y is equivalent to
GateOverflow