logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

univariate polynomial is a mathematical expression involving a sum of powers in one variable multiplied by coefficients.

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

COMP2101: Introduction to Computer Science Fall 2019

Problem definition:

A univariate polynomial is a mathematical expression involving a sum of powers in one variable multiplied by coefficients. A univariate polynomial with constant coefficients is given by

an x n + an−1 xn−1 + . . . + a2 x2 + a1 x + a0.

The highest power in a univariate polynomial is called its order, or sometimes its degree. For example, x7 – 4 x5 + 1 is a polynomial of degree 7, as 7 is the highest power of x.

In this assignment you are requested to design and implement a Python program that reads expressions and a set of x values from a text file called expressions.txt, determines whether the expression is a polynomial, finds the degree of the polynomial, and evaluates the expression for different values of x provided in the text file. For each expression, your program should first read the equation and check whether it is a polynomial equation or not. The expression is considered polynomial if it involves only sum of non-negative integer powers of x multiplied by integer coefficients. If the expression is a polynomial then you should store it as lists of coefficients and powers of x. Your program should then find the degree of the polynomial and for each value of x provided in the next line of the file evaluate the value of the polynomial f(x). Your program should also validate the values of x to be real numbers and count the number of invalid values

The exponents in the expressions are defined by the symbol ^ followed by the exponent (i.e. power) value as shown in Figure 1. For example, x5 – x4 + 4 x2 – 5 x – 13 would be written as x^5 – x^4 + 4 x^2 – 5 x – 13 in the text file expressions.txt.

Figure 1: First few lines of expressions.txt

Your program should:

  1. Use meaningful variable names, and meaningful comments to describe the solution.

  2. Read expressions and values of x from the file txt

  3. Use exceptions. At least one exception handling should be used in your program to check for file opening.

  4. Check whether the read expression is

  5. Validate the values of x to be real numbers

 

  1. Evaluate the polynomial for each valid value of x

  2. Use appropriate messages and a suitable output format to display the result (see program sample runs shown in Figure 2)

  3. Name the file containing your Python source code: HW4_SECxx_xxxxx.py; where xx and xxxxx are your SECTION and Student ID numbers. For example, a student with ID 75600 and section 20 should submit a file called py.

  4. Upload your Python program to Moodle by the

Grading Table:

Item

Mark

Part(i): (written as comments at the beginning of your program)

 

Your name, Id, section, purpose of program, and input/output data

/1

Algorithm

/3

Test plan

/2

Part(ii): Your Python Program

 

Comments

/1

Using proper variable naming (accordance to Python convention)

/1

File Operations (opening/closing, checking file error)

/2

Reading expressions into two lists: coefficients and powers

/3

Checking whether the expression is polynomial and giving appropriate message

/2

Finding the order of the polynomial

/1

Reading and validating the values of x

/2

Finding and giving appropriate message for any invalid x value

/1

Computing f(x) for each valid value of x

/2

Displaying the results properly

/2

Program runs without errors

/1

Proper Naming & Submission

/1

T O T A L

/25

 

(5/5)
Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

770 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

511 Answers

Hire Me
expert
Husnain SaeedComputer science

977 Answers

Hire Me
expert
Atharva PatilComputer science

734 Answers

Hire Me
April
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
30
31
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30