Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recurrence Problem
Shubhgupta
asked
in
Algorithms
Jan 20, 2018
472
views
1
vote
1
vote
The runtime of a divide-and-conquer algorithm is described by the following recurrence: T(n) = 3T(n/2) + O(1). How many subproblems will we have at the 5th level of recursion if the top level is considered to be the 0th level__________?
recurrence-relation
algorithms
Shubhgupta
asked
in
Algorithms
Jan 20, 2018
by
Shubhgupta
472
views
answer
comment
Follow
share this
share
2 Comments
by
joshi_nitish
commented
Jan 20, 2018
reply
Follow
share this
at level 5, there will be $243$ subproblems each of size $\frac{n}{32}$
0
0
by
Hemant Parihar
commented
Jan 20, 2018
reply
Follow
share this
At level k, we will be having $3^k$ subproblem and size of each subproblem at level K will be $\frac{n}{2^k}$.
For k = 5, we will be having $3^5$ subproblem.
0
0
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
2
answers
1
ajit
asked
in
Algorithms
Sep 7, 2015
796
views
what is the divide and conquer recurrence that would arise for the problem
suppose you are given n bit integers asuming for common sense n as power of 2 .it is required to multiply them using divide and conquer method .what is the divide and conquer recurrence that would arise for the problem a) T(n)=4T(n/2)+c b) a) T(n)=2T(n/2)+n c) a) T(n)=4T(n/2)+n2 d) a) T(n)=4T(n)+n
ajit
asked
in
Algorithms
Sep 7, 2015
by
ajit
796
views
algorithms
divide-and-conquer
recurrence-relation
0
votes
0
votes
0
answers
2
jenilS7
asked
in
Algorithms
Mar 18
51
views
Recurrence relation
What is the returned value by the given function below. Algo fun(n) { If(x<=2) return 1; Else { Return fun(n1/2) + n; } } Note : Assume that all the syntax and data type constraints are valid and just check algorithm.
jenilS7
asked
in
Algorithms
Mar 18
by
jenilS7
51
views
recurrence-relation
algorithms
sequence-series
0
votes
0
votes
1
answer
3
practicalmetal
asked
in
Algorithms
Sep 15, 2023
370
views
Recurrence relations
Consider the following function: function X(n,r) { if(r==0 or n == r) then return 1; else return (X(n-1,r-1,) + X(n-1,r)); } Find the worst case time complexity of function X ?
practicalmetal
asked
in
Algorithms
Sep 15, 2023
by
practicalmetal
370
views
recurrence-relation
algorithms
0
votes
0
votes
1
answer
4
darkswow
asked
in
Algorithms
Oct 18, 2022
523
views
How to solve this recurrence T(n)=17T(7n)+n^4
darkswow
asked
in
Algorithms
Oct 18, 2022
by
darkswow
523
views
algorithms
recurrence-relation
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy