8.8k
views
14 votes
Which of the following regular expressions describes the language over$\{0, 1\}$ consisting of strings that contain exactly two $1$'s?$(0 + 1)^ * \ 11(0 + 1) ^*$0 ^* \ 110 ^*$0 ^* 10 ^* 10 ^*$(0 + 1) ^* 1(0 + 1) ^* 1 (0 + 1) ^*$
15.0k
views
0 votes
Which of the following regular expression identities is/are TRUE?$r^{(^\ast)} =r^\ast$(r^\ast s^\ast)=(r+s)^\ast$(r+s)^\ast = r^\ast + s^\ast$r^\ast s^\ast = r^\ast+s^\ast$
947
views
3 votes
How to find that wether the perticular given grammar is CSL or not... what is the basic method used for that... like any language given and it is asked ... ... how to check for CSL?? please provide proper explaination and example for that.
3.8k
views
1 votes
In class C , if subnet mask is 255.255.255.224 then calculates number of subnet?
27.4k
views
13 votes
A sender uses the Stop-and-Wait $\text{ARQ}$ protocol for reliable transmission of frames. Frames are of size $1000$ bytes and the transmission ... milliseconds.Assuming no frame is lost, the sender throughput is ________ bytes/ second.