CS计算机代考程序代写 AI Project 5: Streams Due: Tue March 30, 2021

Project 5: Streams Due: Tue March 30, 2021
Introduction
In this assignment, you will work with streams to evaluate power series.
Consider the series 𝑠(𝑥) = 𝑎0 + 𝑎1𝑥 + 𝑎2𝑥2 +…. We can represent this series by its finite or infinite sequence of coefficients (𝑎0, 𝑎1, 𝑎2, …) . We will view this sequence as a stream.
Specification
For all functions below, use memoized streams. All input streams are nonempty, and may be finite or infinite. Compute only as much of the result stream as needed.
1. Write a function addSeries that takes two streams of coefficients for the series s(x) and t(x) and returns the stream of coefficients for the sum s(x) + t(x).
For example, given 1+2x+3×2+… and 2+6x+9×2+…, the result will be 3+8x+12×2+…
2. Write a function prodSeries that takes two streams of coefficients for the series s(x) and t(x) and returns the stream of coefficients for the product s(x) ⋅ t(x).
For example, given 1+2x+3×2+… and 2+6x+9×2+…, the result will be 2+10x+27×2+…
Hint: consider that a series can be written as 𝑠(𝑥) = 𝑎0 + 𝑥 𝑠1(𝑥), where s1(x) is another series.
3. Write a function derivSeries that takes a stream of coefficients for the series s(x), and returns a stream of coefficients for the derivative s’(x).
For example, given 1+2x+3×2+…, the result will be 2+6x+…,
4. Write a function coeff that takes a stream of coefficients for the series s(x) and a natural number n, and returns the array of coefficients of s(x), up to and including that of order n. If the stream has fewer coefficients, return as many as there are.
5. Write a function evalSeries that takes a stream of coefficients for the series s(x), and a natural number n, and returns a closure. When called with a real number x, this closure will return the sum of all terms of s(x) up to and including the term of order n.
6. Write a function rec1Series that takes a function f and a value v and returns the series s(x) where 𝑎0 = v, and 𝑎𝑘+1 = f(𝑎𝑘), for k ≥ 0.
7. Write a function expSeries with no arguments that returns the Taylor series for ex, i.e., the coefficients are ak = 1/k! You may use rec1Series with an appropriate closure.
8. Write a function recurSeries, taking two arrays, coef and init, assumed of equal positive length k, with coef = [c0, c1, …, ck-1]. The function should return the infinite stream of values ai given by a k-order recurrence: the first k values are given by init: [a0, a1, …, ak-1]; the following values are computed using the relation an+k = c0 an + c1 an+1 + … + ck-1 an+k-1 for n ≥ 0.