Recent activity by NRN / GATE Overflow for GATE CSE

7 answers

1

GATE CSE 2014 Set 3 | Question: 24
A bit-stuffing based framing protocol uses an $\text{8-bit}$ delimiter pattern of $01111110.$ If the output bit-string after stuffing is $01111100101,$ then the input bit-string is: $0111110100$ $0111110101$ $0111111101$ $0111111111$

A bit-stuffing based framing protocol uses an $\text{8-bit}$ delimiter pattern of $01111110.$ If the output bit-string after stuffing is $01111100101,$ then the input bit...

22.5k views

commented Oct 28, 2017

1 answer

2

Test by Bikram | Mock GATE | Test 2 | Question: 9
Consider these three grammars. ... by $G2$, then it can be generated by $G1$. If w can be generated by $G3$, then it can be generated by $G1$.

Consider these three grammars.$$\begin{array}{|c|c|c|} \hline \textbf{Grammar G1:} & \textbf{Grammar G2:} & \textbf{Grammar G3:} \\ \hline E\rightarrow E+T \mid T & E\r...

847 views

commented Jan 25, 2017

1 answer

3

Test by Bikram | Mock GATE | Test 1 | Question: 43
What is the output of the following code snippet? #include<stdio.h> int main ( ) { int x = 2, y = 5; if (x < y) return (x = x+y); else printf (“ GO Mock 1 ”); printf(“ Welcome to GO Mock test ”); } GO Mock 1 Welcome to GO Mock Test No output GO Mock 1Welcome to GO Mock Test

What is the output of the following code snippet?#include<stdio.h int main ( ) { int x = 2, y = 5; if (x < y) return (x = x+y); else printf (“ GO Mock 1 ”); printf(�...

980 views

commented Jan 17, 2017

1 answer

4

Test by Bikram | Mock GATE | Test 1 | Question: 41
A file has $2^{29}$ records each of size 8B. One block of main memory is $128B$. Sparse indexing is done with one index record per memory block and one index record is of $1$ $Byte$. The blocks stored by the ... stored in disk. Blocks occupied by index are searched using binary search technique. Maximum number of blocks need to be read is _____.

A file has $2^{29}$ records each of size 8B. One block of main memory is $128B$. Sparse indexing is done with one index record per memory block and one index record is o...

1.4k views

commented Jan 16, 2017

2 answers

5

GATE CSE 1990 | Question: 3-ix
The number of ways in which $5\; A's, 5\; B's$ and $5\; C's$ can be arranged in a row is: $15!/(5!)^{3}$ $15!$ $\left(\frac{15}{5}\right)$ $15!(5!3!)$.

The number of ways in which $5\; A's, 5\; B's$ and $5\; C's$ can be arranged in a row is:$15!/(5!)^{3}$$15!$$\left(\frac{15}{5}\right)$$15!(5!3!)$.

3.1k views

answered Jan 2, 2017

5 answers

6

GATE CSE 1990 | Question: 5-c
For the synchronous counter shown in Fig$.3,$ write the truth table of $Q_{0}, Q_{1}$, and $Q_{2}$ after each pulse, starting from $Q_{0}=Q_{1}=Q_{2}=0$ and determine the counting sequence and also the modulus of the counter.

For the synchronous counter shown in Fig$.3,$ write the truth table of $Q_{0}, Q_{1}$, and $Q_{2}$ after each pulse, starting from $Q_{0}=Q_{1}=Q_{2}=0$ and determine the...

6.4k views

commented Jan 2, 2017

6 answers

7

GATE CSE 1990 | Question: 5-b
Show with the help of a block diagram how the Boolean function : $f=AB+BC+CA$ can be realised using only a $4:1$ multiplexer.

Show with the help of a block diagram how the Boolean function :$f=AB+BC+CA$can be realised using only a $4:1$ multiplexer.

4.5k views

commented Jan 2, 2017

8 answers

8

GATE CSE 2012 | Question: 32
Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location $X$, increments it by the value $i$, and returns the old value of $X$. It is used in the pseudocode shown below to implement ... take on a non-zero value when the lock is actually available works correctly but may starve some processes works correctly without starvation

Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location $X$, increments it by the value $i$, and returns the old value of $X...

30.1k views

commented Dec 1, 2016

1 answer

9

Made Easy test Series 2016 TCP Congestion Control
Consider the effect of using slow start on a line with 10 msec round trip time. The receiver window and the size of congestion window are set to 38 KB and 36 KB respectively. Sender side threshold is set to 18 KB. After 8 transmission a timeout occurs, after time out, the time taken to send first full window of 18 KB is ________ (in msec).

Consider the effect of using slow start on a line with 10 msec round trip time. Thereceiver window and the size of congestion window are set to 38 KB and 36 KBrespectivel...

1.8k views

commented Nov 3, 2016

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true