Recent activity by RRajeev / GATE Overflow for GATE CSE

8 answers

1

GATE2012 CY: GA-7
$A$ and $B$ are friends. They decide to meet between 1:00 pm and 2:00 pm on a given day. There is a condition that whoever arrives first will not wait for the other for more than $15$ minutes. The probability that they will meet on that day is $1/4$ $1/16$ $7/16$ $9/16$

$A$ and $B$ are friends. They decide to meet between 1:00 pm and 2:00 pm on a given day. There is a condition that whoever arrives first will not wait for the other for m...

17.2k views

commented May 8, 2021

4 answers

2

GATE CSE 2006 | Question: 84
Which one of the following grammars generates the language $ L=\left \{ a^{i}b^{j}\mid i\neq j \right \}$? $S\rightarrow AC\mid CB$ $C\rightarrow aCb\mid a\mid b$ $A\rightarrow aA\mid \varepsilon$ $B\rightarrow Bb\mid \varepsilon$ ... $S\rightarrow AC\mid CB$ $C\rightarrow aCb\mid \varepsilon$ $A\rightarrow aA\mid a$ $B\rightarrow Bb\mid b$

Which one of the following grammars generates the language $ L=\left \{ a^{i}b^{j}\mid i\neq j \right \}$?$S\rightarrow AC\mid CB$$C\rightarrow aCb\mid a\mid b$$A\rightar...

12.1k views

commented Jan 8, 2021

5 answers

3

GATE IT 2008 | Question: 6
Let $N$ be an NFA with $n$ states and let $M$ be the minimized DFA with m states recognizing the same language. Which of the following in NECESSARILY true? $m \leq 2^n$ $n \leq m$ $M$ has one accept state $m = 2^n$

Let $N$ be an NFA with $n$ states and let $M$ be the minimized DFA with m states recognizing the same language. Which of the following in NECESSARILY true?$m \leq 2^n$$...

10.8k views

commented Dec 1, 2020

1 answer

4

GATE CSE 2001 | Question: 2.7
Consider the following problem $X$. Given a Turing machine $M$ over the input alphabet $\Sigma$, any state $q$ of $M$ and a word $w \in \Sigma^*$, does the computation of $M$ on $w$ visit the state of $q$? Which of the ... ? $X$ is decidable $X$ is undecidable but partially decidable $X$ is undecidable and not even partially decidable $X$ is not a decision problem

Consider the following problem $X$.Given a Turing machine $M$ over the input alphabet $\Sigma$, any state $q$ of $M$ and a word $w \in \Sigma^*$, does the computation of ...

13.5k views

commented Jan 14, 2017

4 answers

5

GATE CSE 2000 | Question: 2.14
Consider the values of $A = 2.0 \times 10^{30}, B = -2.0 \times 10^{30}, C = 1.0,$ and the sequence X:= A + B Y:= A + C X:= X + C Y:= Y + B executed on a computer where floating point numbers are represented with $32$ bits. The values for $X$ and $Y$ will be $X = 1.0, Y = 1.0$ $X = 1.0, Y = 0.0$ $X = 0.0, Y = 1.0$ $X = 0.0, Y = 0.0$

Consider the values of $A = 2.0 \times 10^{30}, B = -2.0 \times 10^{30}, C = 1.0,$ and the sequence X:= A + B Y:= A + C X:= X + C Y:= Y + Bexecuted on a computer where fl...

12.0k views

commented Jan 12, 2017

3 answers

6

Can masters theorem solve the recurrence 4T(n/2) + (n^2).logn ?
Can masters theorem solve the recurrence 4T(n/2) + n2.logn ? it is said that it falls between the case 2 & 3 and no solution possible with this method .can anyone explain it clearly ?

Can masters theorem solve the recurrence 4T(n/2) + n2.logn ? it is said that it falls between the case 2 & 3 and no solution possible with this method .can anyone explai...

21.5k views

commented Jul 31, 2015

2 answers

7

Is the language WXW^R is a regular ?
is the language WXWR is regular? can any one provide the proof?

is the language WXWR is regular? can any one provide the proof?

7.8k views

commented Jun 29, 2015

3 answers

8

Is it possible to build a Regular grammar for ( a^m a^n b^m c^n ) ?

4.4k views

asked Jun 1, 2015

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true