21. Consider the following recurrence relation: (1) = 1; (2) = 1;A3) = 1;(4)= 3: (5) %; An) = An-1) + 3 x (n-5) for all n> 5. a. Computef(n) for the following values of n: 6, 7, 12, 15. b. If you were careful, rather than computing /(15) from scratch (the way a recursive C++ function would compute it), you would have computed /(6), then f(7), then f(8), and so on up to (15), recording the values as you computed them. This ordering would have saved you the effort of ever computing the same value more than once. (Recall the iterative version of the rabbit function discussed at the end of this chapter.) Note that during the computation, you never need to remember all of the previously computed values-only the last five. Taking advantage of these observations, write a C++ function that computes /(n) for arbitrary values of n.

21. Consider the following recurrence relation: (1) = 1; (2) = 1;A3) = 1;(4)= 3: (5) %; An) = An-1) + 3 x (n-5) for all n> 5. a. Computef(n) for the following values of n: 6, 7, 12, 15. b. If you were careful, rather than computing /(15) from scratch (the way a recursive C++ function would compute it), you would have computed /(6), then f(7), then f(8), and so on up to (15), recording the values as you computed them. This ordering would have saved you the effort of ever computing the same value more than once. (Recall the iterative version of the rabbit function discussed at the end of this chapter.) Note that during the computation, you never need to remember all of the previously computed values-only the last five. Taking advantage of these observations, write a C++ function that computes /(n) for arbitrary values of n.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

1. The Fibonacci numbers F(0), F(1), F(2), are defined by the recurrence relation:F(0) = 0,F(1) = 1,F(n) = F(n-1) + F(n-2) for n >= (greater than or equal to) 2.The first few Fibonacci numbers are 0, 1, 1, 2, 3, 5, 8, 13, and 21. Prove by induction that for all n >= (greater than or equal to) 1.[F(n-1)][F(n+1)] - F(n)2 = (-1)n.Hint: Express F(n-1) in terms of F(n)and F(n-2) and express F(n+1) in terms of F(n) and F(n-1). Expand and simplify, then apply the inductive hypothesis. Handwritten only
Define a recurrence relation T(n) that corresponds to the natural numbers, but that "skips" multiples of 3. That is, T(1) = 1, T(2) = 2, T(3) = 4, T(4) = 5, T(5) = 7, T(6) = 8, T(7) = 10, ... Your answer should only have some number of base cases and the general case, but no conditions (like "if n mod3=0").
1. Consider strings that contain only the capital letters A, B and C. A) Find a recurrence relation for the number of such strings of length n that contain two consecutive C letters. What are the initial conditions? B) How many such strings of length six contain two consecutive C letters? C) Answer the question in point b using the Inclusion-Exclusion Principle (set A contains all strings of length six where CC occupy the first two positions, set B contains all strings of length six where CC occupy the second and third position, etc.).
Big-O notation is defined as follows: The function f(n) is O(g(n)) if there are positive integers c and N such that f(n) ≤ c · g(n) for all n > N. Is the relation “f(n) is O(g(n))” reflexive? symmetric? transitive? Justify your answers. “Θ(g(n))” is defined as follows: f(n) is Θ(g(n)) if and only if (f(n) is O(g(n)) & g(n) is O(f(n))). Is the relation “f(n) is Θ(g(n))” reflexive? symmetric? transitive? Justify your answers
t(1) = 5 , t(n) = t(n/2) substitution recurrence relation
Given the following code snippet, find the following:1) Recurrence relation of func (x,y) when x>0 and length of y is n.T(x,n) = T(_) + O(_) (Just fill in the blanks)For 2-3, consider worst-case scenario and initial value of y as [1]2) Time complexity of func (x,y)3) Auxiliary Space Complexity of func (x,y)
For the following number patterns write the recurrence relation i) 5, 8.2, 11.4, 14.6, …. ii) 400, 50, 6.25, 0.781
Use the substitution method to identify the big-Oh of the represented by the following recurrence relation. Note: c is a constant. T(n) = cn + T(n/2) + T(n/2), T(1) = c
Let's say you have access to a database including the x, y coordinates and names of local eateries. For the time being, let's pretend that just the following kinds of inquiries will be made: The inquiry seeks to ascertain whether a dining establishment is present in a given area. Which indexing system is preferable: B-tree or R-tree? Why?
write a recurrence relation to model this situation
Suppose you want to solve the following equality 2a + b + 3c + 4d + 6e = 45 What is the chromosome phenotype? What is the fitness function? What is the fitness value of a, b, c, d, e = (The first five numbers of university ID)? (hint if ID= 437818854 then a=1, b=8, c=8, d=5, e=4)
Exercise 4 Given the following recurrence relationT(1) = −1 T(2) = 7 T(n) = −4T(n − 1) − 3T(n − 2) for n ≥ 3 Indicate a methodology you can use to evaluate the closed form expression Provide the closed form expression and show the procedure to obtain it