Log In

Answers by Manis

5 votes
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.
answered Jan 24, 2018 in Linear Algebra 5.5k views
0 votes
answered Jan 6, 2018 in Programming 121 views
1 vote
Check whether this grammar is LL(1) or not?
answered Jan 5, 2018 in Compiler Design 207 views
1 vote
How many 4*1 mux required to implement 8*1 Mux ?
answered Dec 7, 2017 in Digital Logic 483 views
12 votes
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))$
answered Nov 27, 2017 in Algorithms 4.8k views
1 vote
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
answered Nov 14, 2017 in Theory of Computation 8.9k views
5 votes
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}$
answered Nov 5, 2017 in Computer Networks 7.3k views
–1 vote
Which of the following objects can be used in expressions and scriplets in JSP (Java Server Pages) without explicitly declaring them? session and request only request and response only response and session only session, request and response
answered Nov 4, 2017 in Web Technologies 952 views
15 votes
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$
answered Nov 2, 2017 in Computer Networks 7.4k views