Find the roots of a given polynomial

By Sidharth Patnaik -
This is a program which finds the roots of a given polynomian in the form of ax2+bx+c, where a, b and c are the inputs given by the user. In this program there is a method check() which checks if the value of the discrimainate is a positive number, if it is positive then we will get real roots. This progam is designed using Java.

import java.util.Scanner;
class poly
{
  int a,b,c;
  double s1,s2,d;
  poly()
  {
    a=b=c=0;
    s1=s2=d=0.0;
  }
  void getit()
  {
    Scanner s=new Scanner (System.in);
    a=s.nextInt();
    b=s.nextInt();
    c=s.nextInt();
  }
  boolean check()
  {
    d=(b*b)-(4.0*a*c);
    if(d>=0.0)
      return true;
    else 
      return false;
  }
  boolean calc()
  {
    
    if(check())
    {
      s1=((-b)+(Math.sqrt(d)))/(2.0*a);
      s2=((-b)-(Math.sqrt(d)))/(2.0*a);
      return true;
    }
    else 
      return false;
  }
  void disp()
  {
    if(calc())
      System.out.println("The Roots are: s1: "+s1+", "+s2);
    else
      System.out.println("The Roots are not Real.");
  }
}
class mainDriver
{
  public static void main(String []args)
  {
    poly p =new poly();
    p.getit();
    p.disp();
  }
}

Description:
In the class poly, getit() method is used to assign the values to a,b, and c. The ckech() confirms whether the discriminate is a positive or a negative, the calc() calculates the value of the roots based on the getit() return value. further the calc() drives the disp() method which prints the result.

Comments

Post a Comment

Popular posts from this blog

Non Restoring Division Algorithm Implementation in C

By Sidharth Patnaik -
Image
This  is a Dynamic program for the implementation of the NON RESTORING Division Algorithm in C Language. Non Restoring Division uses Left Shift Operations, Twos' Compliment and Binary Addition. Screenshots[Demo] The Code #include<stdio.h> #include<malloc.h> int *a,*q,*m,*mc,*c,n,d; int powr(int x,int y) { int s=1,i; for(i=0;i<y;i++) s=s*x; return s; } void print(int arr[],int n) { int i; for(i=0;i<n;i++) printf("%d ",arr[i]); } void bin(int n, int arr[]){ int r, i = 0; do{ r = n % 2; n /= 2; arr[i] = r; i++; }while(n > 0); } void set(int array[], int x){ int i,tmp[20]={0}; for(i = x -1; i >=0; i--) tmp[x-1-i]=array[i]; for(i=0;i<x;i++) array[i]=tmp[i]; } int len(int x) { int i=0; while(powr(2,i)<=x) i++; return ++i; } void addBinary(int a1[], int a2[]) { int bi[2]={0},ca[20]={0}; int t=len(n),tmp=0; int *su=(int*)malloc(sizeof(int)*len(n)); while(t...
Read more

Hackerrank String Reduction Solution

By Sidharth Patnaik -
Image
This is the solution to the program, solved in python. The Question can be found in the Algorithm domain of Hackerrank. Problem Statement: Given a string consisting of letters, a, b and c, we can perform the following operation: Take any two adjacent distinct characters and replace them with the third character. For example, if 'a' and 'c' are adjacent, they can replaced by 'b'. Find the smallest string which we can obtain by applying this operation repeatedly? Screenshots[Demo] The Code: def cnt(x): m={} m['a']=0;m['b']=0;m['c']=0 for c in x: if c not in m: m[c]=1 else: m[c]+=1 return m def red(x): xm=cnt(x) print x,xm if((xm['a']==0 and xm['b']==0 ) or (xm['a']==0 and xm['c']==0 ) or (xm['b']==0 and xm['c']==0)): return len(x); if((xm['a']%2==0 and xm['b']%2==0 and xm['c']%2==0) or (...
Read more

Bit Stuffing Code Implementation in Java

By -
Image
This is an implementation of the Bit Stuffing popularly used in data communication, also known as one of the concepts of Framing data bits. To know more please  click here. Sample Output: This is a sample output with data binary data entered as 11001111110. Program Code: import java.util.*; public class BitStuffing { public static void main(String[] args) { System.out.print("Enter the Binary message: "); Scanner sn=new Scanner(System.in); String data = sn.nextLine(); String res = new String(); String out=new String(); int counter = 0; for(int i=0;i<data.length();i++) { if (data.charAt(i)!='1' && data.charAt(i)!='0') { System.out.println("Enter only Binary values!!!"); return; } ...
Read more