Register
Filter

Recent activity by Gabbar

3 answers
1
lexical analysis
The number of tokens in the following expression is? + * * * < = & > { - + + + } ( >> ) + & &
The number of tokens in the following expression is?+ * * * < = & { - + + + } ( > ) + & &
5 answers
2
Operator Precedence
In Operator precedence parsing, precedence relations are defined, i. for all pair of non-terminals. ii. for all pair of terminals. iii. to delimit the handle. iv. only for certain pair of terminals.
In Operator precedence parsing, precedence relations are defined,i. for all pair of non-terminals.ii. for all pair of terminals.iii. to delimit the handle.iv. only for ce...
3 answers
4
ISRO2014-75
An organization is granted the block $130.34.12.64/26.$ It needs to have $4$ subnets. Which of the following is not an address of this organization? $130.34.12.124$ $130.34.12.89$ $130.34.12.70$ $130.34.12.132$
An organization is granted the block $130.34.12.64/26.$ It needs to have $4$ subnets. Which of the following is not an address of this organization?$130.34.12.124$$130.34...
3 answers
5
UPSC prelim test
A bag contains 20 balls. 8 balls are green, 7 are white and 5 are red. What is the minimum number of balls that must be picked up from the bag blind-folded (without replacing any of it) to be assured of picking atleast one ball of each colour? a) 15 b) 16 c) 17 d)18
A bag contains 20 balls. 8 balls are green, 7 are white and 5 are red. What is the minimum number of balls that must be picked up from the bag blind-folded (without repla...
2 answers
6
time complexity
what the time complexity for T(n)=5T(n/2)+n^2 a. n b.n^2
what the time complexity forT(n)=5T(n/2)+n^2a. nb.n^2
1 answer
7
recursion
0 answers
8
probability
a lot consists of 12 good pencils, 6 with minor defects and 2 with major defects. A pencil is chosen at random. The probability that this pencil is not defective is?
a lot consists of 12 good pencils, 6 with minor defects and 2 with major defects. A pencil is chosen at random. The probability that this pencil is not defective is?
0 answers
9
probability
a lot consists of good pencils, 6 with minor defects and 2 with major defects. A pencil is chosen at random. The probability that this pencil is not defective is?
a lot consists of good pencils, 6 with minor defects and 2 with major defects. A pencil is chosen at random. The probability that this pencil is not defective is?
2 answers
12
normal forms
why there is need of normal forms in the context free grammer ????????????????? elaborate with example plz.
why there is need of normal forms in the context free grammer ????????????????? elaborate with example plz.
1 answer
13
Doubt
Is it possible to prove number of b's=2k+1 and any number of a's is regular using Myhill–Nerode theorem ?
Is it possible to prove number of b's=2k+1 and any number of a's is regular using Myhill–Nerode theorem ?
3 answers
14
Finite state Machine
which of the following statement is True? a) r* and r+ are always different. b) r* and r+ may be equal. Please explain briefly.
which of the following statement is True?a) r* and r+ are always different. b) r* and r+ may be equal. Please explain briefly.
4 answers
15
Recursive languages.
If L1 is Recursive language and L2 is RE. Then L1 ⋂ L2 is RE? Since every Recursive language is RE, then how intersection of the Recursive and RE is RE?
If L1 is Recursive language and L2 is RE. Then L1 ⋂ L2 is RE? Since every Recursive language is RE, then how intersection of the Recursive and RE is RE?
6 answers
16
Finit Automata
The possible number of prefixes for the given 'n' length string is (assume all symbols in the given string are different) a) n b) n+1 c) n+2 d) n-1 please explain.
The possible number of prefixes for the given 'n' length string is (assume all symbols in the given string are different)a) nb) n+1c) n+2d) n-1please explain.
1 answer
17
Turing machine
Design a turing machine that accept the language of odd integer written in binary
Design a turing machine that accept the language of odd integer written in binary
1 answer
18
Self doubt toc
Construct a grammar for L={a^nb^n/m, n greater then equal to 0,m doesn't equal to n}
Construct a grammar for L={a^nb^n/m, n greater then equal to 0,m doesn't equal to n}
2 answers
19
Ethernet
IF the propagation delay csma/cd network is 750 bit times then what is the slot if the jamming signal is 50 bits?
IF the propagation delay csma/cd network is 750 bit times then what is the slot if the jamming signal is 50 bits?
1 answer
20
RSA(self doubt)
1 answer
22
Regular expression
The set of all strings with at most one pair of consecutive zeros and one pair of consecutive ones.
The set of all strings with at most one pair of consecutive zeros and one pair of consecutive ones.
0 answers
23
peterlinz
1 answer
25
context free grammar
Construct context-free grammars to accept the following languages. $\begin{align*} \large L = \left \{ 0^i1^j2^k \;\; | \;\; i \neq j \;\; or \;\; j \neq k \right \} \end{align*}$
Construct context-free grammars to accept the following languages.$$\begin{align*} \large L = \left \{ 0^i1^j2^k \;\; | \;\; i \neq j \;\; or \;\; j \neq k \right \} \end...
1 answer
27
Design a dfa
Construct a dfa which accept all strings which when interpreted is a multiple of 5
Construct a dfa which accept all strings which when interpreted is a multiple of 5
2 answers
28
Design a dfa
Design a dfa which check whether the given no is even or not?
Design a dfa which check whether the given no is even or not?
1 answer
30
Peter linz
L1={a^nb^m, n=>4,m<=3 L1=(aa)*(bb)*+a(aa)*b(bb)* Find L1 complement?
L1={a^nb^m, n=>4,m<=3L1=(aa)*(bb)*+a(aa)*b(bb)*Find L1 complement?