Creating a Calculator panel using AWT in Java

By -
The Real power of java comes into the picture in AWT and Applet in java.
We can create a popup window and program it according to our use, just like real life applications in the computers.
It is a simple design of a calculator using AWT and Swing.

 Screenshots:

Calculator panel in ubuntu

Calculator panel in Windows

The Code:

import java.util.*;
import java.awt.*;
import javax.swing.*;

class calculator extends Frame
{
 Panel number,text_box,operation,buttons;
 JFrame cal;   /*Creating and object for JFrame*/
 
 /*Creating Buttons and TextBox  reference variables*/
 Button one,two,three,four,five,six,seven,eight,nine,zero,dot,plus,minus,mul,div,percentage,factorial,log,Ln,brac1,brac2;
 TextField box;

 public calculator()
 {
  /*Configuring frame of the window and Heading, Layout, close button action*/
  cal = new JFrame();
  cal.setTitle("CALCULATOR");  /*Title of the window*/
  cal.setSize(500,500);  /*size of the window in pixels*/
  cal.setLayout(new FlowLayout());
  cal.setVisible(true);  /*objects are vigible on the window*/
  cal.setLocationRelativeTo(null);
  cal.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);  /*window closes on clicking the close button*/
  cal.setLayout(new GridLayout(2,1));  /*Row=2 column=1*/

  /*Setting the panels*/
  number = new Panel(); /*number panel*/
  number.setLayout(new GridLayout(4,3));  /*Row=4 and Colomn=3*/
  //number.setBackground(Color.BLUE);  /*Optional color*/
  text_box = new Panel();  /*textbox panel*/
  operation = new Panel();  /*operator panel*/
  operation.setLayout(new GridLayout(4,3)); /*Row=4 clomn=3*/
  buttons = new Panel(); /*button panel*/
  buttons.setLayout(new GridLayout(1,2));  
  
  /*assigning name on the buttons*/
  box = new TextField(50);
  one = new Button("1");
  two = new Button("2");
  three = new Button("3");
  four = new Button("4");
  five = new Button("5");
  six = new Button("6");
  seven = new Button("7");
  eight = new Button("8");
  nine = new Button("9");
  zero = new Button("0");
  dot = new Button(".");
  plus = new Button("+");
  minus = new Button("_");
  mul = new Button("X");
  div = new Button("/");
  percentage = new Button("%");
  factorial = new Button("x!");
  log = new Button("log(");
  Ln = new Button("Ln(");
  brac1 = new Button("(");
  brac2 = new Button(")");
  
  /*adding buttons on the screen*/
  text_box.add(box);
  number.add(one);
  number.add(two);
  number.add(three);
  number.add(four);
  number.add(five);
  number.add(six);
  number.add(seven);
  number.add(eight);
  number.add(nine);
  number.add(zero);
  
  operation.add(plus);
  operation.add(minus);
  operation.add(mul);
  operation.add(div);
  operation.add(percentage);
  operation.add(factorial);
  operation.add(log);
  operation.add(Ln);
  operation.add(brac1);
  operation.add(brac2);

  cal.add(text_box);
  buttons.add(number);
  buttons.add(operation);
  cal.add(buttons);
 }

 public static void main(String arg[])
 {
  new calculator();  //invoking the default constructor of the class
 }
}

/***********Tejeswar Tripathy******** https://www.dProBuk.com************/

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

Hackerrank Fibonacci Modified Recursive Solution

By Sidharth Patnaik -
Image
This is the solution for the Fibonacci Modified Problem found under the dynamic programming section at hackerrank. You need to find the (n+k)th term of the generated series, where nth and (n+1)th term will be supplied as input. The nth and (n+1)th terms, the (n+2)th can be computed by the following relation : Tn+2 = (Tn+1)2 + Tn So, if the first two terms of the series are 0 and 1 and k is 5 then the third term = 1 2 + 0 = 1 fourth term = 1 2 + 1 = 2 fifth term = 2 2 + 1 = 5 Screenshots[Demo] The Code def fibo(a,b,n): if(n==0): return b; else: return fibo(b,b**2+a,n-1) x=raw_input() x=x.split() print fibo(int(x[0]),int(x[1]),int(x[2])-2) Found Bugs, feel free to report them !
Read more