1
Consider the system, each consisting of $m$ linear equations in $n$ variables. If $m < n$, then all such systems have a solution. If $m > n$, then none of these systems has a solution. If $m = n$, then there exists a system which has a solution. Which one of the following is CORRECT? $I, II$ and $III$ are true. Only $II$ and $III$ are true. Only $III$ is true. None of them is true.
2
Question:
1 vote
3
Check whether this grammar is LL(1) or not?
1 vote
4
How many 4*1 mux required to implement 8*1 Mux ?
5
Let $W(n)$ and $A(n)$ denote respectively, the worst case and average case running time of an algorithm executed on an input of size $n$. Which of the following is ALWAYS TRUE? $A(n) = \Omega (W(n))$ $A(n) = \Theta (W(n))$ $A(n) = \text{O} (W(n))$ $A(n) = \text{o} (W(n))$
1 vote
6
Define languages $L_0$ and $L_1$ as follows : $L_0 = \{\langle M, w, 0 \rangle \mid M \text{ halts on }w\}$ $L_1 = \{\langle M, w, 1 \rangle \mid M \text{ does not halts on }w\}$ Here $\langle M, w, i \rangle$ is a triplet, whose first component $M$ ... but $L'$ is not $L'$ is recursively enumerable, but $L$ is not Both $L$ and $L'$ are recursive Neither $L$ nor $L'$ is recursively enumerable
The maximum window size for data transmission using the selective reject protocol with $n\text{-bit}$ frame sequence numbers is: $2^n$ $2^{n-1}$ $2^n-1$ $2^{n-2}$
A bit-stuffing based framing protocol uses an $\text{8-bit}$ delimiter pattern of $01111110.$ If the output bit-string after stuffing is $01111100101,$ then the input bit-string is: $0111110100$ $0111110101$ $0111111101$ $0111111111$