1 answer
2
Let T(n) be a function defined by the recurrence T(n)=2T(n/2)+√n for n≥2 andT(1)=1Can someone please explain solution of this using back substitution
0 answers
4
I cannot download go pdf 2019 from https://classroom.gateoverflow.in/course/view.php?id=19 when i click it my go account opens and error msg is shown "Sorry, this activi...
1 answer
5
Please tell the procedure of muntiplication of (-5)x (-3) using booth algorithm?
1 answer
6
construct a pda fora^mb^n such that m=2n+1?
0 answers
7
construct a DFA over {a,b} such that in each string,no of a's and b's are 2 ?
0 answers
8
construct a mininal DFA which accept sets of all strings over {a,b} such that 2nd symbol from RHS in each string is 'a'?