1 answer
1
Construct a DFA to accept all strings (1+0)^ with an equal no of zeros and 1's ,such that each prefix has atmost one more zero then 1's and at most one more 1's then zero...
0 answers
3
Let $x=(x_1, x_2, \dots x_n) \in \{0,1\}^n$ By $H(x)$ we mean the number of 1's in $(x_1, x_2, \dots x_n)$. Prove that $H(x) = \frac{1}{2} (n-\Sigma^n_{i=1} (-1)^{x_i})$....
2 answers
11
void main() { typedef struct a aType; aType someVariable; struct a { int x; aType *b; }; }
2 answers
12
2 answers
13
what is meant by process in zombie state???what are the cases that the process can be in zombie state
2 answers
17
in what protocol or protocols, it is possible for the sender to receive an ack for a packet that falls outside of its current window a. stop and wait b. select...
2 answers
18
1 answer
19
2 answers
21
S: T1(A)R2(B)W2(B)R2(A)W2(B)W1(A)R3(B)W3(B) Given schedule is view serializable ?
2 answers
24
I believe since the variable 't' is a free variable, so option three should also be right. Second option is also correct?
1 answer
26