Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Deep99
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Deep99
2
answers
1
Solve this equation T(n) = 7T(n/2) + n^2
34.5k
views
asked
Jun 18, 2016
Algorithms
recurrence-relation
algorithms
+
–
1
answer
2
Solve this Equation T(n) = 8T(n/2) + n^2 where (T(1) = 1)
33.7k
views
asked
Jun 18, 2016
Algorithms
algorithms
recurrence-relation
+
–
2
answers
3
Write regular expression to denote a language L which accepts all the strings which begin or end with either 00 or 11
A. [(00(0+1)* 11] + [11( 0 + 1)* 00]B. [(00+11) (0+1)+] + [( 0 + 1)+ (00+11)].C. [(00+11) (0+1)*] + [( 0 + 1)* (00+11)]D. (00+11) (0+1)* (00+11).
20.6k
views
commented
Jun 17, 2016
Theory of Computation
theory-of-computation
regular-expression
peter-linz
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register