Simple equation solver in JS

By Sidharth Patnaik -
This post will let you create a simple equation solver. This program is designed using JS and HTML.
This equation solver can be used to solve addition, division, subtraction or multiplication between two numbers.

Screenshot

Things this code will do
  • Create a Form
  • Take Input from the user
  • A button when click, calls a function
  • Function determines which type of operation and appends the Answer.

 The Code
<!--The CSS For the Page-->
<style>
#ans
{
 position: relative;
    text-align: center;
    top: 200;
}
.form
{
 position: relative;
    text-align: -webkit-center;
    padding: 110;
}
.form input[type="text"]
{
 padding: 10 10 2 10;
    border-bottom: 2px;
    border-style: solid;
    border-left: none;
    border-top: none;
    border-right: none;
}
.form input:focus,button:focus{
    outline: 0;
}
.form button
{
 padding: 2;
    background-color: white;
    border-bottom-color: black;
    border-style: solid;
    border-left: none;
    border-right: none;
    border-top: none
}
</style>
<!--The CSS Ends-->
<!--The JS For the Page-->
<script>
function print()
{
 oForm = document.forms["solver"];
 pclass=document.getElementById("ans");
 var s=oForm.elements["f1"].value;
 var res="";
 if(s.indexOf('+') > -1)
 {
  var a,b;
  a=parseInt(s.substring(0,s.indexOf('+')));
  b=parseInt(s.substring(s.indexOf('+')+1,s.len));
  res=a+b;
 }
 else if(s.indexOf('-') > -1)
 {
  var a,b;
  a=parseInt(s.substring(0,s.indexOf('-')));
  b=parseInt(s.substring(s.indexOf('-')+1,s.len));
  res=a-b;
 }
 else if(s.indexOf('*') > -1)
 {
  var a,b;
  a=parseInt(s.substring(0,s.indexOf('*')));
  b=parseInt(s.substring(s.indexOf('*')+1,s.len));
  res=a*b;
 }
 else if(s.indexOf('/') > -1)
 {
  var a,b;
  a=parseInt(s.substring(0,s.indexOf('/')));
  b=parseInt(s.substring(s.indexOf('/')+1,s.len));
  res=a/b;
 }
 else
 {
  alert("Please input a [+|-|/|*] b format");
 }
 pclass.innerHTML=s+"="+res;
 //alert(s+"="+res);
 
}</script>
<!--The JS Ends-->
<!--The HTML For the Page-->
<p id="ans"></p>
<form name="solver" class="form" >
<input type="text" name="f1" id="txt_name" placeholder="Enter The Expression in a+b format." 
size="30" maxlength="70">
<button type="button" onclick="print()">Solve!</button>
</form>
<!--The HTML-->
Got anything to speak ?
Share them here !

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