Register

Recent questions tagged kenneth-rosen

1 votes
2 answers
33
Kenneth Rosen Edition 7 Excercise 1.3 Question 56 (Page No. 36)
Show that if p, q, and r are compound propositions such that p and q are logically equivalent and q and r are logically equivalent, then p and r are logically equivalent.
Show that if p, q, and r are compound propositions such that p and q are logically equivalent and q and r are logically equivalent, then p and r are logically equivalent....
User Avatar
0 votes
2 answers
34
kenneth h rosen chapter 1 excercise 1.3 question 47
Show that p NAND q is logically equivalent to ¬(p ∧ q). how to prove this and i prove using truth table which is easy but how to prove using logical identities ? thank you
Show that p NAND q is logically equivalent to ¬(p ∧ q).how to prove this and i prove using truth table which is easy but how to prove using logical identities ?thank y...
User Avatar
0 votes
2 answers
37
Discrete Mathematics and Its Applications by Kenneth H. Rosen
From where can i get full solution of Discrete Mathematics and Its Applications by Kenneth H. Rosen ?
From where can i get full solution of Discrete Mathematics and Its Applications by Kenneth H. Rosen ?
User Avatar
0 votes
1 answer
41
Kenneth Rosen Edition 7 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.$
User Avatar
1 votes
2 answers
42
Kenneth Rosen Edition 7 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.$
Find $f (n)$ when $n = 3k,$ where $f$ satisfies the recurrence relation $f (n) = 2f (n/3) + 4 \:\text{with}\: f (1) = 1.$
User Avatar
0 votes
1 answer
44
Kenneth Rosen Edition 7 Exercise 8.3 Question 10 (Page No. 535)
Find $f (n)$ when $n = 2^{k},$ where $f$ satisfies the recurrence relation $f (n) = f (n/2) + 1 \:\text{with}\: f (1) = 1.$
Find $f (n)$ when $n = 2^{k},$ where $f$ satisfies the recurrence relation $f (n) = f (n/2) + 1 \:\text{with}\: f (1) = 1.$
User Avatar
0 votes
1 answer
45
Kenneth Rosen Edition 7 Exercise 8.3 Question 9 (Page No. 535)
Suppose that $f (n) = f (n/5) + 3n^{2}$ when $n$ is a positive integer divisible by $5, \:\text{and}\: f (1) = 4.$ Find $f (5)$ $f (125)$ $f (3125)$
Suppose that $f (n) = f (n/5) + 3n^{2}$ when $n$ is a positive integer divisible by $5, \:\text{and}\: f (1) = 4.$ Find$f (5)$$f (125)$$f (3125)$
User Avatar
0 votes
1 answer
47
Kenneth Rosen Edition 7 Exercise 8.3 Question 7 (Page No. 535)
Suppose that $f (n) = f (n/3) + 1$ when $n$ is a positive integer divisible by $3,$ and $f (1) = 1.$ Find $f (3)$ $f (27)$ $f (729)$
Suppose that $f (n) = f (n/3) + 1$ when $n$ is a positive integer divisible by $3,$ and $f (1) = 1.$ Find$f (3)$$f (27)$$f (729)$
User Avatar
0 votes
0 answers
48
Kenneth Rosen Edition 7 Exercise 8.3 Question 6 (Page No. 535)
How many operations are needed to multiply two $32 \times 32$ matrices using the algorithm referred to in Example $5?$
How many operations are needed to multiply two $32 \times 32$ matrices using the algorithm referred to in Example $5?$
User Avatar
0 votes
0 answers
49
Kenneth Rosen Edition 7 Exercise 8.3 Question 5 (Page No. 535)
Determine a value for the constant C in Example $4$ and use it to estimate the number of bit operations needed to multiply two $64$-bit integers using the fast multiplication algorithm.
Determine a value for the constant C in Example $4$ and use it to estimate the number of bit operations needed to multiply two $64$-bit integers using the fast multiplica...
User Avatar
0 votes
0 answers
52
Kenneth Rosen Edition 7 Exercise 8.3 Question 2 (Page No. 535)
How many comparisons are needed to locate the maximum and minimum elements in a sequence with $128$ elements using the algorithm in Example $2$?
How many comparisons are needed to locate the maximum and minimum elements in a sequence with $128$ elements using the algorithm in Example $2$?
User Avatar
0 votes
0 answers
58
Kenneth Rosen Edition 7 Exercise 8.2 Question 49 (Page No. 527)
Use question $48$ to solve the recurrence relation $(n + 1)a_{n} = (n + 3)a_{n-1} + n, \:\text{for}\: n \geq 1, \:\text{with}\: a_{0} = 1$
Use question $48$ to solve the recurrence relation $(n + 1)a_{n} = (n + 3)a_{n-1} + n, \:\text{for}\: n \geq 1, \:\text{with}\: a_{0} = 1$
User Avatar
Page: