The pushdown automation M = ( {q0, q1, q2}',{a, b}, {0, 1}, δ, q0,0, {q0}) with
δ (q0, a, 0) = {(q1,10)}
δ (q1,a, 1) = {(q1,11)}
δ (q1,b, 1) = {(q2 , λ)}
δ(q2 , b, 1) = {(q2 , λ)}
δ (q2 , A, 0) = {(q0, λ)}
Accepts the language
| A. | L= {anbml n,m >=0} |
| B. | L= {anbnl n >=0} |
| C. | L= {anbml n,m >0} |
| D. | L= {anbnl n >0} |
|
Option: A Explanation : Click on Discuss to view users comments. |
Given two languages:
L1= {(ab)n,ak I n> k, k >=0}
L2 = {an bm l n ≠ m}
Using pumping lemma for regular language, it can be shown that
| A. | L1 is regular and L2 is not regular. |
| B. | L1 is not regular and L2 is regular. |
| C. | L1 is regular and L2 is regular. |
| D. | L1 is not regular and L2 is not regular. |
|
Option: A Explanation : Click on Discuss to view users comments. |
Regular expression for the complement of language L = {an bm I n ≥ 4, m ≤ 3} is
| A. | (a + b)* ba(a + b)* |
| B. | a* bbbbb* |
| C. | (λ + a + aa + aaa)b* + (a + b)* ba(a + b)* |
| D. | None of the above |
|
Option: D Explanation : Click on Discuss to view users comments. |
| A. | n(n + 1) |
| B. | n(n - 1) |
| C. | n(n + 1) /2 |
| D. | n(n - 1)/2 |
|
Option: C Explanation : Click on Discuss to view users comments. ESWAR said: (4:45pm on Monday 11th May 2015)
The number of physical links needed in a fully connected mesh network with nnodes are, n(n - 1). However, if each physical link allows communication in both directions (duplex mode), we can divide the number of links by 2. In other words, we can say that in a mesh topology, we need n(n -1) /2 duplex-mode links. so the answer is D.
|
| A. | 300 |
| B. | 320 |
| C. | 360 |
| D. | 400 |
|
Option: B Explanation : In asynchronous mode total no of bits are 7+1+2=10 so answer is 3200/10=320 Click on Discuss to view users comments. |
