Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
No answer
No selected answer
No upvoted answer
Previous GATE
Featured
Recent questions without answers
0
votes
0
answers
4441
Gate counseling
My gate 2019 rank is 2966, score 563, marks 48.67 which colleges I can get with this rank? I belong to unreserved category. Graduation marks 68%.
My gate 2019 rank is 2966, score 563, marks 48.67 which colleges I can get with this rank? I belong to unreserved category. Graduation marks 68%.
Psnjit
537
views
Psnjit
asked
Apr 10, 2019
0
votes
0
answers
4442
Peter Linz Edition 4 Exercise 4.2 Question 15 (Page No. 114)
Describe an algorithm which, when given a regular grammar $G$, can tell us whether or not $L (G) = Σ^*$.
Describe an algorithm which, when given a regular grammar $G$, can tell us whether or not $L (G) = Σ^*$.
Naveen Kumar 3
147
views
Naveen Kumar 3
asked
Apr 10, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
+
–
0
votes
0
answers
4443
Peter Linz Edition 4 Exercise 4.2 Question 13 (Page No. 114)
Show that there exists an algorithm that can determine for every regular language $L$, whether or not $|L| ≥ 5$.
Show that there exists an algorithm that can determine for every regular language $L$, whether or not $|L| ≥ 5$.
Naveen Kumar 3
127
views
Naveen Kumar 3
asked
Apr 10, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
+
–
0
votes
0
answers
4444
Peter Linz Edition 4 Exercise 4.2 Question 12 (Page No. 113)
Let $L$ be any regular language on $Σ =$ {$a, b$}. Show that an algorithm exists for determining if $L$ contains any strings of even length.
Let $L$ be any regular language on $Σ =$ {$a, b$}. Show that an algorithm exists for determining if $L$ contains any strings of even length.
Naveen Kumar 3
182
views
Naveen Kumar 3
asked
Apr 10, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
+
–
0
votes
0
answers
4445
Peter Linz Edition 4 Exercise 4.2 Question 11 (Page No. 113)
The operation $tail (L)$ is defined as $tail(L)=$ {$v:uv∈L,u,v∈Σ^*$}. Show that there is an algorithm for determining whether or not $L = tail (L)$ for any regular $L$.
The operation $tail (L)$ is defined as $tail(L)=$ {$v:uv∈L,u,v∈Σ^*$}.Show that there is an algorithm for determining whether or not $L = tail (L)$ for any regular $L...
Naveen Kumar 3
132
views
Naveen Kumar 3
asked
Apr 10, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
+
–
0
votes
0
answers
4446
Peter Linz Edition 4 Exercise 4.2 Question 10 (Page No. 113)
Show that there is an algorithm to determine if $L = shuffle (L, L)$ for any regular $L$.
Show that there is an algorithm to determine if $L = shuffle (L, L)$ for any regular $L$.
Naveen Kumar 3
179
views
Naveen Kumar 3
asked
Apr 10, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
+
–
0
votes
0
answers
4447
Peter Linz Edition 4 Exercise 4.2 Question 9 (Page No. 113)
Let $L$ be a regular language on $Σ$ and $\widehat{w}$ be any string in $Σ^*$. Find an algorithm to determine if $L$ contains any $w$ such that $\widehat{w}$ is a substring of it, that is, such that $w = u\widehat{w} υ$ with $u,υ ∈Σ^*$ .
Let $L$ be a regular language on $Σ$ and $\widehat{w}$ be any string in $Σ^*$. Find an algorithm to determine if $L$ contains any $w$ such that $\widehat{w}$ is a subst...
Naveen Kumar 3
151
views
Naveen Kumar 3
asked
Apr 10, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
+
–
0
votes
0
answers
4448
Peter Linz Edition 4 Exercise 4.2 Question 8 (Page No. 113)
Exhibit an algorithm that, given any regular language $L$, determines whether or not $L =L^*$.
Exhibit an algorithm that, given any regular language $L$, determines whether or not $L =L^*$.
Naveen Kumar 3
163
views
Naveen Kumar 3
asked
Apr 10, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
+
–
0
votes
0
answers
4449
Peter Linz Edition 4 Exercise 4.2 Question 7 (Page No. 113)
Exhibit an algorithm that, given any three regular languages, $L, L_1, L_2,$ determines whether or not $L = L_1 L_ 2$.
Exhibit an algorithm that, given any three regular languages, $L, L_1, L_2,$ determines whether or not $L = L_1 L_ 2$.
Naveen Kumar 3
113
views
Naveen Kumar 3
asked
Apr 10, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
+
–
0
votes
0
answers
4450
Peter Linz Edition 4 Exercise 4.2 Question 6 (Page No. 113)
Exhibit an algorithm for determining whether or not a regular language $L$ contains any string $w$ such that $w^ R ∈ L$.
Exhibit an algorithm for determining whether or not a regular language $L$ contains any string $w$ such that $w^ R ∈ L$.
Naveen Kumar 3
131
views
Naveen Kumar 3
asked
Apr 10, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
+
–
0
votes
0
answers
4451
Peter Linz Edition 4 Exercise 4.2 Question 4 (Page No. 113)
Show that for any regular $L_1$ and $L_2$ there is an algorithm to determine whether or not $L_1 = L_1/L_2$.
Show that for any regular $L_1$ and $L_2$ there is an algorithm to determine whether or not $L_1 = L_1/L_2$.
Naveen Kumar 3
123
views
Naveen Kumar 3
asked
Apr 10, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
+
–
0
votes
0
answers
4452
Peter Linz Edition 4 Exercise 4.2 Question 3 (Page No. 113)
Show that there exists an algorithm for determining if $λ ∈ L$, for any regular language $L$.
Show that there exists an algorithm for determining if $λ ∈ L$, for any regular language $L$.
Naveen Kumar 3
137
views
Naveen Kumar 3
asked
Apr 10, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
+
–
0
votes
0
answers
4453
Peter Linz Edition 4 Exercise 4.2 Question 2 (Page No. 113)
Show that there exists an algorithm for determining if $L_1 ⊆ L_2$, for any regular languages $L_1$ and $L_2$.
Show that there exists an algorithm for determining if $L_1 ⊆ L_2$, for any regular languages $L_1$ and $L_2$.
Naveen Kumar 3
167
views
Naveen Kumar 3
asked
Apr 10, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
+
–
0
votes
0
answers
4454
Peter Linz Edition 4 Exercise 4.2 Question 1 (Page No. 113)
Show that there exists an algorithm to determine whether or not $w ∈ L_1 − L_2$, for any given $w$ and any regular languages $L_1$ and $L_2$.
Show that there exists an algorithm to determine whether or not $w ∈ L_1 − L_2$, for any given $w$ andany regular languages $L_1$ and $L_2$.
Naveen Kumar 3
260
views
Naveen Kumar 3
asked
Apr 10, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
regular-language
+
–
0
votes
0
answers
4455
Kurose and Ross Edition 6 Exercise 2 Question R17 (Page No 170)
Print out the header of an e-mail message you have recently received. How many $Received:$ header lines are there? Analyze each of the header lines in the message.
Print out the header of an e-mail message you have recently received. Howmany $Received:$ header lines are there? Analyze each of the header linesin the message.
ajaysoni1924
335
views
ajaysoni1924
asked
Apr 10, 2019
Computer Networks
computer-networks
kurose-and-ross
application-layer-protocols
application-layer
descriptive
+
–
0
votes
0
answers
4456
Ullman CD
"A CLR parser will not make even single reduction before announcing an error" Plz explain this line
"A CLR parser will not make even single reduction before announcing an error"Plz explain this line
Anuj kumar yadav
180
views
Anuj kumar yadav
asked
Apr 10, 2019
0
votes
0
answers
4457
Kurose and Ross Edition 6 Exercise 2 Question R15 (Page No 170)
Why is it said that FTP sends control information “out-of-band”?
Why is it said that FTP sends control information “out-of-band”?
ajaysoni1924
308
views
ajaysoni1924
asked
Apr 10, 2019
Computer Networks
computer-networks
kurose-and-ross
application-layer-protocols
descriptive
+
–
0
votes
0
answers
4458
Kurose and Ross Edition 6 Exercise 2 Question R13 (Page No 170)
Describe how Web caching can reduce the delay in receiving a requested object. Will Web caching reduce the delay for all objects requested by a user or for only some of the objects? Why?
Describe how Web caching can reduce the delay in receiving a requested object. Will Web caching reduce the delay for all objects requested by a user or for only some of t...
ajaysoni1924
592
views
ajaysoni1924
asked
Apr 10, 2019
Computer Networks
computer-networks
kurose-and-ross
application-layer-protocols
descriptive
+
–
0
votes
0
answers
4459
Kurose and Ross Edition 6 Exercise 2 Question R10 (Page No 169)
What is meant by a handshaking protocol?
What is meant by a handshaking protocol?
ajaysoni1924
229
views
ajaysoni1924
asked
Apr 10, 2019
Computer Networks
computer-networks
kurose-and-ross
application-layer
application-layer-protocols
descriptive
+
–
0
votes
0
answers
4460
Kurose and Ross Edition 6 Exercise 2 Question R4 (Page No 169)
For a P2P file-sharing application, do you agree with the statement, “There is no notion of client and server sides of a communication session”? Why or why not?
For a P2P file-sharing application, do you agree with the statement, “There is no notion of client and server sides of a communication session”? Why or why not?
ajaysoni1924
284
views
ajaysoni1924
asked
Apr 10, 2019
Computer Networks
computer-networks
kurose-and-ross
application-layer
application-layer-protocols
descriptive
+
–
0
votes
0
answers
4461
Kurose and Ross Edition 6 Exercise 2 Question R2 (Page No 169)
What is the difference between network architecture and application architecture?
What is the difference between network architecture and application architecture?
ajaysoni1924
195
views
ajaysoni1924
asked
Apr 10, 2019
Computer Networks
computer-networks
kurose-and-ross
application-layer
descriptive
+
–
0
votes
0
answers
4462
Kurose and Ross Edition 6 Exercise 2 Question R1 (Page No 169)
List five nonproprietary Internet applications and the application-layer protocols that they use.
List five nonproprietary Internet applications and the application-layer protocols that they use.
ajaysoni1924
373
views
ajaysoni1924
asked
Apr 10, 2019
Computer Networks
computer-networks
kurose-and-ross
application-layer
application-layer-protocols
descriptive
+
–
0
votes
0
answers
4463
Kurose and Ross Edition 6 Exercise 1 Question P26 (Page No 76)
Suppose two hosts, A and B, are separated by 20,000 kilometers and are connected by a direct link of R = 2 Mbps. Suppose the propagation speed over the link is 2.5×1082.5×108 meters/sec. suppose we can modify R. For what value of R is the width of a bit as long as the length of the link?
Suppose two hosts, A and B, are separated by 20,000 kilometers and are connected by a direct link of R = 2 Mbps. Suppose the propagation speed over the link is 2.5×1082....
ajaysoni1924
384
views
ajaysoni1924
asked
Apr 10, 2019
Computer Networks
computer-networks
kurose-and-ross
network-layer
network-flow
+
–
0
votes
0
answers
4464
Kurose and Ross Edition 6 Exercise 1 Question P29 (Page No 76)
Suppose there is a 10 Mbps microwave link between a geostationary satellite and its base station on Earth. Every minute the satellite takes a digital photo and sends it to the base station. Assume a propagation speed of ... the size of the photo. What is the minimum value of x for the microwave link to be continuously transmitting?
Suppose there is a 10 Mbps microwave link between a geostationary satellite and its base station on Earth. Every minute the satellite takes a digital photo and sends it t...
ajaysoni1924
1.6k
views
ajaysoni1924
asked
Apr 10, 2019
Computer Networks
computer-networks
kurose-and-ross
data-link-layer
network-flow
+
–
0
votes
0
answers
4465
Kurose and Ross Edition 6 Exercise 1 Question P25 (Page No 76)
.Suppose two hosts, A and B, are separated by 20,000 kilometers and are connected by a direct link of R = 2 Mbps. Suppose the propagation speed over the link is $2.5 \times 10^8$ meters/sec. Calculate the bandwidth-delay ... width of a bit in terms of the propagation speed s, the transmission rate R, and the length of the link m.
.Suppose two hosts, A and B, are separated by 20,000 kilometers and are connected by a direct link of R = 2 Mbps. Suppose the propagation speed over the link is $2.5 \tim...
ajaysoni1924
646
views
ajaysoni1924
asked
Apr 10, 2019
Computer Networks
computer-networks
kurose-and-ross
network-layer
network-flow
+
–
0
votes
0
answers
4466
Kurose and Ross Edition 6 Exercise 1 Question P13 (Page No 73)
Suppose N packets arrive simultaneously to a link at which no packets are currently being transmitted or queued. Each packet is of length L and the link has transmission rate R. What is the average queuing delay for the N packets? ... N such packets arrive to the link every LN/R seconds. What is the average queuing delay of a packet?
Suppose N packets arrive simultaneously to a link at which no packets are currently being transmitted or queued. Each packet is of length L and the link has transmission ...
ajaysoni1924
424
views
ajaysoni1924
asked
Apr 10, 2019
Computer Networks
computer-networks
kurose-and-ross
network-layer
network-flow
+
–
0
votes
0
answers
4467
Kurose and Ross Edition 6 Exercise 1 Question P9 (Page No 73)
In the discussion of packet switching versus circuit switching with a 1 Mbps link. Users are generating data at a rate of 100 kbps when busy, but are busy generating data only with probability p = 0.1. Suppose that the 1 Mbps link is ... . Give a formula (in terms of p, M, N) for the probability that more than N users are sending data.
In the discussion of packet switching versus circuit switching with a 1 Mbps link. Users are generating data at a rate of 100 kbps when busy, but are busy generating data...
ajaysoni1924
874
views
ajaysoni1924
asked
Apr 10, 2019
Computer Networks
computer-networks
kurose-and-ross
network-switching
+
–
0
votes
0
answers
4468
Kenneth Rosen Edition 7 Exercise 2.3 Question 53 (Page No. 154)
Prove that if $n$ is an integer, then $\left \lfloor n/2 \right \rfloor = n/2$ if $n$ is even and $(n-1)/2$ if $n$ is odd.
Prove that if $n$ is an integer, then $\left \lfloor n/2 \right \rfloor = n/2$ if $n$ is even and $(n-1)/2$ if $n$ is odd.
Pooja Khatri
180
views
Pooja Khatri
asked
Apr 9, 2019
Set Theory & Algebra
kenneth-rosen
discrete-mathematics
set-theory&algebra
+
–
0
votes
0
answers
4469
Kenneth Rosen Edition 7 Exercise 2.3 Question 52 (Page No. 154)
Show that if $x$ is a real number and $n$ is an integer, then $x\leq n$ if and only if $\left \lceil x \right \rceil \leq n$ $n\leq x$ if and only if $ n\leq \left \lfloor x \right \rfloor $
Show that if $x$ is a real number and $n$ is an integer, then$x\leq n$ if and only if $\left \lceil x \right \rceil \leq n$$n\leq x$ if and only if $ n\leq \left \lfloor ...
Pooja Khatri
190
views
Pooja Khatri
asked
Apr 9, 2019
Set Theory & Algebra
kenneth-rosen
discrete-mathematics
set-theory&algebra
+
–
0
votes
0
answers
4470
Kenneth Rosen Edition 7 Exercise 2.3 Question 51 (Page No. 154)
Show that if $x$ is a real number and $n$ is an integer, then $x<n$ if and only if $\left \lfloor x \right \rfloor < n$ $n<x$ if and only if $ n<=\left \lfloor x \right \rfloor $
Show that if $x$ is a real number and $n$ is an integer, then$x<n$ if and only if $\left \lfloor x \right \rfloor < n$$n<x$ if and only if $ n<=\left \lfloor x \right \rf...
Pooja Khatri
227
views
Pooja Khatri
asked
Apr 9, 2019
Mathematical Logic
kenneth-rosen
discrete-mathematics
set-theory&algebra
+
–
Page:
« prev
1
...
144
145
146
147
148
149
150
151
152
153
154
...
592
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register