Recent activity by chandrikabhuyan8 / GATE Overflow for GATE CSE

21 answers

1

GATE CSE 2016 Set 1 | Question: 54
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of $1$ $\text{megabyte}$ and the maximum output rate is $20$ $\text{megabytes}$ per $\text{second}$. Tokens arrive at a rate to ... to send $12$ $\text{megabytes}$ of data. The minimum time required to transmit the data is _____________ $\text{seconds}$.

For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of $1$ $\text{megabyte}$ and the maximum output rate is $2...

42.5k views

commented Jan 27, 2020

18 answers

2

GATE CSE 2017 Set 2 | Question: 44
Two transactions $T_1$ and $T_2$ are given as $T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$ $T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$ where $r_i(V)$ denotes a $\textit{read}$ operation by transaction $T_i$ on a variable $V$ and $w_i(V)$ denotes a ... by transaction $T_i$ on a variable $V$. The total number of conflict serializable schedules that can be formed by $T_1$ and $T_2$ is ______

Two transactions $T_1$ and $T_2$ are given as$T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$$T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$where $r_i(V)$ denotes a $\textit{read}$ operation by transaction...

72.7k views

commented Dec 7, 2019

6 answers

3

GATE CSE 1997 | Question: 12
Consider a hash table with $n$ buckets, where external (overflow) chaining is used to resolve collisions. The hash function is such that the probability that a key value is hashed to a particular bucket is $\frac{1}{n}$. The hash table is initially ... in any of the $K$ insertions? What is the probability that the first collision occurs at the $K^{th}$ insertion?

Consider a hash table with $n$ buckets, where external (overflow) chaining is used to resolve collisions. The hash function is such that the probability that a key value ...

10.6k views

commented Dec 2, 2019

3 answers

4

Find the number of integral solutions using generating function
Find the number of integral solutions of $\large 2x + y + z = 20$ with $x, y, z >= 0$ ? I tried finding coefficient of $x^{20}$ in $(1 + x^2 + x^3 + ...... + x^{10})(1+ x^2 + .......... + x^{20})^2$, but it gives wrong answer ?

Find the number of integral solutions of $\large 2x + y + z = 20$ with $x, y, z >= 0$ ?I tried finding coefficient of $x^{20}$ in $(1 + x^2 + x^3 + ...... + x^{10})(1+ x^...

9.2k views

commented Nov 29, 2019

12 answers

5

GATE CSE 2015 Set 2 | Question: 48
A half adder is implemented with XOR and AND gates. A full adder is implemented with two half adders and one OR gate. The propagation delay of an XOR gate is twice that of an AND/OR gate. The propagation delay of an AND/OR gate is ... adder is implemented by using four full adders. The total propagation time of this $4$-bit binary adder in microseconds is ______.

A half adder is implemented with XOR and AND gates. A full adder is implemented with two half adders and one OR gate. The propagation delay of an XOR gate is twice that o...

62.0k views

commented Nov 22, 2019

1 answer

6

UGC NET CSE | June 2019 | Part 2 | Question: 79
Which of the following problems is/are decidable problem(s) (recursively enumerable) on turing machine $M$? $G$ is a CFG with $L(G)=\phi$ There exist two TMs $M_1$ and $M_2$ such that $L(M) \subseteq \{L(M_1) \cup L(M_2)\} = $ language of ... $\omega$ using at most $2^{\mid \omega \mid}$ cells of tape i and ii only i only i, ii and iii iii only

Which of the following problems is/are decidable problem(s) (recursively enumerable) on turing machine $M$?$G$ is a CFG with $L(G)=\phi$There exist two TMs $M_1$ and $M_2...

2.7k views

answered Aug 1, 2019

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