Register
Filter

Questions by Veeplob Singh

2 votes
1 answer
1
Cormen 3rd edition (Chapter 4 Divide & Conquer)
Refer Cormen 4-3 (j) Page no108 Give Asymptotic upper bound of given recurrence using "SUBSTITUTION METHOD" T(n)=n^(1/2) .T(n^(1/2)) +n
Refer Cormen 4-3 (j) Page no108Give Asymptotic upper bound of given recurrence using "SUBSTITUTION METHOD" T(n)=n^(1/2) .T(n^(1/2)) +n
2 votes
2 answers
2
Doubt whether given language is CFL?
L={a^n b^(2n+1) | n>=1} Also can you give acceping PDA diagram...plz
L={a^n b^(2n+1) | n>=1}Also can you give acceping PDA diagram...plz