Write a function that multiplies two polynomials in HASKELL multPoly :: (Num a, Eq a) => Poly a -> Poly a -> Poly a For example: > multPoly (P [-1,0,1]) (P [0,1]) P [0,-1,0,1] > multPoly (P [-1,0,1]) (P [2]) P [-2,0,2] > multPoly (P [1,1]) (P [-1,1]) P [-1,0,1] > multPoly (P [18,0,3]) (P []) P [] Before writing multPoly, you may find it helpful to write a function that increases the degree of a polynomial by multiplying it by x. E.g., mapping x^2−1 to ?^3−x. Seeing how this function, scale, and addPoly are written should give you a sense of how to construct multPoly. As with addPoly, multPoly is easier to write as a combination of simpler functions. Your implementation of multPoly should have this property: multPoly p q $$ x == (p $$ x) * (q $$ x)

Write a function that multiplies two polynomials in HASKELL multPoly :: (Num a, Eq a) => Poly a -> Poly a -> Poly a For example: > multPoly (P [-1,0,1]) (P [0,1]) P [0,-1,0,1] > multPoly (P [-1,0,1]) (P [2]) P [-2,0,2] > multPoly (P [1,1]) (P [-1,1]) P [-1,0,1] > multPoly (P [18,0,3]) (P []) P [] Before writing multPoly, you may find it helpful to write a function that increases the degree of a polynomial by multiplying it by x. E.g., mapping x^2−1 to ?^3−x. Seeing how this function, scale, and addPoly are written should give you a sense of how to construct multPoly. As with addPoly, multPoly is easier to write as a combination of simpler functions. Your implementation of multPoly should have this property: multPoly p q $$ x == (p $$ x) * (q $$ x)

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 8SA

See similar textbooks

Similar questions

Write a function that multiplies two polynomials in HASKELL Given: data Poly a = P [a] deriving (Show, Eq) multPoly :: (Num a, Eq a) => Poly a -> Poly a -> Poly a For example: > multPoly (P [-1,0,1]) (P [0,1])P [0,-1,0,1]> multPoly (P [-1,0,1]) (P [2])P [-2,0,2]> multPoly (P [1,1]) (P [-1,1])P [-1,0,1]> multPoly (P [18,0,3]) (P [])P [] Before writing multPoly, you may find it helpful to write a function that increases the degree of a polynomial by multiplying it by x. E.g., mapping x^2−1 to ?^3−x. Seeing how this function, scale, and addPoly are written should give you a sense of how to construct multPoly. As with addPoly, multPoly is easier to write as a combination of simpler functions. Your implementation of multPoly should have this property: multPoly p q $$ x == (p $$ x) * (q $$ x) Write a function that adds two polynomials. Ensure that the polynomial produced matches the requirements. addPoly :: (Num a, Eq a) => Poly a -> Poly a -> Poly a For…
In C programming Mathematically, given a function f, we recursively define fk(n) as follows: if k = 1, f1(n) = f(n). Otherwise, for k > 1, fk(n) = f(fk-1(n)). Assume that there is an existing function f, which takes in a single integer and returns an integer. Write a recursive function fcomp, which takes in both n and k (k > 0), and returns fk(n). int f(int n);int fcomp(int n, int k){
Write a function(in pyhton) that takes a list of distinct integers l, and an integer k. Your function then finds the index of the integer in l, whose removal from l results in a list whose sum is k. For example, given [3,6,4,1,5,2] and 18, your function should return index 0, which corresponds to 3 in the list. Because, when 3 is removed from the list, the sum of the remaining list [6,4,1,5,2] is 18. You can assume that the given problem is always solvable.
Write a function double lagrange(double x_int[], double y_int[], int n, double x) which calculates the value of the n-th order Lagrange’s polynomial Pn(x) defined for the set of nodes {x(0), y(0)}, ..., {x(n), y(n)}, for a given value of x
Implement the following function in C programming language that get a string, and compute an array of non-empty tokens of the string containing only lower-case letters. For example: ● For a string "abc EFaG hi", the list of tokens with only lower-case letters is ["abc", "hi"]. ● For a string "ab 12 ef hi ", the list of such tokens is ["ab","ef","hi"]. ● For a string "abc 12EFG hi ", the list of such tokens is ["ab","hi"]. ● For a string " abc ", the list of such tokens is ["abc"]. ● For a string "+*abc!! B" the list of such tokens is empty.That is, we break the string using the spaces as delimiters (ascii value 32), and look only at the tokens with lower-case letters only . The function get_tokens gets a string str, and returns the array with the tokens containing only lower-case letters in the correct order. The length of the array should be the number of tokens, computed in count_tokens. char** get_tokens(const char* str); For example:● get_tokens("abcEFaG…
Write a recursive function named decrypt, which takes a string s and a dictionary d where each key in the dictionary is a string word associated with a secret code as its key. This function should return the list of all possible ways (order it returns it in doesn’t matter) in which the string s can be decoded by splitting it into secret codes and separating the corresponding words of the decoded word with spaces. For instance, calling decrypt('turing', {'turing': 'A', 'tur': 'B', 'ing': 'C', 'tu': 'D', 'ring': 'E', 'ri': 'F', 'ng': 'G'}) returns ['A', 'D E', 'D F G', 'B C']. def decrypt(s: str, d: {str: str}) -> [str]:
Define a function alwaysFollows of type [Integer] -> Bool so that alwaysFollows (x, y, lst) is true if and only if whenever x occurs in the list lst, it is always followed by y. Try your function out on (alwaysFollows('a', 'm', "iamnotaam"), alwaysFollows(6, 9, [1, 4, 6, 9, 8, 5, 6, 9, 7, 3])) ML pls
Write pseudocode for a function Det-Quicksort(A, p, r) that receives array A[1..n], and indices p and r. The function should sort the subarray A[p..r] recursively (meaning you should call itself). You can also use a function LinearSearch(A, p, r, v) that searches subarray A[p..r] for an element of value v and return its index (in case it exists) in O(r − p) time. (Just to give you something to compare to, the solution has 8 lines.)
Using foldl, define a function num2int :: [Int] -> Int -> Int that converts a list of numbers and the number n into an integer of base n. >num2int [3,4,5,6] 10 3456 >num2int [1,1,0,1,0,0,0,1,0,1,0,1,1,0] 2 3456 num2int :: [Int] -> Int -> Int num2int x y = foldl (\acc (a,b) -> ___a___ + b*y^a) 0 (___b___ (\x y ->(x,y)) [0..] (___c___ x)) fill in blank spaces of a , b , and c
Implement the following functions in the same application in C#: 1. Given a number (integer) N (greater than 1). Implement a Fibonacci sequence of length N. (Function name ComputeFibonacciSequence )ComputeFibonacciSequence receives N.2. Given a list L with n numbers (integers), implement a function that returns whether that list is even prone or not (i.e.: the number of even numbers in the list must be higher than that of the odd numbers.) (Function name ComputeEvenProne) - Return 1 if the list is even prone, return 0 if it is not.ComputeEvenProne receives L.
Write a FRACTION calculator program with c++ that adds, subtracts, multiplies, and divides fractions. Your program should check for the division by 0, have and use the following functions: (a) abs - returns the absolute value of a given integer. (b) min - returns the smallest of two positive integers. (c) gcd - returns the greatest common divisor of two positive integers. (d) reduce - reduces a given fraction. (e) flip - reduces a given fraction and flips the sign if the denominator is negative. (f) add - finds the reduced sum of a pair of given fractions. (g) subtract - finds the reduced difference of a pair of given fractions, by making the second fraction negative then using the add function. (h) multiply - finds the reduced product of a pair of given fractions. (i) divide - finds the reduced quotient of a pair of given fractions by inverting the second fraction then using the multiply function.
code required for python: For this question, you will be required to use the binary search to find the root of some function f(x)f(x) on the domain x∈[a,b]x∈[a,b] by continuously bisecting the domain. In our case, the root of the function can be defined as the x-values where the function will return 0, i.e. f(x)=0f(x)=0 For example, for the function: f(x)=sin2(x)x2−2f(x)=sin2(x)x2−2 on the domain [0,2][0,2], the root can be found at x≈1.43x≈1.43 Constraints Stopping criteria: ∣∣f(root)∣∣<0.0001|f(root)|<0.0001 or you reach a maximum of 1000 iterations. Round your answer to two decimal places. Function specifications Argument(s): f (function) →→ mathematical expression in the form of a lambda function. domain (tuple) →→ the domain of the function given a set of two integers. MAX (int) →→ the maximum number of iterations that will be performed by the function. Return: root (float) →→ return the root (rounded to two decimals) of the given function. my code below , however as…