Question

Given two polynomials equation, write a function that adds and multiply the given two polynomials.

It adds and multiply  the two equations which are in standard form and return them in the sum poly which also be in standard form.

Write one add method and one multiply method.

public class pll {

public static void main(String argc[]) {

PLL ans_sum,ans_mul;

PLL p1 = new PLL(4, 2);

PLL p2 = new PLL(6, 5);

p3 = p1.add(p2);

p1 = new PLL(2, 4);

p2 = new PLL(5, 6);

p4 = p1.add(p2);

ans_sum = p3.add(p4);

ans_mul = p3.multiply(p4);

ans_sum.print();

ans_mul.print();

p1.print();

p2.print();

}

}

class PLL {

private static class Node {

private int coefficient;

private int exponent;

private Node next;

public Node(int coe, int exp) {

this(coe, exp, null);

}

public Node(int coe, int exp, Node n) {

coefficient = coe;

exponent = exp;

next = n;

}

public void setCoefficient(int coe) {

coefficient = coe;

}

public void setExponent(int exp) {

exponent = exp;

}

public void setNext(Node n) {

next = n;

}

public int getCoefficient() {

return coefficient;

}

public int getExponent() {

return exponent;

}

public Node getNext() {

return next;

}

}

private Node first;

private Node last;

public PLL() {

first = last = null;

}

public PLL(int c, int e) {

Node tempn = new Node(c, e);

first = last = tempn;

}

public void print() {

if (first == null) {

System.out.println();

return;

}

Node temp = first;

String ans = "";

while (temp != null) {

if (temp.getCoefficient() > 0) {

if (temp != first) ans = ans + " + ";

ans = ans + temp.getCoefficient();

} else if (temp.getCoefficient() < 0) ans = ans + " - " + temp.getCoefficient() * -1;

if (temp.getExponent() != 0) {

ans = ans + "X^" + temp.getExponent();

}

temp = temp.getNext();

}

System.out.println(ans);

}

}

Answer 1

Code:

// Java program to add two polynomials
  
class Main {
  
// A utility function to return maximum of two integers
static int max(int m, int n) {
return (m > n) ? m : n;
}
  
// A[] represents coefficients of first polynomial
// B[] represents coefficients of second polynomial
// m and n are sizes of A[] and B[] respectively
static int[] add(int A[], int B[], int m, int n) {
int size = max(m, n);
int sum[] = new int[size];
  
// Initialize the porduct polynomial
for (int i = 0; i < m; i++) {
sum[i] = A[i];
}
  
// Take ever term of first polynomial
for (int i = 0; i < n; i++) {
sum[i] += B[i];
}
  
return sum;
}
  
// A[] represents coefficients
// of first polynomial
// B[] represents coefficients
// of second polynomial
// m and n are sizes of A[] and B[] respectively
static int[] multiply(int A[], int B[],
int m, int n)
{
int[] prod = new int[m + n - 1];
  
// Initialize the porduct polynomial
for (int i = 0; i < m + n - 1; i++)
{
prod[i] = 0;
}
  
// Multiply two polynomials term by term
// Take ever term of first polynomial
for (int i = 0; i < m; i++)
{
// Multiply the current term of first polynomial
// with every term of second polynomial.
for (int j = 0; j < n; j++)
{
prod[i + j] += A[i] * B[j];
}
}
  
return prod;
}
  
// A utility function to print a polynomial
static void printPoly(int poly[], int n) {
for (int i = 0; i < n; i++) {
System.out.print(poly[i]);
if (i != 0) {
System.out.print("x^" + i);
}
if (i != n - 1) {
System.out.print(" + ");
}
}
}
  
// Driver program to test above functions
public static void main(String[] args) {
// The following array represents polynomial 5 + 10x^2 + 6x^3
int A[] = {5, 0, 10, 6};
  
// The following array represents polynomial 1 + 2x + 4x^2
int B[] = {1, 2, 4};
int m = A.length;
int n = B.length;
  
// print The First polynomial Equation
System.out.println("First polynomial is:");
printPoly(A, m);
  
// print The Second polynomial Equation
System.out.println("\nSecond polynomial is:");
printPoly(B, n);
  
// print The Sum of polynomial Equations
int sum[] = add(A, B, m, n);
int size = max(m, n);
System.out.println("\nSum of polynomials is:");
printPoly(sum, size);
  
// print The Product of polynomial Equations
int[] prod = multiply(A, B, m, n);
System.out.println("\nProduct of polynomials is:");
printPoly(prod, m + n - 1);
  
}
}

Code Screenshots:

Output Screenshot:

Note: Please consider my work and give up vote.