Recent posts tagged interview

1
Accept a language $L$ also means shouldn't accept anything not in $L$. Actually non recursively enumerable languages are not accepted by turing machineHere, 'recognized'...
2
where is the dead state ??
5
N bit sequence detector need atleast N state to accept N bit sequence .....http://www.edwardbosworth.com/My5155_Slides/Chapter07/DesignOfSequenceDetector.pdf
9
Out of syllabus now
11
The answer for this question is A . Only one circuit is required (only a not gate ) .
12
NO error but it is illegal initialization
13
Yes. And it should mean the 1st one. That's the beauty of English grammar :P
14
starting with 001100110011 means alternative sequence of process P and Q..Process P should start execution so at W, P(s) where S=1..to get alternate sequence X and Y are...
15
The no of vertices in a graph containing 21 edges, 3 vertices of degree 4 and other vertices of degree 3 are:a) 10b) 13c) 11d) NoneSum of degrees of vertices= 2*no of edg...
17
There is no limit on a large value being considered. f(n)= n^0.0000001 = n^(10^-7)g(n)=lg n(base 2)n= 10^8 f(n)= 1.000001842 , g(n)=26.565Now, I take n = 10^(10^8)f(n) ...
18
Instead of finding a function 'f' for the first MUX (in terms of z,x and y) and the second MUX (in terms of f , x and y), we can logically find out the answer.We can put ...
20
If $x$ is real and $\mid x^2-2x+3 \mid = 11$, then possible values of $\mid -x^3+x^2-x\mid$ include$2, 4$$2, 14$$4, 52$$14, 52$
To see more, click for the full list of questions or popular tags.