Register
Filter

Questions by Gabbar

1 votes
3 answers
1
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...
1 votes
1 answer
2
recursion
0 votes
0 answers
3
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 votes
0 answers
4
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?
0 votes
1 answer
6
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
0 votes
2 answers
7
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 votes
1 answer
8
RSA(self doubt)
0 votes
0 answers
9
Self doubt(Computer network security)
0 votes
1 answer
10
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 votes
0 answers
11
peterlinz
1 votes
1 answer
12
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...
0 votes
1 answer
14
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
0 votes
2 answers
15
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?
0 votes
1 answer
16
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}
1 votes
1 answer
17
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?
0 votes
4 answers
18
RegulaR Expression
Find the regular expression No 2 a's and 2 b's should come together?
Find the regular expression No 2 a's and 2 b's should come together?
0 votes
1 answer
19
Toc self doubt
Design NDFA over {0,1} in which two 0s are separated by a string of length 2i, for i>0 and convert it into equivalent dfa?
Design NDFA over {0,1} in which two 0s are separated by a string of length 2i, for i>0 and convert it into equivalent dfa?
4 votes
1 answer
20
Grammar
Construct a grammar which generate even integer upto 998?
Construct a grammar which generate even integer upto 998?
Page: