We will design a type representing **polynomials**. A polynomial is a function of some variable x written in the form \[ a_n x^n + a_{n-1} x^{n-1} + \cdots + a_2 x^2 + a_1 x + a_0 .\]The values \(a_i\) are the coefficients of the polynomial.We can represent a polynomial as a list of coefficients. For convenience, we will start with \(a_0\) followed by \(a_1\) and so forth. Two polynomials are equal if all their coefficients are equal. To simplify things, we will require our lists to be finite and end with a non-zero coefficient.Copy this data declaration to a file:```haskelldata Poly a = P [a] deriving (Show, Eq)```Thus, `P [2,1]` represents the polynomial \(x + 2\), `P [-1,0,1]` represents \(x^2 - 1\), `P [0,0,0,2]` represents \(2x^3\), and so forth.1. The **degree** of a polynomial is the largest exponent occurring in any of its terms. Write a function that returns the degree of a polynomial.```haskelldegree :: Poly a -> Int```For example:```haskell> degree (P [])0> degree (P [8])0> degree (P [2,1])1> degree (P [-1,0,2])2```

Answer: I think this type question can be solved in better way by MATLAB so we are writing a…

Answered: data Poly a = P [a] deriving (Show, Eq)…

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

Create a function that takes two integers, num and n, and returns an integer which is divisible by n and is the closest to num. If there are two numbers equidistant from num and divisible by n, select the larger one. Examples roundNumber (33, 25). - 25 roundNumber (46, 7)→ 49 roundNumber (133, 14) → 140
Write a function ones_and_tens_digit_histogram(numbers) that takes as input a list of numbers and produces as output a list of 10 numbers. Each element of the result indicates the frequency with which that digit appeared in the ones place or the tens place in the input. here is an example call and result: Call: ones_and_tens_digit_histogram([0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765]) Return: [0.21428571428571427, 0.14285714285714285, 0.047619047619047616, 0.11904761904761904, 0.09523809523809523, 0.09523809523809523, 0.023809523809523808, 0.09523809523809523, 0.11904761904761904, 0.047619047619047616] In this example call, the index 1 of the list contains the element 0.14285714285714285 because the value 1 appears in 14.285714285714285% of the ones or tens digits of the given numbers. In a number that is less than 10, such as 3, the tens place is implicitly zero. That is 3 must be treated as 03. Your code should treat the tens digits…
Please write the function using SML -
Please solve using C language The function get_tokens gets a string str, and a char delim, and returns the array with the tokens 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, char delim); For example: ● get_tokens("abc-EFG--", '-') needs to return ["abc","EFG"] ● get_tokens("++a+b+c", '+') needs to return ["a","b","c"]. ● get_tokens("***", '*') needs to return either NULL or an empty array. Note that the returned array and the strings in it must all be dynamically allocated.
Mdt ɔɔ 9Create the matrix (M) below using as little code as possible. You should use multiple built-in functions. M= 6.0000 19.5000 33.0000 6.0000 19.5000 33.0000 9.0000 9.0000 9.0000 9.0000 9.0000 9.0000 5.0000 -1.0000 -7.0000 5.0000 -1.0000 -7.0000 6.0000 19.5000 33.0000 6.0000 19.5000 33.0000 9.0000 9.0000 9.0000 9.0000 9.0000 9.0000 5.0000 -1.0000 -7.0000 5.0000 -1.0000 -7.0000 Now within the script use MATLAB commands to make the following changes to the matrix. Include comments in your script to separate the parts. a. Change the four numbers in the center of matrix M to one. b. Divide the bottom half of the matrix by 4. c. Multiply the top half of the matrix by 4. d. Delete the last column of the matrix. e. Create a new matrix C from first, third, and fifth column of the second and fourth rows of M. f. Sort each column of C in descending order. Calculate the following equation: 45 C* + C D=-
Jupyter Notebook Fixed Income - Certicificate of Deposit (CD) - Compound Interest Schedule An interest-at-maturity CD earns interest at a compounding frequency, and pays principal plus all earned interest at maturity. Write a function, called CompoundInterestSchedule, that creates and returns a pandas DataFrame, where each row has: time (in years, an integer starting at 1), starting balance, interest earned, and ending balance, for an investment earning compoundedinterest. Use a for(or while) loop to create this table. The equation for theith year's ending balance is given by: Ei =Bi (1+r/f)f where: Ei is year i's ending balance Bi is year i's beginning balance (note: B1 is the amount of the initial investment (principal) r is the annual rate of interest (in decimal, e.g., 5% is .05) f is the number of times the interest rate compounds (times per year) The interest earned for a given year is Ei - Bi Note the term of the investment (in years) is not in the above equation; it is used…
Write a function that takes 4 Inter gets (num1, den1,num2,den2) as parameters which represent the rational numbers num1/den1, num2/den2 and returns the division of these two fractions. A/B ÷ C/D = A/B × D/C = AD/BC • den 1, den2, and num2 can not be zero. • use multiplication_rat function.
Python code
C'ZT Write a function that takes one input, a matrix X. Your function should modify X and return the modified version of X as an output. Assuming that X has m rows and n columns: When m is equal to n, modified X should be the same as X. When m is greater than n, the modified version of X should be m x m. New columns should be added to the right of the original columns of X, with each new element having a value that is one less than the element in the column to the left. For example, the matrix: 2 3 4 6 Would become: 2321 4 65 4 8987 1210 When n is greater than m, the modified version of X should be n x n. New rows should be added to the bottom of the original rows of X, with each new element having a value that is one more than the element in the row above it. For example, the matrix: 2345 468 10 Would become 2345 4 6 1e 3791L G8 10 12
Computer Science IN MATLAB Write a function CalFunc.m that can receive multiple math function as input arguments in the form of function handles. This function has one output argument which is the number of input arguments. This function creates a 1x100 vector with values between 0 and 10 as the x values, plots all function handles in a single plot with a proper legend. If the function is called without any input argument, the function will ask the user to enter an anonymous function for plotting. Your program should work as below:
Recamán's sequence def recaman(n): Compute and return the first n terms of the Recamán's sequence, starting from the term a1 = 1.Note how the definition for the current next element depends on whether a particular number is already part of the previously generated part of the sequence. To let your function execute in a speedy fashion even when generating a sequence that contains millions of elements, you should use a set to keep track of which values are already part of the previously generated sequence. This way you can generate each element in constant time, instead of having to iterate through the entire previously generated list. The better technique that saves time by using more memory can create this list arbitrarily far in linear time, and should therefore be fast even for millions of elements, at least until it runs out of memory. n Expected result 10 [1, 3, 6, 2, 7, 13, 20, 12, 21, 11] 1000000 (a list of million elements whose last five elements are [2057162,1057165,…
Program Assignment07implicit noneinteger, parameter :: n = 1000 ! maximum iterationreal(kind=8), parameter :: EPSILON = 1.d-3real(kind=8):: x0,xinteger:: iterationx0=3.0d0call solve(f(x),fp(x),x0,n,x,iteration) contains real (kind=8) function f(x) ! this is f(x)implicit nonereal (kind=8), intent(in)::xf=x**2.0d0-1.0d0end function f real (kind=8) function fp(x) ! This is f'(x)implicit nonereal (kind=8), intent(in)::xfp=2.0d0*xend function fp end program Assignment07 modify this program in fortran byy adding a module (called Newton) which contains subroutinesolve. You should develop subroutine solve based on the aforementioned Newton's method. ▪ Function f(x) is x2-1 whose zero is known. Set the input argument EPSILON to 1.E-3 and inputargument n to 1000 when you call subroutine solve and run the program Modify the function to one that is known not to have zeros; e.g. (x2+1)

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

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

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS