How to make calculator in Java | Using Applet |

How to make calculator in Java | Using Applet | 

Program to make a calculator using applet :

import java.awt.*;

import java.awt.event.*;

import java.applet.*;

/* 

<applet code="Cal" width=300 height=300>

</applet>

*/

public class Cal extends Applet

implements ActionListener

{

String msg=" ";

int v1,v2,result;

TextField t1;

Button b[]=new Button[10];

Button add,sub,mul,div,clear,mod,EQ;

char OP;

public void init()

{

Color k=new Color(120,89,90);

setBackground(k);

t1=new TextField(50);

GridLayout gl=new GridLayout(4,5);

setLayout(gl);

for(int i=0;i<10;i++)

{

b[i]=new Button(""+i);

}

add=new Button("add");

sub=new Button("sub");

mul=new Button("mul");

div=new Button("div");

mod=new Button("mod");

clear=new Button("clear");

EQ=new Button("EQ");

t1.addActionListener(this);

add(t1);

for(int i=0;i<10;i++)

{

add(b[i]);

}

add(add);

add(sub);

add(mul);

add(div);

add(mod);

add(clear);

add(EQ);

for(int i=0;i<10;i++)

{

b[i].addActionListener(this);

}

add.addActionListener(this);

sub.addActionListener(this);

mul.addActionListener(this);

div.addActionListener(this);

mod.addActionListener(this);

clear.addActionListener(this);

EQ.addActionListener(this);

}

public void actionPerformed(ActionEvent ae)

{

String str=ae.getActionCommand();

char ch=str.charAt(0);

if ( Character.isDigit(ch))

t1.setText(t1.getText()+str);

else

if(str.equals("add"))

{

v1=Integer.parseInt(t1.getText());

OP='+';

t1.setText("");

}

else if(str.equals("sub"))

{

v1=Integer.parseInt(t1.getText());

OP='-';

t1.setText("");

}

else if(str.equals("mul"))

{

v1=Integer.parseInt(t1.getText());

OP='*';

t1.setText("");

}

else if(str.equals("div"))

{

v1=Integer.parseInt(t1.getText());

OP='/';

t1.setText("");

}

else if(str.equals("mod"))

{

v1=Integer.parseInt(t1.getText());

OP='%';

t1.setText("");

}

if(str.equals("EQ"))

{

v2=Integer.parseInt(t1.getText());

if(OP=='+')

result=v1+v2;

else if(OP=='-')

result=v1-v2;

else if(OP=='*')

result=v1*v2;

else if(OP=='/')

result=v1/v2;

else if(OP=='%')

result=v1%v2;

t1.setText(""+result);

}

if(str.equals("clear"))

{

t1.setText("");

}

}

}

After writing this code in your text editor save it as .java file and do following :

Open your cmd[command prompt] and do following after changing your folder where your file is:

• compile using command : java.c Cal.java [hit enter]
• run program using command : appletviewer Cal.java [hit enter]

C Program to print table of any number

Let's start coding:

//Program to print table of any number

#include<stdio.h>
#include<conio.h>

void main()
{
int i,no,table=1;
clrscr();
printf("Enter any number : ");
scanf("%d",&no);
printf("Table of  %d \n",no);
for(i=1;i<=10;i++)
{
table=no*i;
printf("%d",table);
printf("\n");
}
getch();
}

Output
Enter any number : 
Table of 7
7
14
21
28
35
42
49
56
63
70

BIG DISCOUNT

Click Here!

Complete Linked list Insertion Program Very Easy

/ A complete working C program to demonstrate all insertion methods

// on Linked List




#include <stdio.h>

#include <stdlib.h>

 

// A linked list node

struct Node

{

  int data;

  struct Node *next;

};

 

/* Given a reference (pointer to pointer) to the head of a list and

   an int, inserts a new node on the front of the list. */

void push(struct Node** head_ref, int new_data)

{

    /* 1. allocate node */

    struct Node* new_node = (struct Node*) malloc(sizeof(struct Node));

 

    /* 2. put in the data  */

    new_node->data  = new_data;

 

    /* 3. Make next of new node as head */

    new_node->next = (*head_ref);

 

    /* 4. move the head to point to the new node */

    (*head_ref)    = new_node;

}

 

/* Given a node prev_node, insert a new node after the given

   prev_node */

void insertAfter(struct Node* prev_node, int new_data)

{

    /*1. check if the given prev_node is NULL */

    if (prev_node == NULL)

    {

      printf("the given previous node cannot be NULL");

      return;

    }

 

    /* 2. allocate new node */

    struct Node* new_node =(struct Node*) malloc(sizeof(struct Node));

 

    /* 3. put in the data  */

    new_node->data  = new_data;

 

    /* 4. Make next of new node as next of prev_node */

    new_node->next = prev_node->next;

 

    /* 5. move the next of prev_node as new_node */

    prev_node->next = new_node;

}

 

/* Given a reference (pointer to pointer) to the head

   of a list and an int, appends a new node at the end  */

void append(struct Node** head_ref, int new_data)

{

    /* 1. allocate node */

    struct Node* new_node = (struct Node*) malloc(sizeof(struct Node));

 

    struct Node *last = *head_ref;  /* used in step 5*/

 

    /* 2. put in the data  */

    new_node->data  = new_data;

 

    /* 3. This new node is going to be the last node, so make next of

          it as NULL*/

    new_node->next = NULL;

 

    /* 4. If the Linked List is empty, then make the new node as head */

    if (*head_ref == NULL)

    {

       *head_ref = new_node;

       return;

    }

 

    /* 5. Else traverse till the last node */

    while (last->next != NULL)

        last = last->next;

 

    /* 6. Change the next of last node */

    last->next = new_node;

    return;

}

 

// This function prints contents of linked list starting from head

void printList(struct Node *node)

{

  while (node != NULL)

  {

     printf(" %d ", node->data);

     node = node->next;

  }

}

 

/* Driver program to test above functions*/

int main()

{

  /* Start with the empty list */

  struct Node* head = NULL;

 

  // Insert 6.  So linked list becomes 6->NULL

  append(&head, 6);

 

  // Insert 7 at the beginning. So linked list becomes 7->6->NULL

  push(&head, 7);

 

  // Insert 1 at the beginning. So linked list becomes 1->7->6->NULL

  push(&head, 1);

 

  // Insert 4 at the end. So linked list becomes 1->7->6->4->NULL

  append(&head, 4);

 

  // Insert 8, after 7. So linked list becomes 1->7->8->6->4->NULL

  insertAfter(head->next, 8);

 

  printf("\n Created Linked list is: ");

  printList(head);

 

  return 0;