Java

import java.util.*;

public class Driver 
{
	public static void main(String[] args) 
	{
		
		Scanner input = new Scanner(System.in);

		Polynomial[] poly = new Polynomial[8];
		int[] tmp = new int[5];
		// Number for 0
		System.out.println("Enter a polynomial");
		for(int i=0; i<5;i++) 
		{
		  System.out.print("Coefficient for X^" + i + ": ");
		  int coeff = input.nextInt();
		  tmp[i] = coeff;
		}
		
		
		poly[0] = new Polynomial(tmp[0], tmp[1], tmp[2], tmp[3], tmp[4]);
		
		// Number for 1
		System.out.println("Enter a polynomial");
		for(int i=0; i<5;i++) 
		{
		  System.out.print("Coefficient for X^" + i + ": ");
		  int coeff = input.nextInt();
		  tmp[i] = coeff;
		}
		
		poly[1] = new Polynomial(tmp[0], tmp[1], tmp[2], tmp[3], tmp[4]);
		
		Random obj= new Random();
		// Random numbers 0-100 for 2
		for(int i=0; i<5;i++) 
		{
		  int coeff = obj.nextInt(100);
		  tmp[i] = coeff;
		}
		
		poly[2] = new Polynomial(tmp[0], tmp[1], tmp[2], tmp[3], tmp[4]);
		
		
		// Random numbers 0-100 for 3
		for(int i=0; i<5;i++) 
		{
		  int coeff = obj.nextInt(100);
		  tmp[i] = coeff;
		}
		
		poly[3] = new Polynomial(tmp[0], tmp[1], tmp[2], tmp[3], tmp[4]);
		
		
		// Random numbers 0-100 for 4
		for(int i=0; i<5;i++) 
		{
		  int coeff = obj.nextInt(100);
		  tmp[i] = coeff;
		}
		
		poly[4] = new Polynomial(tmp[0], tmp[1], tmp[2], tmp[3], tmp[4]);
		
		poly[5] = new Polynomial(poly[0].add(poly[2]));
		
		poly[7] = new Polynomial(poly[4].derive());	// the exponent should be -1 	
		
		System.out.print("Enter a double value for X: ");
		double x = input.nextDouble();
		
		poly[6] = new Polynomial(poly[1]); // has to be multiplied by 3
		
		System.out.println("Polynomial 0 : " + poly[0] + " has " + poly[0].numberOfTerms() + " terms and evaluates to " + poly[0].evaluate(x) + " for x = " + x);
		System.out.println("Polynomial 1 : " + poly[1] + " has " + poly[1].numberOfTerms() + " terms and evaluates to " + poly[1].evaluate(x) + " for x = " + x);
		System.out.println("Polynomial 2 : " + poly[2] + " has " + poly[2].numberOfTerms() + " terms and evaluates to " + poly[2].evaluate(x) + " for x = " + x);
		System.out.println("Polynomial 3 : " + poly[3] + " has " + poly[3].numberOfTerms() + " terms and evaluates to " + poly[3].evaluate(x) + " for x = " + x);
		System.out.println("Polynomial 4 : " + poly[4] + " has " + poly[4].numberOfTerms() + " terms and evaluates to " + poly[4].evaluate(x) + " for x = " + x);
		System.out.println("Polynomial 5 : " + poly[5] + " has " + poly[5].numberOfTerms() + " terms and evaluates to " + poly[5].evaluate(x) + " for x = " + x);
		System.out.println("Polynomial 6 : " + poly[6] + " has " + poly[6].numberOfTerms() + " terms and evaluates to " + poly[6].evaluate(x) + " for x = " + x);
		System.out.println("Polynomial 7 : " + poly[7] + " has " + poly[7].numberOfTerms() + " terms and evaluates to " + poly[7].evaluate(x) + " for x = " + x);
		
		

	}

}

public class Polynomial
{
	private int[] coeff = new int[5];
	public Polynomial()
	{
		coeff[0] = 0;
		coeff[1] = 0;
		coeff[2] = 0;
		coeff[3] = 0;
		coeff[4] = 0;
	}
	// constructor with 5 parameter 
	public Polynomial(int c0, int c1, int c2, int c3, int c4)
	{
		this.coeff[0] = c4;
		this.coeff[1] = c3;
		this.coeff[2] = c2;
		this.coeff[3] = c1;
		this.coeff[4] = c0;
	}
	// copy constructor  
	public Polynomial(Polynomial p)
	{
	    coeff = (int[])p.coeff.clone();
	 
	}
	
	// Get Method
	public int getCoeff(int i)
	{
		return this.coeff[i];
	}
	
	// Set Method
	public boolean setCoef(int pos, int num)
	{
		if (pos <= 4 || pos >= 0 )
			{
			coeff[pos] = num;
			return true;
			}
		else
			return false;
	}

	// toString
	public String toString() 
	{
		return coeff[4] + "X^4 + " +
	        coeff[3] + "X^3 + " +
	        coeff[2] + "X^2 + " +
	        coeff[1] + "X + " + coeff[0];
	}
	
	// Equals
	public boolean equals(Polynomial p)
	{
		if ((p.coeff[4] != coeff[4]) ||(p.coeff[3] != coeff[3]) ||(p.coeff[2] != coeff[2]) ||(p.coeff[1] != coeff[1]) ||(p.coeff[0] != coeff[0]) )
			return false;
		return true;
	}
	
	// Add
	public Polynomial add(Polynomial p)
	{
		return (new Polynomial(p.coeff[4]+coeff[4],p.coeff[3]+coeff[3],p.coeff[2]+coeff[2],p.coeff[1]+coeff[1],p.coeff[0]+coeff[0]));
	}

	// Derivative
	public Polynomial derive()
	{
		return (new Polynomial(coeff[4]*4,coeff[3]*3,coeff[2]*2,coeff[1],0));
	}

	// Evaluate
	public double evaluate(double x)
	{
	    return (coeff[4] * x*x*x*x) +
	        (coeff[3] * x*x*x) +
	        (coeff[2] * x*x) +
	        (coeff[1] * x) +
	        coeff[0];
	}
	
	public int numberOfTerms()
	{
		int n = 0;
		if (coeff[4] != 0)
			n +=1;
		if (coeff[3] != 0)
			n +=1;
		if (coeff[2] != 0)
			n +=1;
		if (coeff[1] != 0)
			n +=1;
		if (coeff[0] != 0)
			n +=1;
		return n;
	}

}

public class Polynomial
{
	private int[] coeff = new int[5];
	public Polynomial()
	{
		coeff = null;
	}
	// constructor with 5 parameter 
	public Polynomial(int c0, int c1, int c2, int c3, int c4)
	{
		this.coeff[0] = c4;
		this.coeff[1] = c3;
		this.coeff[2] = c2;
		this.coeff[3] = c1;
		this.coeff[4] = c0;
	}
	// copy constructor  
	public Polynomial(Polynomial p)
	{
		coeff = p.coeff;

	}
	
	// Get Method
	public int getCoeff(int i)
	{
		return this.coeff[i];
	}
	
	// Set Method
	public boolean setCoef(int pos, int num)
	{
		if (pos <= 4 || pos >= 0 )
			{
			coeff[pos] = num;
			return true;
			}
		else
			return false;
	}

	// toString
	public String toString()
	{
		return coeff[4]+"X4"+" + "+coeff[3]+"X3"+" + "+coeff[2]+"X2"+" + "+coeff[1]+"X"+" + "+coeff[0];
	}
	
	// Equals
	public boolean equals(Polynomial p)
	{
		if ((p.coeff[4] != coeff[4]) ||(p.coeff[3] != coeff[3]) ||(p.coeff[2] != coeff[2]) ||(p.coeff[1] != coeff[1]) ||(p.coeff[0] != coeff[0]) )
			return false;
		return true;
	}
	
	// Add
	public Polynomial add(Polynomial p)
	{
		return (new Polynomial(p.coeff[4]+coeff[4],p.coeff[3]+coeff[3],p.coeff[2]+coeff[2],p.coeff[1]+coeff[1],p.coeff[0]+coeff[0]));
	}

	// Derivative
	public Polynomial derive()
	{
		return (new Polynomial(coeff[4]*4,coeff[3]*3,coeff[2]*2,coeff[1],0));
	}

	// Evaluate
	public double evaluate(double x){
		return coeff[4]*x*x*x*x+coeff[3]*x*x*x+coeff[2]*x*x+coeff[1]*x+coeff[0];
	}

}