Your program will manage polynoubls in three variables (x,y, and 2) wath nos-aero integer
coefficients, and nom-negatlve linteger exponents. Three variable polynoenials are of the following
fotwa: p(x,y,2)=c1xA1gm1CC1++c2xAgn3C2Cn whore ci bs eoeffickent, and Ai,Bi and Ci
reprosent the exponents of variables. To simplify the propect, we ouly deal with polynomials in the
above form, under the following lesumptions. 1. We aseume that every term in a polynomial
follows xy2 soppenee. We ouly deal with a term Lille 5x6v3y2, and we won't deal with a term libe 5
v3x6z2. 2. We asenme that a eocfficions ean only oceur at the boginuing of a term. We only deal
with a term like 6x5y4z5. We wou't deal with a torm libe 3x5,2y4z5. 3. We aosume that no term in
a polysomial contains division operator. We won't deal with a term like 4x3/(y7x5). 2 Requirements
2.1 Input Representation of Polymomials The purpoee of your program is to interact with users by
inserting, deloting, updaring, and seirehing named polysomiale. By following the assumptions
defised in Sretion 1, we can simplify how a polynomial can be input into the pfogram. In a
polynomial, each term is repeesested by 4 inteyers separated by commiss: - cocfticient - exposent
for varlable x - exposent for varlable is - exposent for variable 2 and multiple terms are separated
by space characters. Foe coample, if the polynomial is A=6x9y6y3+5x4y532.2 Output
Representation of Polynomials The program output of polysomials is similae to stabdard
mathematical form wirk sinplifications. Foe ecoumple, if the polynomial is B=2x3y7z2+x4z58y3z+9
its output slooud be: B=2(x3)(y7)(z2)+(x4)(z5)8(y3)(z)+9 To ensare eorrect output formats, please
attend to the following items 1. Phy attentioe to the usage of parenthesss in the above example. 2.
Phy attestioe to the spaers arousd operatoes in the above example. 3. If the coefficient of the first
term bi posirive, do not display the plus sign for the first term. For eximple, B=2(x3)(y7)(z2)+(x4)(z
5)8(y3)(z)+9 4. If the coefficient of a term is 0 , do bot display this term. An exceptiou be that if the
polynomial contuans no terue at all, displisy 0 . 5. If the cocfficient of a term bi 1 , do sot display
the costficient. The exception bs that if the exposests of x,y and 2 axe all 0 , and the eorffickest is
1,1 umast be disiayod for this terma. For eximple, B=2(x3)(y7)(z2)+(x4)(z5)8(y3)(z)+1 6. If the
exponsest of a nariable bs 0 , do not display thes variable. 7. If the exponsest of a nariable bi 1,
just display the vuriable itself, abd berp the parenthoses. 2.3 Polymomial Minnigement Operations
Your program must malustain a list of mamod polynomiabs. The makagement operations ane is
follows. INSERT lnsert a new polynoenial isto the list. If the Lnerst oporatioe is suecssfal, output
the polynoenial. The insort operatson can fall if there is alroady a polynomial in the list with the
snme mame. In the chese of in insertiou fallure, display the mossage POL.YMaMIAL kaes? AL
BEA.
Your program will manage polynoubls in three variables xy.pdf
1. Your program will manage polynoubls in three variables (x,y, and 2) wath nos-aero integer
coefficients, and nom-negatlve linteger exponents. Three variable polynoenials are of the following
fotwa: p(x,y,2)=c1xA1gm1CC1++c2xAgn3C2Cn whore ci bs eoeffickent, and Ai,Bi and Ci
reprosent the exponents of variables. To simplify the propect, we ouly deal with polynomials in the
above form, under the following lesumptions. 1. We aseume that every term in a polynomial
follows xy2 soppenee. We ouly deal with a term Lille 5x6v3y2, and we won't deal with a term libe 5
v3x6z2. 2. We asenme that a eocfficions ean only oceur at the boginuing of a term. We only deal
with a term like 6x5y4z5. We wou't deal with a torm libe 3x5,2y4z5. 3. We aosume that no term in
a polysomial contains division operator. We won't deal with a term like 4x3/(y7x5). 2 Requirements
2.1 Input Representation of Polymomials The purpoee of your program is to interact with users by
inserting, deloting, updaring, and seirehing named polysomiale. By following the assumptions
defised in Sretion 1, we can simplify how a polynomial can be input into the pfogram. In a
polynomial, each term is repeesested by 4 inteyers separated by commiss: - cocfticient - exposent
for varlable x - exposent for varlable is - exposent for variable 2 and multiple terms are separated
by space characters. Foe coample, if the polynomial is A=6x9y6y3+5x4y532.2 Output
Representation of Polynomials The program output of polysomials is similae to stabdard
mathematical form wirk sinplifications. Foe ecoumple, if the polynomial is B=2x3y7z2+x4z58y3z+9
its output slooud be: B=2(x3)(y7)(z2)+(x4)(z5)8(y3)(z)+9 To ensare eorrect output formats, please
attend to the following items 1. Phy attentioe to the usage of parenthesss in the above example. 2.
Phy attestioe to the spaers arousd operatoes in the above example. 3. If the coefficient of the first
term bi posirive, do not display the plus sign for the first term. For eximple, B=2(x3)(y7)(z2)+(x4)(z
5)8(y3)(z)+9 4. If the coefficient of a term is 0 , do bot display this term. An exceptiou be that if the
polynomial contuans no terue at all, displisy 0 . 5. If the cocfficient of a term bi 1 , do sot display
the costficient. The exception bs that if the exposests of x,y and 2 axe all 0 , and the eorffickest is
1,1 umast be disiayod for this terma. For eximple, B=2(x3)(y7)(z2)+(x4)(z5)8(y3)(z)+1 6. If the
exponsest of a nariable bs 0 , do not display thes variable. 7. If the exponsest of a nariable bi 1,
just display the vuriable itself, abd berp the parenthoses. 2.3 Polymomial Minnigement Operations
Your program must malustain a list of mamod polynomiabs. The makagement operations ane is
follows. INSERT lnsert a new polynoenial isto the list. If the Lnerst oporatioe is suecssfal, output
the polynoenial. The insort operatson can fall if there is alroady a polynomial in the list with the
snme mame. In the chese of in insertiou fallure, display the mossage POL.YMaMIAL kaes? AL
BEADY INGERTED. DELETE Dolete an existing namod polynowinl from the Lest. If the dobete
operation is sucececul, display the mossage POLYNDMIaL &maee> gUCcesgruL.Y DEI EIED. If
the maxnd polynomial does not exist, display the message FDCYvOMIAL nase? DDES WDT
EIIST. UPDATE Update an existing polyboenial in the list. If it is found in the list, the existing
polysomial is Eeplaced by the newly astenod one, and output the updated polysomial. If the
polynominl doss not exbst, display the mossage POLywaMIAL DaEg vor EXIST.SEAFCH Search
foe a namod polynoenial in the list. If is is fousd in the list, output the polynomial. If the polynomial
dors bot exist, display the mossage PGLYNDMIAL DOES NaT ExISI. QUIT This commasd males
the program properly exlt. The quit command should remone all the polysomials froen the list, and
then exdt the program. To review, the following eximples are peovided. INSERT & 3,2,0,05,1,1,08,
0,2,04,1,0,03,0,1,012,0,0,0 A=3(x2)+5(x)(y)8(y2)+4(x)3(y)+12 INBERT B 1,3,0,06,0,2,015,1,0,011,
2. 0,0,0 B=(x3)+6(y2)15(x)+11 INSERT & 2,1,0,03,0,1,05,0,0,0 PGLYNDMTAL. A ALREADY
INSERTED DELEIE B PaLYNDNIAL. B BUCCEsspulLY DEI BIDD DELEIE C PaLYokIaL, C
DAES NoI EXIST UPDAIE & 1,1,0,04,0,1,01,0,0,0 A=(x)4(y)+1 UPDAIE B 4,2,2,2 8,1,1,1 16,0,0,0
PaL. oMIAL. B DAES NoI EXIST BEARCH _ A=(x)4(y)+1 BEARCH B PaLYoMIAL. B DAES NoI
EXIST 3 Data Structures and Design 3.1 Term Class Each polynomial is compooed of many
polynomial torms. You are to create a Tera eloss that cely holds the information for a polyboenial
term. This class shoukd have necssary private fiduls fot a polynomial term (1 corfficient abd 3
exposents), proper construetors, getters, and atters. In iddition, the dass shoukd aloo override the
method tegtring(). It roturns a Btring, which slbows a polynowial term in proper format. 3.2 DLList
Class Use the inplemented pcisest eloss as deseribed in Projert 2. 3.3 Polynomial Class Bualding
up from the Tern dass and DLLiat class, Polyaoaial bs composed of two private folds! 1. The
bame of the polynoemial2. A doubly linkrd list of Terms. Polynealal clioss should have proper
constructors, getters, setters, sud other uscful methods if nexded. 3.4 PolyL.ist Class Building up
froen the Polyneeial elass and Du.iat dass, PolyLiat is a doubly linkod list of Polynemials. This
cloos shonld implement all the polysomial management oprations. 3.5 Project3 Class Ln this
project, Projeets cless should hasdle all the input from users. This eloss is also the entrance of the
program.
