1 answer
2
Set of all strings over {0,1} containing at most one pair of consecutive 1's.Give regular expression and equivalent minimized DFA.
5 answers
4
Consider the following program fragment if(a b) if(b c) s1; else s2;s2 will be executed ifa <= bb cb >= c and a <= ba b and b <= c
2 answers
8
If the packet size is 1KB and propagation time is 15ms, the channel capacity is $10^9$ b/s then find the transmission time and utilization of sender in stop and wait prot...