Question

64% OO AT&T 8:28 PM Homework 4 1. Consider the following recurrence relation if n s 0 if n 1 or n 2 H(n) H(n 1)+H (n 2)-H(n-3) if n 2. (a) Compute H(n) for n 1.2. ....10. (b) Using the pattern from part (a), guess what H(100) is. 2. Consider the recurrence relation defined in Example 3.3 (FROM TEXT BOOK, also discussed in class and shown in slides) Suppose that, as in the example, you borrow S500, but you pay her back S100 each week. Each week, Ursula charges you 10% interest on the amount you still owe, after yourS100 payment is taken into account (a) Write down a recurrence relation for M(n), the amount owed after n weeks. 3. Let H(n) be as in Example 34, and let T(n) be as in Exercise 13. Write H(n) in terms of TOn l). Explain your reasoning. (Hint: Use Eigure 34) 4. What is closed form solution: please write and example of closed form solution and its recurrence relation. 5. What is proof by induction and what are the steps to be followed to prove by induction and show an example?
Need answers for 1-5
0 0
Add a comment Improve this question Transcribed image text
Answer #1

(a)
H(1) = 1
H(2) = 1
H(3) = 2
H(4) = 2
H(5) = 3
H(6) = 3
H(7) = 4
H(8) = 4
H(9) = 5
H(10) = 5

(b) H(100) will be 100/2 which is 50.

Add a comment
Know the answer?
Add Answer to:
Need answers for 1-5 Consider the following recurrence relation: H(n) = {0 if n lessthanorequalto 0...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT