Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Rahul_Rathod_
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Rahul_Rathod_
0
votes
1
Recursive language and non recursive enumerable language : Doubt
I have following doubt 1. FA , CFG and CSG are recursive 2. Type 0 language is recursive enumerable 3. Recursive means if let L is language and w is a string , if we put a string into Turing machine so it will accept if it is ... it will accept if it is belong to it and go to loop if it not belong to it . Are these things right ?
I have following doubt 1. FA , CFG and CSG are recursive 2. Type 0 language is recursive enumerable3. Recursive means if let L is language and w is a string , if we put a...
1.9k
views
answered
Jul 30, 2018
Theory of Computation
theory-of-computation
+
–
1
votes
2
MadeEasy Test Series 2018: Computer Networks - Stop And Wait
Consider that the stop and wait protocol is used on a link with bit rate of 128 Kbps and 40 msec as round trip time. Assume that the transmission time for the acknowledgment and processing time at nodes are negligible. If the frame size is 512 B then the link utilization is ________. (In % upto 2 decimal places)
Consider that the stop and wait protocol is used on a link with bit rate of 128 Kbps and 40 msec as round trip time. Assume that the transmission time for the acknowledgm...
2.0k
views
answered
Jan 20, 2018
Computer Networks
computer-networks
stop-and-wait
madeeasy-testseries-2018
made-easy-test-series
+
–
0
votes
3
ACE TEST
exact ans of this question is 3.20% or 3.10 % can i solve using this 1/1+2a??
exact ans of this question is 3.20% or 3.10 %can i solve using this 1/1+2a??
279
views
answered
Jan 1, 2018
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register