Dark Mode

Recent activity by gabbar

3 answers

1

lexical analysis
The number of tokens in the following expression is? + * * * < = & > { - + + + } ( >> ) + & &

commented in Compiler Design Nov 3, 2017

1.5k views

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.

answered in Compiler Design Oct 15, 2017

2.1k views

2 answers

3

please tell the multiplication of (+15 X -13) Through the Booth Multiplication Algo.
..

commented in CO and Architecture Sep 26, 2017

59.2k views

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$

commented in Computer Networks Sep 26, 2017

7.8k views

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

retagged in Combinatory Aug 14, 2017

2.7k views

2 answers

6

time complexity
what the time complexity for T(n)=5T(n/2)+n^2 a. n b.n^2

answered in Algorithms Jul 22, 2017

441 views

1 answer

7

commented in Programming in C Jul 14, 2017

1.7k views

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?

commented in Probability Jul 14, 2017

700 views

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?

asked in Probability Jul 14, 2017

262 views

1 answer

10

probability
India plays two matches each with West Indies and Srilanka. In any match the probabilities of India getting points 0,1 and 2 are 0.45,0.05 and 0.50 respectively. Assuming that the outcomes are independent, the probability of India getting at least 7 points is? a) 0.8750 b) 0.0875 c) 0.0625 d) 0.0250

commented in Probability Jul 11, 2017

646 views

1 answer

11

theory of computation

commented in Theory of Computation May 6, 2017

468 views

2 answers

12

normal forms
why there is need of normal forms in the context free grammer ????????????????? elaborate with example plz.

commented in Theory of Computation May 6, 2017

1.2k views

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 ?

answered in Theory of Computation May 6, 2017

266 views

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.

commented in Theory of Computation May 6, 2017

1.4k views

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?

commented in Theory of Computation May 6, 2017

2.1k views

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.

commented in Theory of Computation May 6, 2017

7.9k views

1 answer

17

Turing machine
Design a turing machine that accept the language of odd integer written in binary

asked in Theory of Computation Apr 17, 2017

2.5k views

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}

commented in Theory of Computation Apr 17, 2017

337 views

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?

asked in Computer Networks Apr 4, 2017

606 views

1 answer

20

RSA(self doubt)

answer selected in Computer Networks Apr 3, 2017

651 views

0 answers

21

Self doubt(Computer network security)

commented in Computer Networks Apr 2, 2017

427 views

1 answer

22

Regular expression
The set of all strings with at most one pair of consecutive zeros and one pair of consecutive ones.

asked in Theory of Computation Apr 1, 2017

2.8k views

0 answers

23

asked in Theory of Computation Apr 1, 2017

293 views

5 answers

24

Peter Linz Exercise 7.3
#3 : Is the language L= { anbn : n>=1 } U {b} deterministic ? #4 : Is the language L={anbn : n>=1} U {a} deterministic ? #7 Is the following regular language deterministic? L= { anbmck : n=m or m=k } #8 Is the L = {anbm : n ... ended and WR has started. #11- No Idea about it. Please someone verify and tell me is my way of analysis and the analysis is correct or not?

commented in Theory of Computation Mar 31, 2017

3.4k views

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*}$

commented in Theory of Computation Mar 26, 2017

698 views

1 answer

26

Probability
The probability that a student knows the correct answer to a multiple choice question is 2/3. If the student doesn't know the answer then the student guess the answer. The probability of the guess answer is being correct is 1/4.given that student has answer the questions correctly, the conditional probability that the student knows the correct answer is

asked in Mathematical Logic Mar 2, 2017

2.4k views

1 answer

27

Design a dfa
Construct a dfa which accept all strings which when interpreted is a multiple of 5

asked in Theory of Computation Feb 27, 2017

490 views

2 answers

28

Design a dfa
Design a dfa which check whether the given no is even or not?

commented in Theory of Computation Feb 27, 2017

1.3k views

2 answers

29

ISRO 2015-EC Finte State Machine
The following Finite State Machine (FSM) is used to detect a particular pattern in input data stream. Whenever the pattern is matched at input, output is set to '1' or else output is cleared to '0'. For which ... data stream, output goes to '1' twice? (a) 0010011010010101 (b) 0011011010010101 (c) 0101011000010101 (d) 1100100101001010

commented in Theory of Computation Feb 23, 2017

1.5k views

1 answer

30

Peter linz
L1={a^nb^m, n=>4,m<=3 L1=(aa)*(bb)*+a(aa)*b(bb)* Find L1 complement?

commented in Theory of Computation Feb 19, 2017

360 views