Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gate-2006
0
votes
1
answer
1
2006 GATE(2006)
On a wireless link,the probability of packet error is 0.2.A stop-and-wait protocol is used to transfer data across the link. The channel condition is assumed to be independent from transmission to transmission.What is the average number of transmission attempts required to transfer 100 packets?
On a wireless link,the probability of packet error is 0.2.A stop-and-wait protocol is used to transfer data across the link. The channel condition is assumed to be indepe...
abhi19961
380
views
abhi19961
asked
Sep 13, 2018
Computer Networks
gate-2006
computer-networks
usergate
+
–
1
votes
0
answers
2
GATE-CS-2006
Station A uses 32 byte packets to transmit messages to Station B using a sliding window protocol. The round trip delay between A and B is 80 milliseconds and the bottleneck bandwidth on the path between A and B is 128 kbps. What is the optimal window size that A should ... of packets Then optimal Window size is 40 If the RTT=2*Tp then we get Ws = 41, what is the correct approach ?
Station A uses 32 byte packets to transmit messages to Station B using a sliding window protocol. The round trip delay between A and B is 80 milliseconds and the bottlene...
Salazar
1.1k
views
Salazar
asked
Nov 22, 2017
Computer Networks
gate-2006
computer-networks
sliding-window
+
–
0
votes
0
answers
3
User GATE 2006
Let L1={0n+m1n0m∣n,m≥0}L1={0n+m1n0m∣n,m≥0}, L2={0^n+m 1^n+m 0^m∣n,m≥0}L2={0^n+m 1^n+m 0^m∣n,m≥0} and L3={0^n+m 1^n+m 0^n+m∣n,m≥0}L3={0^n+m 1^n+m 0^n+m∣n,m≥0}. Which of these languages are NOT context free? L1 only L3 only L1 and L2 L2 and L3 THE ABOVE LANGUAGE HAS EPLSILON SO ITS NOT RECOGONIZED BY ANY TURING MACHINE HENCE IS IT NOT RECURSIVELY ENUMERABLE??
LetL1={0n+m1n0m∣n,m≥0}L1={0n+m1n0m∣n,m≥0},L2={0^n+m 1^n+m 0^m∣n,m≥0}L2={0^n+m 1^n+m 0^m∣n,m≥0} andL3={0^n+m 1^n+m 0^n+m∣n,m≥0}L3={0^n+m 1^n+m 0^n+m∣...
Venkat Sai
250
views
Venkat Sai
asked
Oct 3, 2017
Theory of Computation
gate-2006
theory-of-computation
+
–
2
votes
0
answers
4
Gate-2006 cs paper
Consider these two functions and two statements S1 and S2 about them. int work1(int *a, int i, int j) { int x = a[i+2]; a[j] = x+1; return a[i+2] - 3; } int work2(int *a, int i, int j) { int t1 = i+2; int t2 = a[t1]; a[j] = t2+1; return t2 - 3 ... to work1. (A) S1 is false and S2 is false (B) S1 is false and S2 is true (C) S1 is true and S2 is false (D) S1 is true and S2 is true
Consider these two functions and two statements S1 and S2 about them.int work1(int *a, int i, int j){ int x = a[i+2]; a[j] = x+1; return a[i+2] – 3;}int work2(...
PRASHANT YADAV
964
views
PRASHANT YADAV
asked
Aug 16, 2017
Algorithms
gate-2006
algorithms
normal
+
–
3
votes
1
answer
5
Gate 2006 Questions
Are Gate 2006 questions really tough? I'm hardly able to solve few questions. How should I approach such questions.
Are Gate 2006 questions really tough?I'm hardly able to solve few questions.How should I approach such questions.
target2017
951
views
target2017
asked
Dec 12, 2016
Others
difficult
gate-2006
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register