search
Log In

Answers by Praveen Saini

19 votes
1
A sequential circuit takes an input stream of 0's and 1's and produces an output stream of 0's and 1's. Initially it replicates the input on its output until two consecutive 0's are encountered on the input. From then onward, it produces an output stream, which is ... to be used to design the circuit. Give the minimized sum-of-product expression for J and K inputs of one of its state flip-flops
answered Jun 29, 2018 in Digital Logic 951 views
11 votes
2
The grammar $S\rightarrow AC\mid CB$ $C\rightarrow aCb\mid \epsilon$ $A\rightarrow aA\mid a$ $B\rightarrow Bb\mid b$ generates the language $ L=\left \{ a^{i}b^{j}\mid i\neq j \right \}$. In this grammar what is the length of the derivation (number of steps starting from $S$) to generate the string $a^{l}b^{m}$ with $l\neq m$ $\max (l,m) + 2$ $l + m + 2$ $l + m + 3$ $\max (l,m) + 3$
answered Jun 24, 2018 in Compiler Design 1.7k views
67 votes
3
Given a language $L$, define $L^i$ as follows:$L^0 = \{ \varepsilon \}$$L^i = L^{i-1} \bullet L \text{ for all } I >0$The order of a language $L$ is defined as the smallest $k$ such that $L^k = L^{k+1}$. Consider the language $L_1$ (over alphabet O) accepted by the following automaton. The order of $L_1$ is ____
answered Feb 14, 2018 in Theory of Computation 7.8k views
3 votes
4
For even no a's RE over {a,b} 1) (b*ab*ab*)* + b* 2) (b*ab*ab*)*.b* 3) both are equal? which one is correct?
answered Aug 14, 2017 in Theory of Computation 361 views
5 votes
5
Consider the following Grammar S -> Ax/By A->By/Cw B->x/Bw which of the regular expression describe the same set of strings as the grammar? The option are: (a) xw* y + xw* yx +ywx (b) xwy + xw* xy +ywx (c) xw* y + xw X yx +ywx (d) xw xy + xww* y +ywx
answered May 7, 2017 in Theory of Computation 729 views
2 votes
6
How to convert Regular Grammar to Deterministic Finite Automata directly?
answered Apr 28, 2017 in Theory of Computation 248 views
4 votes
7
The regular expression corresponding to the finite automata given below is (ab*(a+b)+ϵ)* (ϵ+a(a+b)b*a)* ((ϵ+(a+b)ab*)a)* (ab*(a+b)a+a)*(ab*(a+b)+ε)
answered Dec 2, 2016 in Theory of Computation 631 views
4 votes
8
I have little confusion about r's complement. See the following examples: eg1) calculate F's compl. of (2BFD) is? Solution : here we are calculating as FFFF - 2BFD= D402. eg 2) Given that (E0B)16−(ABF)16=Y. The radix 8's compliment of Y is ? Solution: (EOB)16 - (ABF)16 =(34C) ... a) r's complement - N(as mentioned in example 1 ) (b) when we use (r-1)'s compl + 1 (as mentioned in above example 2 )?
answered Aug 31, 2016 in Digital Logic 860 views
4 votes
9
Let L be a regular language Is the language L2={y: there exist x and z such that |x|=|z| and xyz belons to L} regular?
answered Aug 9, 2016 in Theory of Computation 234 views
5 votes
10
The regular grammar for the language L= { $w\mid n_{a}$(w) and $n_{b} (w)$ are both even, $w \in \left\{a, b\right\}$ * } is given by : (Assume, $p, q, r$ and $s$ ... states. $p \rightarrow aq \mid br , q \rightarrow bs \mid ap r \rightarrow as \mid bp, s \rightarrow ar \mid bq$ $p$ is both initial and final states.
answered Jun 24, 2016 in Theory of Computation 1.1k views
9 votes
11
Which of the following features cannot be captured by CFG Syntax of if then else statements Syntax of recursive procedures Whether a variable is declared before its use Matching nested parenthesis
answered Jun 21, 2016 in Compiler Design 1.9k views
3 votes
12
6 votes
13
5 votes
14
Over the alphabet $\{0, 1\}$, consider the language $L = \{ w | \: w \text{ does not contain the substring } 0011\}$ Which of the following is true about $L$. $L$ is not context free $L$ is regular $L$ is not regular but it is context free $L$ is context free but not recursively enumerable
answered May 19, 2016 in Theory of Computation 505 views
5 votes
15
what is CYK algo and use the CYK algo to determine whether the strings aabb,aabba,abbbb are in the language generated by following grammar S->AB A->BB|a B->AB|b
answered May 17, 2016 in Theory of Computation 1k views
2 votes
16
a full 3-ary tre with 100 vertices have a)57 leaves b) 67 leaves c)77 leaves d) 87 leaves
answered May 10, 2016 in Programming 221 views
7 votes
17
let L1=L(a*baa*) and L2=(aba*) . find L1/L2
answered May 9, 2016 in Theory of Computation 894 views
12 votes
18
Let $G_1 = (N, T, P, S_1)$ be a CFG where, $N=\{S_1, A, B\},T=\{a, b\}$ and $P$ ... $5$ production rules. Is $L_2$ inherently ambiguous?
answered May 4, 2016 in Compiler Design 1.2k views
0 votes
19
Is there any method to find the prime implicants without using the tabular method (Quine-McCluskey method) . As an example the prime implicant for the function F(w,x,y,z) = Σ( 1, 4,6,7,8,9,10,11,15 ) are 6 in numbers i.e. x'y'z , w'xz' , w'xy , ... implicant of the given function 4 or 6 .... If it is 6 then Is there any method other than Tabular method to find prime implicants of the function...
answered May 4, 2016 in Digital Logic 344 views
14 votes
20
In the given figure angle $Q$ is a right angle, $PS:QS = 3:1, RT:QT = 5:2$ and $PU:UR = 1:1. $ If area of triangle $QTS$ is $20cm^{2},$ then the area of triangle $PQR$ in $cm^{2}$ is ______
answered May 2, 2016 in Numerical Ability 1.3k views
14 votes
21
In a three stage counter, using $RS$ flip flops what will be the value of the counter after giving $9$ pulses to its input ? Assume that the value of counter before giving any pulses is $1$ : $1$ $2$ $9$ $10$
answered Apr 27, 2016 in Digital Logic 3.1k views
11 votes
22
Which of the following number of nodes can form a full binary tree? 8 15 14 13
answered Apr 27, 2016 in DS 2.7k views
14 votes
23
The most simplified form of the Boolean function $x (A, B, C, D) = \sum (7, 8, 9, 10, 11, 12, 13, 14, 15)$ (expressed in sum of minterms) is? A + A'BCD AB + CD A + BCD ABC + D
answered Apr 27, 2016 in Digital Logic 2.3k views
...