Skip to main content

Handling Mouse events

import java.applet.*;
import java.awt.event.*;
import java.awt.*;
/*<applet code="Appq2.class" height=600 width=600>
</applet>*/
public class Appq2 extends Applet implements MouseListener,KeyListener
{
 String msg="";
 int x,y;
 public void init()
 {
  addMouseListener(this);
  addKeyListener(this);
  requestFocus();
 }
 public void mouseClicked(MouseEvent me)
 {
  msg="mouseClicked";
  repaint();
 }
 public void mouseEntered(MouseEvent me)
 {
  showStatus("mouse entered");
 }
 public void mouseExited(MouseEvent me)
 {
  showStatus("mouse exited");
 }
 public void mousePressed(MouseEvent me)
 {
  msg="mouse pressed";
  repaint();
 }
 public void mouseReleased(MouseEvent me)
 {
  msg="mouse released";
  repaint();
 }
 public void keyPressed(KeyEvent ke)
 {
  showStatus("key pressed");
 }
 public void keyReleased(KeyEvent ke)
 {
  showStatus("key released");
 }
 public void keyTyped(KeyEvent ke)
 {
  msg="key typed is "+ke.getKeyChar();
  repaint();
 }
 public void paint(Graphics g)
 {
  g.drawString(msg,50,50);
 }
}

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