The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Kenneth Rosen Edition 7th Exercise 8.3 Question 13 (Page No. 535)
0
votes
96
views
Give a bigO estimate for the function $f$ in question $12$ if $f$ is an increasing function.
kennethrosen
discretemathematics
counting
recurrencerelations
descriptive
๐ฉ Low quality

๐ฎ
Hitesh

๐ฌ โPlease post picture of the question statement.โ
asked
May 10
in
Combinatory
by
Lakshman Patel RJIT
1
flag

96
views
answer
comment
0
How your GATE 2020 went?
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
โ Prev.
Next โ
โ Prev. Qn. in Sub.
Next Qn. in Sub. โ
Related questions
0
votes
1
answer
1
Kenneth Rosen Edition 7th Exercise 8.3 Question 16 (Page No. 535)
Solve the recurrence relation for the number of rounds in the tournament described in question $14.$
asked
May 10
in
Combinatory
by
Lakshman Patel RJIT

235
views
kennethrosen
discretemathematics
counting
recurrencerelations
descriptive
0
votes
1
answer
2
Kenneth Rosen Edition 7th Exercise 8.3 Question 15 (Page No. 535)
How many rounds are in the elimination tournament described in question $14$ when there are $32$ teams?
asked
May 10
in
Combinatory
by
Lakshman Patel RJIT

85
views
kennethrosen
discretemathematics
counting
recurrencerelations
descriptive
0
votes
2
answers
3
Kenneth Rosen Edition 7th Exercise 8.3 Question 14 (Page No. 535)
Suppose that there are $n = 2^{k}$ teams in an elimination tournament, where there are $\frac{n}{2}$ games in the first round, with the $\frac{n}{2} = 2^{k1}$ winners playing in the second round, and so on. Develop a recurrence relation for the number of rounds in the tournament.
asked
May 10
in
Combinatory
by
Lakshman Patel RJIT

97
views
kennethrosen
discretemathematics
counting
recurrencerelations
descriptive
+1
vote
2
answers
4
Kenneth Rosen Edition 7th Exercise 8.3 Question 12 (Page No. 535)
Find $f (n)$ when $n = 3k,$ where $f$ satisfies the recurrence relation $f (n) = 2f (n/3) + 4 \:\text{with}\: f (1) = 1.$
asked
May 10
in
Combinatory
by
Lakshman Patel RJIT

65
views
kennethrosen
discretemathematics
counting
recurrencerelations
descriptive
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
IIT Bombay M.Tech. (RA)  Interview Experience
Interview Experience for MS(R)IIT Delhi (School of Information Technology)
How am I preparing
PGEE 2020 (CSE) Experience
IIT Tirupati MS Interview 2020
Subjects
All categories
General Aptitude
2k
Engineering Mathematics
8.2k
Discrete Mathematics
5.9k
Mathematical Logic
2.1k
Set Theory & Algebra
1.5k
Combinatory
1.4k
Graph Theory
846
Probability
1k
Linear Algebra
732
Calculus
600
Digital Logic
2.9k
Programming and DS
5k
Algorithms
4.4k
Theory of Computation
6.2k
Compiler Design
2.2k
Operating System
4.6k
Databases
4.2k
CO and Architecture
3.4k
Computer Networks
4.2k
Non GATE
1.2k
Others
1.5k
Admissions
595
Exam Queries
562
Tier 1 Placement Questions
23
Job Queries
71
Projects
19
Unknown Category
1k
Recent Blog Comments
Can someone tell me how to check part B marks?...
After getting so many mails from you...
Refund will be given for such cases if applied...
@sreejit007 they don't publish any cutoff or...
@ranjanabhi Can you please elaborate what did...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
52,345
questions
60,497
answers
201,858
comments
95,314
users