0 votes
2 answers
2
every time while finding recurence solution (in CLRS book , page 88) a statement "Floors and ceilings usually do not matter when solving recurrences" but my doubt is whe...
1 votes
1 answer
3
Number of distinct graphs with p vertices and q edges ( p not equal to q) is always equal toa) pb) qc)min(p,q)d)max (p,q)e) none of this
4 votes
4 answers
5
is it cfl L = { a^n b^n c^m | n>=1 , m=2n } ?i did like for stack push and pop " a & b " are coverd and later we are having stack empty? can we write this language ...
4 votes
1 answer
6
abcd belongs to (b*a*)*(d*c*)*