Register
Filter

Recent activity by ashutoshaay26

3 answers
5
Couting the number of reduce moves
The maximum number of reduce moves that can be taken by a bottom-up parser with no epsilon and unit productions to parse a string of length 3 tokens is ____ ?
The maximum number of reduce moves that can be taken by a bottom-up parser with no epsilon and unit productions to parse a string of length 3 tokens is ____ ?
7 answers
6
GATE CSE 2004 | Question: 84
The recurrence equation $ T(1) = 1$ $T(n) = 2T(n-1) + n, n \geq 2$ evaluates to $2^{n+1} - n - 2$ $2^n - n$ $2^{n+1} - 2n - 2$ $2^n + n $
The recurrence equation$ T(1) = 1$$T(n) = 2T(n-1) + n, n \geq 2$evaluates to$2^{n+1} - n - 2$$2^n - n$$2^{n+1} - 2n - 2$$2^n + n $
2 answers
7
Finite Automata
How to construct NFA with even number of a's and even no of b's??
How to construct NFA with even number of a's and even no of b's??
2 answers
8
decidability
S = { <M> | M is a DFA that accepts some palindrome }. Then what will be S - a) Turing recognizable b) decidable c) undecidable d) none of these
S = { <M | M is a DFA that accepts some palindrome }. Then what will be S -a) Turing recognizableb) decidable c) undecidabled) none of these
2 answers
9
ISI2011-PCB-A-2a
Give a strategy to sort four given distinct integers $a, b, c, d$ in increasing order that minimizes the number of pairwise comparisons needed to sort any permutation of $a, b, c, d$.
Give a strategy to sort four given distinct integers $a, b, c, d$ in increasing order that minimizes the number of pairwise comparisons needed to sort any permutation of ...
1 answer
11
Deterministic Push Down Automata
What is main difference between Deterministic Push down automata and simple Push down automata ?
What is main difference between Deterministic Push down automata and simple Push down automata ?