Applet DIViSION

-

 Apple divers program 


import java.awt.*;
import java.awt.event.*;
import javax.swing.*;
import java.applet.Applet;
/*<applet code="Divers.class"width=600 height=300>
</applet>*/
public class Divers extends Applet implements ActionListener 
{
    Label l1, l2, l3;
    TextField t1, t2, Result;
    Button b1;
    public void init()
     {
        l1 = new Label("Enter first num");
        add(l1);
        t1 = new TextField(10);
        add(t1);

        l2 = new Label("Enter second num");
        add(l2);
        t2 = new TextField(10);
        add(t2);

        l3 = new Label("The result:");
        add(l3);
        Result = new TextField(10);
        add(Result);

        b1 = new Button("Divide");
        add(b1);

        b1.addActionListener(this);
    }

    public void actionPerformed(ActionEvent e) 
    {
        if (e.getSource() == b1) 
        {
            try {
                int value1 = Integer.parseInt(t1.getText());
                int value2 = Integer.parseInt(t2.getText());
                int res = value1 / value2;
                Result.setText(String.valueOf(res));
            } 
            catch (NumberFormatException nfe) 
            {
                JOptionPane.showMessageDialog(null, "Not a number");
            } catch (ArithmeticException ae) 
            {
                JOptionPane.showMessageDialog(null, "Arithmetic Exception");
}
}
}
}



output :


Comments

Post a Comment

Popular posts from this blog

SINGLE LINKED LIST by smd

-
#include <stdio.h> #include <stdlib.h> int count = 0; struct node {       int data;       struct node *next; }  *head = NULL, *newnode, *trav; void create_list() {       int value;       struct node *temp;       newnode = (struct node *)malloc(sizeof(struct node));       printf("Enter the value to be inserted: ");       scanf("%d", &value);       newnode->data = value;       newnode->next = NULL;       if (head == NULL) {           head = newnode;       } else {           temp = head;           while (temp->next != NULL)               temp = temp->next;           temp->next = newnode;       }       count++; } void insert_at_beg...
Read more

CLL by smd

-
PROGRAM #include <stdio.h> #include <stdlib.h> int count = 0; struct node {  int data; struct node *next; }; struct node *head = NULL, *newnode, *temp; void create_circle_linked_list(); void insert_at_begin(); void insert_at_end(); void insert_at_specific_point(); void delete_at_begin(); void delete_at_end(); void delete_at_specific_point(); void display(); void create_circle_linked_list()  {  int value; printf("Enter the value to be inserted: "); scanf("%d", &value); newnode = (struct node*)malloc(sizeof(struct node)); newnode->data = value; if (head == NULL)  {  head = newnode;  newnode->next = head;  } else  {  temp = head;  while (temp->next != head) temp = temp->next; temp->next = newnode; newnode->next = head;     }     count++; } void insert_at_begin()  { int value;  printf("Enter the value to be inserted: "); scanf("%d", &value); newnode = (struct node*)malloc(si...
Read more

QUEUE USING ARRAYS by smd

-
 #include<stdio.h> #define size 100 int queue[size]; int front = -1, rear = -1; void enqueue(int x)  {     if (rear == size - 1)      {         printf("Queue is overflow\n");     } else      {         if (front == -1)          {             front = 0; // Initialize front if queue was empty         }         rear++;         queue[rear] = x;         printf("%d inserted sucessfully\n", x);     } } void dequeue()  {     if (front == -1 || front > rear)      {         printf("Queue is underflow\n");     } else      {         printf("%d deleted successfully\n", queue[front]);         front++;         if (front ...
Read more