closed by
242 views
0 votes
0 votes
closed with the note: Not GATE standard

closed by

Related questions

1 votes
1 votes
0 answers
1
srestha asked Dec 6, 2018
382 views
Where can we apply PCP to check, if the grammar is undecidable?Some examples of such grammars Ambiguous grammarAny other example and how they solved with PCP?
1 votes
1 votes
0 answers
2
Pawan Kumar 2 asked Jan 22, 2018
341 views
1 votes
1 votes
0 answers
3
atul_21 asked Jan 2, 2018
1,786 views
0 votes
0 votes
1 answer
4
Rishabh Agrawal asked Jan 18, 2019
319 views
c=0for i $\leftarrow$ 1 to n for j $\leftarrow$ i+1 to n for k $\leftarrow$ 1 to j c = c + 1 The value of c isO(n$^{2}$)O(n$^{2}$.log n)O(n$^{3}$)O(n$...