menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
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
My GATE Preparation Story (AIR 4434 to AIR 101)
IIT(MS) interview experience
My GATE Preparation Experience (AIR 6 in GATE CS 2020) and Tips For Future Aspirants
IIT Madras MS in CSE Interview Experience
My GATE Preparation Experience (GATE CS 2020 AIR 188)
Subjects
All categories
General Aptitude
(2k)
Engineering Mathematics
(8.3k)
Discrete Mathematics
(5.9k)
Mathematical Logic
(2.1k)
Set Theory & Algebra
(1.5k)
Combinatory
(1.4k)
Graph Theory
(844)
Probability
(1k)
Linear Algebra
(732)
Calculus
(600)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.4k)
Theory of Computation
(6.2k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.5k)
Computer Networks
(4.2k)
Non GATE
(1.2k)
Others
(1.4k)
Admissions
(595)
Exam Queries
(562)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1k)
Recent Blog Comments
@Ankur Barick Yeah, I'd say the same - GATE...
You can check now for access..
Sir when will i get the access?
yes sir
Did you use a different email for payment?
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Kenneth Rosen Edition 7th Exercise 8.3 Question 11 (Page No. 535)
0
votes
41
views
Give a big-O estimate for the function $f$ in question $10$ if $f$ is an increasing function.
kenneth-rosen
discrete-mathematics
counting
recurrence-relations
descriptive
asked
May 10
in
Combinatory
Lakshman Patel RJIT
41
views
answer
comment
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
259
views
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.$
Solve the recurrence relation for the number of rounds in the tournament described in question $14.$
asked
May 10
in
Combinatory
Lakshman Patel RJIT
259
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relations
descriptive
0
votes
1
answer
2
93
views
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?
How many rounds are in the elimination tournament described in question $14$ when there are $32$ teams?
asked
May 10
in
Combinatory
Lakshman Patel RJIT
93
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relations
descriptive
0
votes
2
answers
3
113
views
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^{k-1}$ winners playing in the second round, and so on. Develop a recurrence relation for the number of rounds in the tournament.
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^{k-1}$ 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
Lakshman Patel RJIT
113
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relations
descriptive
0
votes
1
answer
4
140
views
Kenneth Rosen Edition 7th Exercise 8.3 Question 13 (Page No. 535)
Give a big-O estimate for the function $f$ given below if $f$ is an increasing function. $f (n) = 2f (n/3) + 4 \:\text{with}\: f (1) = 1.$
Give a big-O estimate for the function $f$ given below if $f$ is an increasing function. $f (n) = 2f (n/3) + 4 \:\text{with}\: f (1) = 1.$
asked
May 10
in
Combinatory
Lakshman Patel RJIT
140
views
kenneth-rosen
discrete-mathematics
counting
recurrence-relations
descriptive
...