Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

I NEED THE CDOE BY USING C++ 3. ADT array-based polynomials a. Input/output Input: (1) The degree of the polynomial (the highest degree of all

I NEED THE CDOE BY USING C++

image text in transcribed

3. ADT array-based polynomials a. Input/output Input: (1) The degree of the polynomial (the highest degree of all the terms in the polynomial) (2) The coefficient for each term from the highest degree to the lowest degree Output: Print out the polynomial. e.g.: if user enters 3 for the degree of the polynomial and enters 7,0, 9, 10 for each term from the highest degree to the lowest degree, then the output will be: 7x^3+9x+10 b. Evaluation Once the polynomial has been entered by the user, prompt the user to enter the value of x and evaluate the polynomial and print out the value of the polynomial. e.g. if user enter 2 for the value of x (that is, x=1), then you evaluate the polynomial as 7*2^3+9*2+10=84 and you print out the value of the polynomial is 84. c. Add two polynomials. Prompt the user to enter two polynomials (as above in step a), then add these two polynomials and print out the result. e.g.: for the first polynomial, the user enters 3 for the degree of the polynomial and enters 7,0, 9, 10 for each term from the highest degree to the lowest degree; for the second polynomial, the user enters 2 for the degree of the polynomial and enters 1, 2, 3 for each term from the highest degree to the lowest degree, then you have: 1st polynomial: 7x^3+9x+10 2nd polynomial: x^2+2x+3 After you add these two polynomials: your have 7x^3+x^2+11x+13

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Expert Performance Indexing In SQL Server

Authors: Jason Strate, Grant Fritchey

2nd Edition

1484211189, 9781484211182

More Books

Students also viewed these Databases questions

Question

600 lb 20 0.5 ft 30 30 5 ft

Answered: 1 week ago