Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Abhijit Howal
0
votes
1
psu related
Any psu interview possible for the marks 35-40?jus asking
Any psu interview possible for the marks 35-40?jus asking
444
views
answered
Feb 15, 2018
0
votes
2
my maths is weak to learn even programming language what should i do
204
views
answered
Jan 4, 2018
0
votes
3
Alo doubt
Complexity of equation - T(n)=. 2T(n-1)-1 if n>0 1. Otherwise
Complexity of equation -T(n)=. 2T(n-1)-1 if n>0 1. Otherwise
536
views
answered
Oct 15, 2017
Algorithms
recurrence-relation
time-complexity
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register