Skip to main content

To Perform Integer Divisions

import java.applet.*;
import java.awt.event.*;
import java.awt.*;
/*<applet code="App8.class" height=600 width=600>
</applet>*/
public class App8 extends Applet implements ActionListener
{
 TextField t1,t2,t3;
 Button b;
 Label l1,l2,l3;
 int res;
 public void init()
 {
  t1=new TextField(5);
  t2=new TextField(5);
  t3=new TextField(15);
  b=new Button("divide");
  l1=new Label("Num1");
  l2=new Label("Num2");
  l3=new Label("Result");
  add(l1);
  add(t1);
  add(l2);
  add(t2);
  add(b);
  add(l3);
  add(t3);
  b.addActionListener(this);
 }
 public void actionPerformed(ActionEvent e)
 {
  try
  {
  int a=Integer.parseInt(t1.getText());
  int b=Integer.parseInt(t2.getText());
  res=a/b;
  t3.setText(""+res);
  }
  catch (NumberFormatException ne)
  {
   t3.setText("Number format exception");
  }
  catch(ArithmeticException ae)
  {
   t3.setText("arithmetic exception");
  }
  
 }
}

Comments

Popular posts from this blog

Find Value of S=ut+1/2*a*t**2.

PROCEDURE:-        1.enter values for u,a,t to find distance        2.find distance with the formulae ut+1/2at 2        3.print the above result CODE:- #include<stdio.h> #include<conio.h> void main() {   float u,t,a,S;   clrscr();   printf(“enter values u,t,a”);   scanf(“%f %f %f”, &u,&t,&a);   S=(u*t)+(0.5*a*t*t);   printf(“\n  S = %f”, S); } Input:- enter values u,t,a               U=10,t=4,a=4.9 Output:- S =79.200

Check whether a given number is Fibonacci prime or not.

PROCEDURE:- 1.input an integer n 2. first check whether it is prime or not 3. if it prime check whether it is in the Fibonacci series 4.the above check can be made by generating series and comparing each number with n 5.if n is found in the series then n is Fibonacci prime 6.else it is not Fibonacci prime   CODE:- #include<stdio.h> void main(){ int n,i=2,k=0,a,b,i,m; printf(“enter the number”); scanf(“%d”,&n); while(i<=n/2) { if(n%i = = 0)   {     k=1; break;   } i++; } if(k!=1) { a=0; b=1; i=1; m=n; while(i<=m) {   c=a+b;    if(m= =c)     {      printf(“ %d is Fibonacci prime”,n);    break;     } a=b; b=c; i++; } if(m!=c) printf(“%d  Not Fibonacci prime”,n); } else printf(“not prime “); } Input:- enter the number  13 Output:- 13 is Fibonacci prime