Register
Filter

Recent questions without answers

0 votes
0 answers
4771
Cormen Edition 3 Exercise 4.4 Question 5 (Page No. 93)
Use a recursion tree to determine a good asymptotic upper bound on the recurrence $T(n)=T(n-1)+T(n/2) +n$.Use the substitution method to verify your answer.
Use a recursion tree to determine a good asymptotic upper bound on the recurrence $T(n)=T(n-1)+T(n/2) +n$.Use the substitution method to verify your answer.
User Avatar
0 votes
0 answers
4772
Cormen Edition 3 Exercise 4.4 Question 4 (Page No. 93)
Use a recursion tree to determine a good asymptotic upper bound on the recurrence $T(n) =2T(n-1) + 1$.Use the substitution method to verify your answer.
Use a recursion tree to determine a good asymptotic upper bound on the recurrence $T(n) =2T(n-1) + 1$.Use the substitution method to verify your answer.
User Avatar
0 votes
0 answers
4773
Cormen Edition 3 Exercise 4.4 Question 3 (Page No. 93)
Use a recursion tree to determine a good asymptotic upper bound on the recurrence $T(n)=4T(n/2 +2)+n$.Use the substitution method to verify your answer.
Use a recursion tree to determine a good asymptotic upper bound on the recurrence $T(n)=4T(n/2 +2)+n$.Use the substitution method to verify your answer.
User Avatar
0 votes
0 answers
4774
Cormen Edition 3 Exercise 4.4 Question 1 (Page No. 92)
Use a recursion tree to determine a good asymptotic upper bound on the recurrence $T(n)=3T(\lfloor n/2 \rfloor) + n$. Use the substitution method to verify your answer.
Use a recursion tree to determine a good asymptotic upper bound on the recurrence $T(n)=3T(\lfloor n/2 \rfloor) + n$. Use the substitution method to verify your answer.
User Avatar
0 votes
0 answers
4775
gate 2019
in gate 2019 my marks are 29.67 and my gate score is 352 in general category please give some information about is there any chance of getting m.tech admission in nit’s or iiit’s and please give me the list of universitie’s of information where can i get m.tech admission
in gate 2019 my marks are 29.67 and my gate score is 352 in general category please give some information about is there any chance of getting m.tech admission in nit’...
User Avatar
1 votes
0 answers
4776
Admission
How to write a SOP?What to include in SOP when you are not sure of your interests and don't have a specific purpose of selecting that specialization?
How to write a SOP?What to include in SOP when you are not sure of your interests and don't have a specific purpose of selecting that specialization?
User Avatar
0 votes
0 answers
4779
Cormen Edition 3 Exercise 4.3 Question 6 (Page No. 87)
Show that the solution to $T(n) =T(\lfloor n/2 \rfloor+ 17) + n$ is $O(n\ log\ n)$
Show that the solution to $T(n) =T(\lfloor n/2 \rfloor+ 17) + n$ is $O(n\ log\ n)$
User Avatar
0 votes
0 answers
4780
Cormen Edition 3 Exercise 4.3 Question 3 (Page No. 87)
We saw that the solution of $T(n) = T(\lceil n/2 \rceil) + n$ is $O(lg\ n)$. Show that the solution of this recurrence is also $\Omega(n\ lg\ n)$. Conclude that the solution is $\Theta(n\log \ n)$.
We saw that the solution of $T(n) = T(\lceil n/2 \rceil) + n$ is $O(lg\ n)$. Show that the solution of this recurrence is also $\Omega(n\ lg\ n)$. Conclude that the solut...
User Avatar
0 votes
0 answers
4786
Cormen Edition 3 Exercise 4.1 Question 2 (Page No. 74)
Write pseudo code for the brute-force method of solving the $maximum-subarray$ problem. Your procedure should run in $\Theta(n^2)$ time.
Write pseudo code for the brute-force method of solving the $maximum-subarray$ problem. Your procedure should run in $\Theta(n^2)$ time.
User Avatar
1 votes
0 answers
4787
#self doubt
my doubt is- when question is said find minimum no.of table to given E-R diagram,and additional condition table are satisfying 1NF/2NF/3NF. how we conclude table is 1NF/2NF/3NF.
my doubt is- when question is said find minimum no.of table to given E-R diagram,and additional condition table are satisfying 1NF/2NF/3NF. how we conclude table is 1NF/2...
User Avatar
Page: