Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by arks
0
votes
1
#testbook_testseries leaky bucket
a leaky bucket used to control data flow,how many of data bits are left in bucket if host send a burst of data at the rate of 250 kbps for first 24 seconds and remain silent for next 16 seconds .then again burst of data is sent at the rate of 120 kbps for next 20 seconds and output rate is 8500 kbps?? $10^4$ $10^6$ $100$ $10^{8}$
a leaky bucket used to control data flow,how many of data bits are left in bucket if host send a burst of data at the rate of 250 kbps for first 24 seconds and remain sil...
1.1k
views
answered
Jan 25, 2023
Computer Networks
leaky-bucket
+
–
0
votes
2
Leaky bucket algorithm
2.1k
views
answered
Jan 25, 2023
Computer Networks
leaky-bucket
computer-networks
congestion-control
+
–
0
votes
3
GATE CSE 2004 | Question: 14
Consider the following relation schema pertaining to a students database: Students (rollno, name, address) Enroll (rollno, courseno, coursename) where the primary keys are shown underlined. The number of tuples in the student and Enroll tables are $120$ and $8$ respectively. What ... Student * Enroll), where *' denotes natural join? $8, 8$ $120, 8$ $960, 8$ $960, 120$
Consider the following relation schema pertaining to a students database:Students (rollno, name, address)Enroll (rollno, courseno, coursename)where the primary keys are s...
28.6k
views
answered
Nov 12, 2022
Databases
gatecse-2004
databases
easy
joins
natural-join
+
–
1
votes
4
Doubt
for all the above questions answer the following : a ) how many minimum relation tables are required which satisfy 1NF b) how many minimum relation tables are required which satisfy 3NF c) how many minimum relation tables are required which satisfy BCNF d) minimum tables required Note: please provide detailed answer
for all the above questions answer the following :a ) how many minimum relation tables are required which satisfy 1NFb) how many minimum relation tables are required whic...
2.5k
views
answered
Jan 29, 2022
Databases
databases
+
–
0
votes
5
countability
if a language is not recursively enumerable, then is it uncountable language? I believe every language over ∑ is subset of ∑* which is a countable set and as subset of countable set is countable therefore every language itself is countable whether it is recursively enumerable or not.
if a language is not recursively enumerable, then is it uncountable language? I believe every language over ∑ is subset of ∑* which is a countable set and as subset o...
341
views
answered
Jan 23, 2022
Theory of Computation
theory-of-computation
+
–
0
votes
6
Countability
A language in NOT - RE is un-countably infinite. true or false?
A language in NOT - RE is un-countably infinite. true or false?
1.9k
views
answered
Jan 23, 2022
Theory of Computation
theory-of-computation
+
–
8
votes
7
GATE CSE 1997 | Question: 15
Consider the following function. Function F(n, m:integer):integer; begin if (n<=0) or (m<=0) then F:=1 else F:F(n-1, m) + F(n, m-1); end; Use the recurrence relation ... value of $F(n, m)$? How many recursive calls are made to the function $F$, including the original call, when evaluating $F(n, m)$.
Consider the following function.Function F(n, m:integer):integer; begin if (n<=0) or (m<=0) then F:=1 else F:F(n-1, m) + F(n, m-1); end;Use the recurrence relation $\beg...
4.6k
views
answered
Aug 2, 2020
Algorithms
gate1997
algorithms
recurrence-relation
descriptive
+
–
1
votes
8
GATE CSE 2008 | Question: 78
Let $x_n$ denote the number of binary strings of length $n$ that contain no consecutive $0$s. Which of the following recurrences does $x_n$ satisfy? $x_n = 2x_{n-1}$ $x_n = x_{\lfloor n/2 \rfloor} + 1$ $x_n = x_{\lfloor n/2 \rfloor} + n$ $x_n = x_{n-1} + x_{n-2}$
Let $x_n$ denote the number of binary strings of length $n$ that contain no consecutive $0$s.Which of the following recurrences does $x_n$ satisfy?$x_n = 2x_{n-1}$$x_n = ...
8.5k
views
answered
Aug 1, 2020
Algorithms
gatecse-2008
algorithms
recurrence-relation
normal
+
–
3
votes
9
GATE CSE 2011 | Question: 21
Consider a hypothetical processor with an instruction of type $\text{LW R1, 20(R2)}$, which during execution reads a $32\text{-bit}$ word from memory and stores it in a $32\text{-bit}$ ... mode implemented by this instruction for the operand in memory? Immediate addressing Register addressing Register Indirect Scaled Addressing Base Indexed Addressing
Consider a hypothetical processor with an instruction of type $\text{LW R1, 20(R2)}$, which during execution reads a $32\text{-bit}$ word from memory and stores it in a ...
17.5k
views
answered
Jul 10, 2020
CO and Architecture
gatecse-2011
co-and-architecture
addressing-modes
easy
+
–
0
votes
10
TIFR CSE 2019 | Part A | Question: 5
Asha and Lata play a game in which Lata first thinks of a natural number between $1$ and $1000$. Asha must find out that number by asking Lata questions, but Lata can only reply by saying Yes or no . Assume that Lata always tells the truth. What is ... she can always find out the number Lata has thought of? $10$ $32$ $100$ $999$ $\text{None of the above}$
Asha and Lata play a game in which Lata first thinks of a natural number between $1$ and $1000$. Asha must find out that number by asking Lata questions, but Lata can onl...
4.4k
views
answered
Jul 6, 2020
Algorithms
tifr2019
algorithm-design
binary-search
+
–
0
votes
11
TIFR CSE 2017 | Part A | Question: 2
For vectors $x, \: y$ in $\mathbb{R}^n$, define the inner product $\langle x, y \rangle = \Sigma^n_{i=1} x_iy_i$, and the length of $x$ to be $\| x \| = \sqrt{\langle x, x \rangle}$. Let $a, \: b$ ... $a, \: b$? Choose from the following options. ii only i and ii iii only iv only iv and v
For vectors $x, \: y$ in $\mathbb{R}^n$, define the inner product $\langle x, y \rangle = \Sigma^n_{i=1} x_iy_i$, and the length of $x$ to be $\| x \| = \sqrt{\langle x, ...
1.6k
views
answered
Jul 4, 2020
Linear Algebra
tifr2017
linear-algebra
vector-space
+
–
0
votes
12
GATE CSE 1997 | Question: 4.2
Let $A=(a_{ij})$ be an $n$-rowed square matrix and $I_{12}$ be the matrix obtained by interchanging the first and second rows of the $n$-rowed Identity matrix. Then $AI_{12}$ is such that its first Row is the same as its second row Row is the same as the second row of $A$ Column is the same as the second column of $A$ Row is all zero
Let $A=(a_{ij})$ be an $n$-rowed square matrix and $I_{12}$ be the matrix obtained by interchanging the first and second rows of the $n$-rowed Identity matrix. Then $AI_{...
4.9k
views
answered
Jul 2, 2020
Linear Algebra
gate1997
linear-algebra
easy
matrix
+
–
2
votes
13
GATE CSE 1990 | Question: 3-i
Choose the correct alternatives (More than one may be correct). Two NAND gates having open collector outputs are tied together as shown in below figure. The logic function $Y,$ implemented by the circuit is, $Y=ABC + DE$ $Y=\overline{ABC + DE}$ $Y=ABC.DE$ $Y=\overline{ABC.DE}$
Choose the correct alternatives (More than one may be correct).Two NAND gates having open collector outputs are tied together as shown in below figure.The logic function ...
7.4k
views
answered
Jun 16, 2020
Digital Logic
gate1990
normal
digital-logic
circuit-output
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
