Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
shreshtha5
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by shreshtha5
7
answers
1
GATE CSE 2003 | Question: 84
Host $A$ is sending data to host $B$ over a full duplex link. $A$ and $B$ are using the sliding window protocol for flow control. The send and receive window sizes are $5$ packets each. Data packets (sent only from $A$ to $B$) are all $1000$ bytes long and the ... ? $7.69 \times 10^6$ Bps $11.11 \times 10^6$ Bps $12.33 \times 10^6$ Bps $15.00 \times 10^6$ Bps
Host $A$ is sending data to host $B$ over a full duplex link. $A$ and $B$ are using the sliding window protocol for flow control. The send and receive window sizes are $5...
27.7k
views
commented
Aug 1, 2016
Computer Networks
gatecse-2003
computer-networks
sliding-window
normal
+
–
2
answers
2
sql query
342
views
commented
Jan 26, 2016
Databases
sql
+
–
0
answers
3
hit ratio
a byte addressable computer has a small data cache capable of holding eight 32 bit words.Each cache block consists of two 32 bit words.For the following sequence of addresses( in hex), the hit ratio if the two way set associative LRU cache is used is.... 200,204,208, 20C,2F4,2F0,2F4,2F0,21C,218,21C
a byte addressable computer has a small data cache capable of holding eight 32 bit words.Each cache block consists of two 32 bit words.For the following sequence of addre...
371
views
asked
Jan 20, 2016
1
answer
4
cache miss
715
views
asked
Jan 20, 2016
0
answers
5
cache miss
137
views
asked
Jan 20, 2016
1
answer
6
p&c
six balls have to be placed in the squares such that each row has atleast one ball . no of ways of doing this is-
six balls have to be placed in the squares such that each row has atleast one ball . no of ways of doing this is-
631
views
commented
Dec 29, 2015
Combinatory
combinatory
+
–
1
answer
7
TCP
let the size of the congestion window of a TCP connection be 32KB.When time out occurs the maximum segment size used is 2KB.If the time taken by the TCP connection to get 32 KB congestion window size is 480 ms than the RTT is??
let the size of the congestion window of a TCP connection be 32KB.When time out occurs the maximum segment size used is 2KB.If the time taken by the TCP connection to get...
606
views
commented
Dec 9, 2015
2
answers
8
window size
the round trip delay between sender and receiver is 160ms and the bottleneck bandwidth of the link is 256 kbps.Sender uses sliding window protocol to send a 64 byte packet.The optimal size of the window that sender should use is ?
the round trip delay between sender and receiver is 160ms and the bottleneck bandwidth of the link is 256 kbps.Sender uses sliding window protocol to send a 64 byte packe...
806
views
asked
Dec 8, 2015
1
answer
9
regular
226
views
asked
Dec 6, 2015
3
answers
10
Virtual Gate Test Series: Theory Of Computation - Languages
Consider the following context-sensitive productions $\\S\rightarrow bSb\, |\, AcA \\Ab\rightarrow A,\, Ab\rightarrow b \\bA\rightarrow b,\, bA\rightarrow A$ Let $G$ be grammar given by all the rules except the last, and let $G'$ be the ... is regular Both $L(G)$ and $L(G')$ are regular None of $L(G)$ and $L(G')$ are regular
Consider the following context-sensitive productions$\\S\rightarrow bSb\, |\, AcA \\Ab\rightarrow A,\, Ab\rightarrow b \\bA\rightarrow b,\, bA\rightarrow A$Let $G$ be gra...
650
views
commented
Dec 6, 2015
Theory of Computation
theory-of-computation
identify-class-language
virtual-gate-test-series
+
–
2
answers
11
Regular/Non-regular Language
Given a set $A\subseteq \left\{0,1 \right \}^*,$ let $A' = \left\{ xy\; |\;x1y\in A\right\}.$ That is, $A'$ consistes of all the strings obtained from a string in $A$ by deleting in $A$ by deleting exactly one $1$. if $A$ is regular, then $A'$ is (A) Regular (B) Context free but not regular (C) Recursive but not context free (D) None of the above.
Given a set $A\subseteq \left\{0,1 \right \}^*,$ let$A' = \left\{ xy\; |\;x1y\in A\right\}.$ That is, $A'$ consistes of all the strings obtained from a string in $A$ by d...
709
views
answer selected
Dec 5, 2015
Theory of Computation
identify-class-language
regular-language
+
–
4
answers
12
VirtualGate Test Series: Theory Of Computation - Regular Languages
Consider the following subsets of $\left\{a, b, \$ \right\}^*$ $A=\left\{xy\, |\, x,y\in\left\{a,b\right\}^*,\#a(x)=\#b(y)\right\},$ $ ... are true? $A$ and $B$ both are regular $A$ is regular but $B$ is not $A$ is not regular but $B$ is regular Both are non-regular
Consider the following subsets of $\left\{a, b, \$ \right\}^*$$A=\left\{xy\, |\, x,y\in\left\{a,b\right\}^*,\#a(x)=\#b(y)\right\},$$B=\left\{x\$y\, |\, x,y\in\left\{a,b\r...
1.6k
views
answer selected
Dec 5, 2015
Theory of Computation
theory-of-computation
regular-language
virtual-gate-test-series
+
–
2
answers
13
pipeline
is 2ns?(in MIPS)
is 2ns?(in MIPS)
397
views
answer selected
Dec 5, 2015
0
answers
14
pipeline
suppose there is unpipelined processor with a cycle time of 30ns which is evenly divided into 5 pipeline stages.The total latch latency of the pipeline will be
suppose there is unpipelined processor with a cycle time of 30ns which is evenly divided into 5 pipeline stages.The total latch latency of the pipeline will be
217
views
asked
Dec 5, 2015
0
answers
15
clock cycle
the maximum clock frequency at which the data path can operate is ??
the maximum clock frequency at which the data path can operate is ??
260
views
asked
Dec 5, 2015
2
answers
16
asymtotic notations
Q). Consider the following functions $f_1 = n^{\frac{4}{3}}$ $f_2=2^{2^n}$ $f_3= 2^{n^2}$ $f_4= n!$ $f_5=2^n$ Which of the following is true? A). $f_1$ is $\Omega(f_2)$ B). $f_2$ is $O(f_3)$ C). $f_1<f_5<f_4<f_2<f_3$ D). $f_4$ is $O(f_3)$
Q). Consider the following functions$f_1 = n^{\frac{4}{3}}$$f_2=2^{2^n}$$f_3= 2^{n^2}$$f_4= n!$$f_5=2^n$Which of the following is true?A). $f_1$ is $\Omega(f_2)$B). $f_2$...
672
views
commented
Dec 5, 2015
Algorithms
algorithms
asymptotic-notation
+
–
1
answer
17
NP complete
Q). Which of the following can we infer from the fact that the travelling salesperson problem is $NP$-complete.if we assume that $P$ is not equal to $NP$ ? A). There does not exist an algorithm that solves arbitrary instances of $TSP$ problem. B). ... algorithm that efficiently solves arbitrary instances of the $TSP$ problem , but no one has been able to find it. D). None of these
Q). Which of the following can we infer from the fact that the travelling salesperson problem is $NP$-complete.if we assume that $P$ is not equal to $NP$ ?A). There does ...
787
views
asked
Dec 3, 2015
Algorithms
p-np-npc-nph
+
–
1
answer
18
multivalued dependency
find multivalued dependency in this table?
find multivalued dependency in this table?
1.3k
views
commented
Dec 3, 2015
2
answers
19
no of triples..
.WHAT IS TRIPLES????
.WHAT IS TRIPLES????
1.3k
views
commented
Dec 3, 2015
Databases
databases
+
–
1
answer
20
BST
certain file system stores records as per binary search tree principles.If the preorder traversal is 90,40,30,190,140,100,290.What is the expected number of comparisons when we randomly request one of the records?
certain file system stores records as per binary search tree principles.If the preorder traversal is 90,40,30,190,140,100,290.What is the expected number of comparisons w...
559
views
commented
Dec 1, 2015
DS
binary-search-tree
numerical-answers
+
–
2
answers
21
inverion pairs
assume that A be an array of 16 elements.What is the difference between maximum and minimum number of inversion pairs in worst case?
assume that A be an array of 16 elements.What is the difference between maximum and minimum number of inversion pairs in worst case?
481
views
commented
Nov 30, 2015
Algorithms
sorting
numerical-answers
+
–
1
answer
22
no. of gates
595
views
commented
Nov 30, 2015
1
answer
23
excess 3 codes
Convert $1101_2$ to corresponding $excess-3$ binary number. (A) $10000$ (B) $01000110$ (C) $100110$ (D) $10110$
Convert $1101_2$ to corresponding $excess-3$ binary number.(A) $10000$(B) $01000110$(C) $100110$(D) $10110$
4.4k
views
commented
Nov 30, 2015
Digital Logic
number-representation
binary-codes
+
–
1
answer
24
minimum number of gates
is
is
3.2k
views
commented
Nov 30, 2015
3
answers
25
dual of function
Dual of EX-OR is equal to (A) NAND (B) NOR (C) EX-NOR (D) None of these
Dual of EX-OR is equal to(A) NAND(B) NOR(C) EX-NOR(D) None of these
8.1k
views
commented
Nov 30, 2015
Digital Logic
dual-function
boolean-algebra
+
–
2
answers
26
counter
The initial state of a MOD 16 down counter is 0110 . After 37 clock pulses, the state of the counter will be 0001 1011 1101 1010
The initial state of a MOD 16 down counter is 0110 . After 37 clock pulses, the state of the counter will be0001101111011010
6.0k
views
commented
Nov 27, 2015
Digital Logic
digital-counter
+
–
2
answers
27
no. of prime implicants
what is the no. Of prime implicants in f(w,x,y,z)=∑ (1,4,6,7,8,9,10,11,15) ?
what is the no. Of prime implicants in f(w,x,y,z)=∑ (1,4,6,7,8,9,10,11,15) ?
2.8k
views
commented
Nov 27, 2015
3
answers
28
job scheduling
2.3k
views
answer selected
Nov 24, 2015
Algorithms
algorithms
greedy-algorithm
job-scheduling
numerical-answers
test-series
+
–
0
answers
29
fork
171
views
asked
Nov 15, 2015
4
answers
30
window size
582
views
asked
Oct 23, 2015
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register