Traffic lights

-

 file name :Traffic 



program :

import java.awt.*;

import javax.swing.*;

import java.awt.event.*;


class Traffic extends JFrame implements ActionListener {

    JLabel l1, l2, l3;

    JRadioButton r1, r2, r3;

    ButtonGroup bg;


    Traffic() {

        l1 = new JLabel(" ");

        l1.setBounds(50, 200, 200, 30);

        add(l1);

        l2 = new JLabel(" ");

        l2.setBounds(50, 240, 200, 30);

        add(l2);

        l3 = new JLabel(" ");

        l3.setBounds(50, 260, 200, 30);

        add(l3);

        r1 = new JRadioButton("RED");

        r1.setBounds(100, 60, 100, 30);

        r1.setBackground(Color.RED);

        r2 = new JRadioButton("YELLOW");

        r2.setBounds(100, 100, 100, 30);

        r2.setBackground(Color.YELLOW);

        r3 = new JRadioButton("GREEN");

        r3.setBounds(100, 160, 100, 30);

        r3.setBackground(Color.GREEN);

        bg = new ButtonGroup();

        bg.add(r1);

        bg.add(r2);

        bg.add(r3);

        add(r1);

        add(r2);

        add(r3);

        r1.addActionListener(this);

        r2.addActionListener(this);

        r3.addActionListener(this);

        setSize(400, 400);

        setTitle("TRAFFIC LIGHT");

        setLayout(null);

        setVisible(true);


    }


    public void actionPerformed(ActionEvent e) {

        if (e.getSource() == r1) {

            l1.setText("STOP");

            l1.setForeground(Color.RED);

        } else if (e.getSource() == r2) {

            l2.setText("GET READY");

            l2.setForeground(Color.YELLOW);

        } else if (e.getSource() == r3) {

            l3.setText("GO");

            l3.setForeground(Color.GREEN);

        }

    }


    public static void main(String[] args) {

        new Traffic();

    }

}





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