mulitiple layout

-

file name:BorderLayoutDemo


import java.awt.*;

import java.awt.event.*;


public class BorderLayoutDemo {

    BorderLayoutDemo() {

        Frame f = new Frame("Border Layout Example");

        f.setLayout(new java.awt.BorderLayout());


        Button b1 = new Button("North");

        Button b2 = new Button("South");

        Button b3 = new Button("East");

        Button b4 = new Button("West");

        Button b5 = new Button("Center");


        f.add(b1, java.awt.BorderLayout.NORTH);

        f.add(b2, java.awt.BorderLayout.SOUTH);

        f.add(b3, java.awt.BorderLayout.EAST);

        f.add(b4, java.awt.BorderLayout.WEST);

        f.add(b5, java.awt.BorderLayout.CENTER);

        f.setSize(400, 400);

        f.setVisible(true);

    }


    public static void main(String[] args) {

        new BorderLayoutDemo();

    }

}
















file name:FlowLayoutDemo



import java.awt.*;

import java.awt.event.*;

public class FlowLayoutDemo {

    FlowLayoutDemo() {

        Frame f = new Frame("Flow Layout Example");

        f.setLayout(new FlowLayout(FlowLayout.LEFT));


        Button b1 = new Button("Button 1");

        Button b2 = new Button("Button 2");

        Button b3 = new Button("Button 3");


        f.add(b1);

        f.add(b2);

        f.add(b3);

        f.setSize(400, 400);

        f.setVisible(true);

    }


    public static void main(String[] args) {

        new FlowLayoutDemo();

    }

}








 

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_begin () {     i...
Read more

CLL by smd

-
#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(sizeof(str...
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