469,943 Members | 2,524 Online
Bytes | Developer Community
New Post

Home Posts Topics Members FAQ

Post your question to a community of 469,943 developers. It's quick & easy.

urgent .. plz

5
^_^ Hiiiiiiiiii all

i'm a new member here ... hope to help me in me task !!

i 've a challenge with my friend . in how solving this problem

we may be new students with oop .. but we r working hard as possible as we can ^_^

any way ,, this is the problem ,, have alook at it and try to help me in sloving it ,, ok :)

i have to creat a class in a name of ploynomial with the following steps ..

Class Polynomials should contain the following member functions:
1.A default constructor, that creates an empty polynomial object.
2.A parameterized constructor, that accepts as input an array of terms and the size that indicates the number of the terms. Each term consists of a coefficient and an exponent.
3.A destructor that free all the space that has been allocated dynamically for the object.
4.getDegree() that returns the degree of the polynomial. The degree of a polynomial is defined as the largest power in the list of terms. (ex: p(x)= 1+2x +15x2 +3 x6 has a degree of 6)
5.getCoefficient(d) that returns the coefficient of the term with degree d.
6.getValue(x) that returns the value of the polynomial at x
For example value of p(x)= 1+2x +15x2 +3 x6 at x=1 is p(1)=21.
7.print() that displays on the screen the polynomial according to the following format.
P(x)= 1 + 2x + 15X2 + 3 x6 should be displayed as 1 + 2 X + 15 X**2 + 3 X**6.
8.Operator + that that returns a new polynomial that contains self + argument.
9.Operator that returns a new polynomial that contains self - argument.
10.Operator = that assigns a polynomial to self.


waiting u today or tommorow .. plz

if u want to contact me this is my mail ..
broken.soul294@hotmail.com

regards
Nov 22 '06 #1
6 1084
Hope
5
!!!!!!!!!! waiting u plz
Nov 22 '06 #2
AricC
1,892 Expert 1GB
Do you have anything written for this? You'll find people are more likely to help if you have written some of the code yourself, then ask for some guidance.
Nov 22 '06 #3
nickyeng
254 100+
Hi Hope,

your trick with saying you "challenge" your friends in solving the task(so-called questionS)...

we knew the trick okay.

:D

so, why not you do your some own code, and then post it to let members here give you some comment or advice.

People here are quite nice to help you, but not without you having try the code.
Nov 22 '06 #4
jacoder
13
Hi Hope,

your trick with saying you "challenge" your friends in solving the task(so-called questionS)...

we knew the trick okay.

:D

so, why not you do your some own code, and then post it to let members here give you some comment or advice.

People here are quite nice to help you, but not without you having try the code.
yeah thats gotta be one of the lam3st things ive heard ("what a challenge") lol :P
Nov 23 '06 #5
jacoder
13
Hi Hope,

your trick with saying you "challenge" your friends in solving the task(so-called questionS)...

we knew the trick okay.

:D

so, why not you do your some own code, and then post it to let members here give you some comment or advice.

People here are quite nice to help you, but not without you having try the code.
thats lame *you havnt even posted a single line of code* & im no where nr good coder yet but i try (make sumthing code sumthing you might actually like it)
Nov 23 '06 #6
Hope
5
Really !!

oh thanks .. ur so kind ..

any way i'm already have my own code but with some errors
and i will c my friend today to see what did she do with the same task ..

thanks all
Nov 24 '06 #7

Post your reply

Sign in to post your reply or Sign up for a free account.

Similar topics

9 posts views Thread by Stefan Bauer | last post: by
28 posts views Thread by Tamir Khason | last post: by
16 posts views Thread by | last post: by
7 posts views Thread by zeyais | last post: by
33 posts views Thread by dembla | last post: by
8 posts views Thread by ginnisharma1 | last post: by
3 posts views Thread by N. Spiker | last post: by
By using this site, you agree to our Privacy Policy and Terms of Use.