0% found this document useful (0 votes)

7 views

java cseab lab manual (2)

The document outlines programming exercises for students at Siddhartha Institute of Technology & Sciences, focusing on Java applications. It includes tasks such as creating a simple calculator, an applet displaying messages, and computing factorials through user input. Each task is accompanied by sample code and expected outputs to guide students in their learning process.

Uploaded by

chindamkrishnaveni12345

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

7 views

java cseab lab manual (2)

Uploaded by

chindamkrishnaveni12345

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 52

SIDDHARTHA INSTITUTE OF TECHNOLOGY & SCIENCES

(UGC – AUTONOMOUS)
(Approved by AICTE, New Delhi & Affiliated to JNTUH, Hyderabad)
Accredited by *NBA, NAAC with ‘A+’ Grade, *nirf Ranked & an ISO Certified Institution
Narapally, Korremula Road, Ghatkesar, Medchal-Malkajgiri (Dist)-500 088
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

1. Use eclipse or Netbean platform and acquaint with the various menus,
create a test project, add a test class and run it see how you can use auto
suggestions, auto fill. Try code formatter and code refactoring like renaming
variables, methods and classes. Try debug step by step with a small program
of about 10 to 15 lines which contains at least one if else condition and a for
loop.
Program:
Package Cse;

public class Cse

{
public static void main(String[ ] args)
{
System.out.println("\n Prog. is showing even no and odd no");
for(int i=2;i<=20;i++)
{
if(i%2==0)
{
System.out.print("\n Even number is "+i);
}
else{
System.out.print("\n Odd number is "+i);
}
}
}
}

Output:-

CSE II-I SITSR22

SIDDHARTHA INSTITUTE OF TECHNOLOGY & SCIENCES
(UGC – AUTONOMOUS)
(Approved by AICTE, New Delhi & Affiliated to JNTUH, Hyderabad)
Accredited by *NBA, NAAC with ‘A+’ Grade, *nirf Ranked & an ISO Certified Institution
Narapally, Korremula Road, Ghatkesar, Medchal-Malkajgiri (Dist)-500 088
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

2. Write a Java program that works as a simple calculator. Use a grid layout
to arrange buttons for the digits and for the +, -,*, % operations. Add a text
field to display the result. Handle any possible exceptions like divide by zero.
Program:
import java.awt.*;
import java.awt.event.*;
public class Calculator implements ActionListener
{
int c,n;
String s1,s2,s3,s4,s5;
Frame f;
Button b1,b2,b3,b4,b5,b6,b7,b8,b9,b10,b11,b12,b13,b14,b15,b16,b17;

CSE II-I SITSR22

Panel p;
TextField tf;
GridLayout g;
Calculator()
{
f = newFrame("My calculator");
p = newPanel();
f.setLayout(newFlowLayout());
b1 = newButton("0");
b1.addActionListener(this);

b2 = newButton("1");
b2.addActionListener(this);

b3 = newButton("2");
b3.addActionListener(this);

b4 = newButton("3");
b4.addActionListener(this);

b5 = newButton("4");
b5.addActionListener(this);

b6 = newButton("5");
b6.addActionListener(this);

b7 = newButton("6");
b7.addActionListener(this);

b8 = newButton("7");
b8.addActionListener(this);

CSE II-I SITSR22

b9 = newButton("8");
b9.addActionListener(this);
b10 = newButton("9");
b10.addActionListener(this);
b11 = newButton("+");
b11.addActionListener(this);
b12 = newButton("-");
b12.addActionListener(this);
b13 = newButton("*");
b13.addActionListener(this);
b14 = newButton("/");
b14.addActionListener(this);
b15 = newButton("%");
b15.addActionListener(this);
b16 = newButton("=");
b16.addActionListener(this);
b17 = new Button("C");
b17.addActionListener(this);
tf = newTextField(20);

f.add(tf);
g = newGridLayout(4,4,10,20);
p.setLayout(g);
p.add(b1);
p.add(b2);
p.add(b3);
p.add(b4);

CSE II-I SITSR22

p.add(b5);
p.add(b6);
p.add(b7);
p.add( b8);
p.add(b9);
p.add(b10);
p.add(b11);
p.add(b12);
p.add(b13);
p.add(b14);
p.add(b15);
p.add(b1 6);
p.add(b17);
f.add(p);
f.setSize(300,300);
f.setVisible(true);
}
public void actionPerformed(ActionEvent e)
{
if(e.getSource()==b1)
{
s3 = tf.getText();
s4 = "0";
s5 = s3+s4;
tf.setText(s5);
}
if(e.getSource()==b2)
{

CSE II-I SITSR22

s3 = tf.getText();
s4 = "1";
s5 = s3+s4;
tf.setText(s5);
}
if(e.getSource()==b3)
{
s3 = tf.getText();
s4 = "2";
s5 = s3+s4;
tf.setText(s5);
}if(e.getSource()==b4)
{
s3 = tf.getText();
s4 = "3";
s5 = s3+s4;
tf.setText(s5);
}
if(e.getSource()==b5)
{

s3 = tf.getText();
s4 = "4";
s5 = s3+s4;
tf.setText(s5);
}
if(e.getSource()==b6)
{

CSE II-I SITSR22

s3 = tf.getText();
s4 = "5";
s5 = s3+s4;
tf.setText(s5);
}
if(e.getSource()==b7)
{
s3 = tf.getText();

s4 = "6";

s5 = s3+s4;
tf.setText(s5);
}
if(e.getSource()==b8)
{
s3 = tf.getText();
s4 = "7";
s5 = s3+s4;
tf.setText(s5);
}
if(e.getSource()==b9)
{
s3 = tf.getText();
s4 = "8";
s5 = s3+s4;
tf.setText(s5);
}

CSE II-I SITSR22

if(e.getSource()==b10)
{
s3 = tf.getText();
s4 = "9";
s5 = s3+s4;
tf.setText(s5);
}
if(e.getSource()==b11)
{
s1 = tf.getText();
tf.setText("");

c=1;

}
if(e.getSource()==b12)
{

s1 = tf.getText();
tf.setText("");
c=2;
}
if(e.getSource()==b13)
{
s1 = tf.getText();
tf.setText("");
c=3;
}
if(e.getSource()==b14)

CSE II-I SITSR22

{
s1 = tf.getText();
tf.setText("");
c=4;
}
if(e.getSource()==b15)
{
s1 = tf.getText();
tf.setText("");
c=5;
}
if(e.getSource()==b16)
{
s2 = tf.getText();

if(c==1)

{
n = Integer.parseInt(s1)+Integer.parseInt(s2);
tf.setText(String.valueOf(n));
}
else if(c==2)
{
n = Integer.parseInt(s1)-Integer.parseInt(s2);
tf.setText(String.valueOf(n));
}
else if(c==3)
{

CSE II-I SITSR22

n = Integer.parseInt(s1)*Integer.parseInt(s2);
tf.setText(String.valueOf(n));
}
if(c==4)
{
try
{
int p=Integer.parseInt(s2);
if(p!=0)
{
n = Integer.parseInt(s1)/Integer.parseInt(s2);
tf.setText(String.valueOf(n));
}
elsetf.setText("infinite");
}
catch(Exception i){}
}
if(c==5)
{
n = Integer.parseInt(s1)%Integer.parseInt(s2);
tf.setText(String.valueOf(n));
}
}
if(e.getSource()==b17)
{
tf.setText("");
}

CSE II-I SITSR22

}
public static void main(String[ ] args)
{
Calculator v = new Calculator();
}
}
Output:-

CSE II-I SITSR22

3) a) Develop an applet that displays a simple message.

Program:-
import java.awt.*;
import java.applet.*;
/* <applet code="SimpleApplet" width=300 height=50></applet> */
public class HelloJava extends Applet {
public void Paint(Graphics g) {
g.drawString(“Hello Java”, 10, 100);
}}
Output:

CSE II-I SITSR22

3.b) Develop an Applet that receives an integer in one text field & compute its
factorial value & returns it in another text filed when the button “Compute” is
clicked.
import java.awt.*;
import java.lang.String;
import java.awt.event.*;
import java.applet.Applet;
public class Fact extends Applet implements ActionListener
{
String str;
Button b0;
TextField t1,t2;
Label l1;
public void init(){
Panel p=new Panel();
p.setLayout(new GridLayout());
add(new Label("Enter any Integer value"));
add(t1=new TextField(20));
add(new Label("Factorial value is: "));
add(t2=new TextField(20));
add(b0=new Button("compute"));
b0.addActionListener(this);
}
public void actionPerformed(ActionEvent e)
{
int i,n,f=1;
n=Integer.parseInt(t1.getText());
for(i=1;i<=n;i++)

CSE II-I SITSR22

f=f*i;

t2.setText(String.valueOf(f));

repaint();

Output:

CSE II-I SITSR22

4. Write a program that creates a user interface to perform integer divisions.

The user enters two numbers in the text fields, Num1 and Num2. The division
of Num1 and Num2 is displayed in the Result field when the Divide button is
clicked. If Num1 or Num2 were not an integer, the program would throw a
NumberFormatException. If Num2 were Zero, the program would throw an
Arithmetic Exception Display the exception in a message dialog box.

Program:-
import java.awt.*;
import java.awt.event.*;
import java.applet.*;
public class Add1 extends Applet implements ActionListener
{
String msg;
TextField num1, num2, res;

CSE II-I SITSR22

Label l1, l2,

l3;
Button div;
public void init()
{
l1 = new Label("Number 1");
l2 = new Label("Number 2");
l3 = new Label("result");
num1 = new TextField(10);
num2 = new TextField(10);
res = new TextField(30);
div = new Button("DIV");
div.addActionListener(this);
add(l1);
add(num1);
add(l2);
add(num2);
add(l3);
add(res);
add(div);
}
public void actionPerformed(ActionEvent ae)
{
String arg = ae.getActionCommand();
if (arg.equals("DIV"))
{

CSE II-I SITSR22

String s1 = num1.getText();
String s2 = num2.getText();
int num1 = Integer.parseInt(s1);
int num2 = Integer.parseInt(s2);
if (num2 == 0)
{

msg = "Arithemetic Exception ";

repaint();
}
else if ((num1 < 0) || (num2 < 0))
{
msg = "NumberFormat Exception";
repaint();
}
else
{
int num3 = num1 / num2;
msg = String.valueOf(num3);
}
res.setText(msg);
}
}
public void paint(Graphics g)
{
//g.drawString(msg, 30, 70);
}

CSE II-I SITSR22

APPLET.HTML

OUTPUT:

CSE II-I SITSR22

5.) Write a java program that implements a multi-thread application that has
three threads. First thread generates random integer every 1 second and if
the value is even, second thread computes the square of the number and
prints. If the value is odd, the third thread will print the value of cube of the
number.

import java.util.Random;
class RandomNumberThread extends Thread {
public void run() {
Random random = new Random();
for (int i = 0; i< 10; i++) {
int randomInteger = random.nextInt(100);
System.out.println("Random Integer generated : " + randomInteger);
if((randomInteger%2) == 0) {
SquareThreads Thread = new SquareThread(randomInteger);
sThread.start();
}
else {
CubeThread cThread = new CubeThread(randomInteger);
cThread.start();
}
try {
Thread.sleep(1000);
}
catch (InterruptedException ex) {
System.out.println(ex);
}
}

CSE II-I SITSR22

}
}
class SquareThread extends Thread {
int number;
SquareThread(int randomNumbern) {
number = randomNumbern;
}
public void run() {
System.out.println("Square of " + number + " = " + (number * number));
}
}
class CubeThread extends Thread {
int number;
CubeThread(int randomNumber) {
number = randomNumber;
}
public void run() {
System.out.println("Cube of " + number + " = " + number * number * number);
}
}
public class MultiThreadingTest {
public static void main(String args[ ]) {
RandomNumberThread rnThread = new RandomNumberThread();
rnThread.start();
}
}
Output:

CSE II-I SITSR22

Or
package se;
import java.util.Random;
class Square extends Thread
{
int x;
Square(int n)
{
x = n;
}
public void run()
{
int sqr = x * x;
System.out.println("Square of " + x + " = " + sqr );
}
}
class Cube extends Thread
{
int x;
Cube(int n)
{
x = n;
}
public void run()
{
int cub = x * x * x;
System.out.println("Cube of " + x + " = " + cub );

CSE II-I SITSR22

}
}
class Number extends Thread
{
public void run()
{
Random random = new Random();
for(int i =0; i<10; i++)
{
int randomInteger = random.nextInt(100);
System.out.println("Random Integer generated : " + randomInteger);
Square s = new Square(randomInteger);
s.start();
Cube c = new Cube(randomInteger);
c.start();
try {
Thread.sleep(1000);
/*This thread generates random number 10 times
between 1 to 100 for every 1 second. The generated
random number is then passed as argument to
Square and Cube threads.
Output varies each time a program is executed.*/

} catch (InterruptedException ex) {

System.out.println(ex);
}

CSE II-I SITSR22

}
}
}
public class Lab3 {
public static void main(String args[ ])
{
Number n = new Number();
n.start();
}
}
Output:

CSE II-I SITSR22

6.Write a Java program for the following: Create a doubly linked list of
elements. Delete a given element from the above list. Display the contents of
the list after deletion.

// Java program to delete a node from

// Doubly Linked List // Class for Doubly Linked List

public class DLL {

Node head; // head of list
/* Doubly Linked list Node*/
class Node {
int data;
Node prev;
Node next; // Constructor to create a new node
// next and prev is by default initialized // as null

Node(int d) {
data = d;
}}
public void push(int new_data) {
Node new_Node = new Node(new_data);

new_Node.next = head;
new_Node.prev = null;
if (head != null)
head.prev = new_Node;
head = new_Node;
}

CSE II-I SITSR22

public void printlist(Node node) {

Node last = null;
while (node != null)
{
System.out.print(node.data + " ");
last = node;
node = node.next;
}
System.out.println();
}
void deleteNode(Node del)
{
if (head == null || del == null) {
return;
}
if (head == del) {
head = del.next;
}

if (del.next != null) {
del.next.prev = del.prev;
}
if (del.prev != null) {
del.prev.next = del.next;
}
return; }
public static void main(String[ ] args)
{

CSE II-I SITSR22

DLL dll = new DLL();

dll.push(2);
dll.push(4);
dll.push(8);
dll.push(10);
System.out.print("Created DLL is: ");
dll.printlist(dll.head);
dll.deleteNode(dll.head);
System.out.print("\nList after deleting first node: ");
dll.printlist(dll.head);
dll.deleteNode(dll.head.next);
System.out.print("\nList after Deleting middle node: ");
dll.printlist(dll.head);
}
}

OUTPUT:
Original Linked list 10 8 4 2
Modified Linked list 8

CSE II-I SITSR22

7. Write a Java program that simulates a traffic light. The program lets the
user select one of three lights: red, yellow, or green with radio buttons. On
selecting a button, an appropriate message with “Stop” or “Ready” or “Go”
should appear above the buttons in selected color. Initially, there is no
message shown.

import java.applet.Applet;
import java.awt.*;
import java.awt.event.*;
/*
* <applet code = "TrafficLightsExample" width = 1000 height = 500>
* </applet>
* */

public class TrafficLightsExample extends Applet implements ItemListener{

CheckboxGroup grp = new CheckboxGroup();
Checkbox redLight, yellowLight, greenLight;
Label msg;

public void init(){

redLight = new Checkbox("Red", grp, false);

yellowLight = new Checkbox("Yellow", grp, false);
greenLight = new Checkbox("Green", grp, false);
msg = new Label("");
redLight.addItemListener(this);
yellowLight.addItemListener(this);
greenLight.addItemListener(this);

add(redLight);

add(yellowLight);

CSE II-I SITSR22

add(greenLight);

add(msg);

msg.setFont(new Font("Serif", Font.BOLD, 20));

}
public void itemStateChanged(ItemEventie) {
redLight.setForeground(Color.BLACK);
yellowLight.setForeground(Color.BLACK);
greenLight.setForeground(Color.BLACK);
if(redLight.getState() == true) {
redLight.setForeground(Color.RED);
msg.setForeground(Color.RED);
msg.setText("STOP");
}
else if(yellowLight.getState() == true) {
yellowLight.setForeground(Color.YELLOW);
msg.setForeground(Color.YELLOW);
msg.setText("READY");
}
else{
greenLight.setForeground(Color.GREEN);
msg.setForeground(Color.GREEN);
msg.setText("GO");
}
}
}

CSE II-I SITSR22

Output:

8.Write a Java program to create an abstract class named Shape that contains
two integers and an empty method named print Area (). Provide three classes
named Rectangle, Triangle, and Circle such that each one of the classes
extends the class Shape. Each one of the classes contains only the method
print Area () that prints the area of the given shape.

PROGRAM:
import java.util.*;
abstract class Shape {
int length, breadth,radius;
Scanner input = new Scanner(System.in);
abstract void printArea();
}
class Rectangle extends Shape {
void printArea() {

CSE II-I SITSR22

System.out.println("* Finding the Area of Rectangle *");

System.out.print("Enter length and breadth: ");
length = input.nextInt();
breadth = input.nextInt();
System.out.println("The area of Rectangle is: " + length * breadth);
}
}
class Triangle extends Shape {
void printArea() {
System.out.println("\n*** Finding the Area of Triangle ***");
System.out.print("Enter Base And Height: ");
length = input.nextInt();
breadth = input.nextInt();
System.out.println("The area of Triangle is: " + (length * breadth) / 2);
}
}
class Cricle extends Shape {
void printArea() {
System.out.println("\n*** Finding the Area of Cricle ***");
System.out.print("Enter Radius: "); radius =
input.nextInt();
System.out.println("The area of Cricle is: " + 3.14f * radius * radius);
}
}
public class AbstractClassExample {

CSE II-I SITSR22

public static void main(String[] args) {

Rectangle rec = new Rectangle();
rec.printArea();
Triangle tri = new Triangle();
tri.printArea();
Cricle cri = new Cricle();
cri.printArea();
}
}
Output:

CSE II-I SITSR22

9.Suppose that a table named Table.txt is stored in a text file. The first line in
the file is the header, and the remaining lines correspond to rows in the table.
The elements are separated by commas. Write a java program to display the
table using Labels in Grid Layout.

program:
import java.io.*;
import java.util.*;
import java.awt.*;
import javax.swing.*;
class A extends JFrame {
public A() {
setSize(400, 400);
setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
GridLayout g = new GridLayout(0, 3);
setLayout(g);
try {
FileInputStream fin = new FileInputStream("C:\\Users\\User\\eclipseworkspace\\LabManual\\src\\HashTab.txt");
Scanner sc = new Scanner(fin).useDelimiter(",");
String[] arrayList;
String a;
while (sc.hasNextLine()) {
a = sc.nextLine();
arrayList = a.split(",");
for (String i : arrayList) {
add(new JLabel(i));
}
}

CSE II-I SITSR22

} catch (Exception ex) {

}
setDefaultLookAndFeelDecorated(true);
pack();
setVisible(true);
}
}
public class TableTest {
public static void main(String[] args) {
A a = new A();
}
}

Output:

CSE II-I SITSR22

10.Write a Java program that handles all mouse events and shows the event
name at the center of the window when a mouse event is fired (Use Adapter
classes).

Program:
import java.awt.*;
import java.applet.*;
import java.awt.event.*;
/*<applet code="MouseDemo" width=300 height=300>
</applet>*/

public class MouseDemo extends Applet implements MouseListener,

MouseMotionListener {
int mx = 0;
int my = 0;
String msg = "";
public void init() {
addMouseListener(this);
addMouseMotionListener(this);
}
public void mouseClicked(MouseEvent me)
{
mx = 20;
my = 40;
msg = "Mouse Clicked";
repaint();
}

CSE II-I SITSR22

public void mousePressed(MouseEvent me) {

mx = 30;
my = 60;
msg = "Mouse Pressed";
repaint();
}
public void mouseReleased(MouseEvent me) {
mx = 30;
my = 60;
msg = "Mouse Released";
repaint();
}
public void mouseEntered(MouseEvent me) {
mx = 40;
my = 80;
msg = "Mouse Entered";
repaint();
}
public void mouseExited(MouseEvent me) {
mx = 40;
my = 80;
msg = "Mouse Exited";
repaint();
}
public void mouseDragged(MouseEvent me) {
mx = me.getX();
my = me.getY();

CSE II-I SITSR22

showStatus("Currently mouse dragged" + mx + " " + my);

repaint();
}
public void mouseMoved(MouseEvent me) {
mx = me.getX();
my = me.getY();
showStatus("Currently mouse is at" + mx + " " + my);
repaint();
}
public void paint(Graphics g) {
g.drawString("Handling Mouse Events", 30, 20);
g.drawString(msg, 60, 40);
}
}
Output:

CSE II-I SITSR22

11.Write a java program that loads names and phone numbers from a text file
where the data is organized as one line per record and each field in a record
are separated by a tab (\t).it takes a name or phone number as input and
prints the corresponding other value from the hash table(hint: use hash
tables)
Program:
importjava.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.Hashtable;
import java.util.Iterator;
import java.util.Set;
public class HashTab {
public static void main(String[] args) {
HashTab prog11 = new HashTab();
Hashtable<String, String>hashData = prog11.readFromFile("HashTab.txt");
System.out.println("File data into Hashtable:\n" + hashData);
prog11.printTheData(hashData,
"raja"); prog11.printTheData(hashData, "123");
prog11.printTheData(hashData, "--- ");
}
private void printTheData(Hashtable<String, String>hashData, String input)
{ String output =null;
if (hashData != null) {
Set<String> keys = hashData.keySet();
if (keys.contains(input)) {
output = hashData.get(input);

CSE II-I SITSR22

} else {
Iterator<String> iterator = keys.iterator(); while (iterator.hasNext())
{
String key = iterator.next();
String value = hashData.get(key);
if (value.equals(input)) {
output = key; break;
}
}
}
}
System.out.println("Input given:" + input);
if (output != null) {
System.out.println("Data found in HashTable:" + output);
} else {
}
}
privateHashtable<String, String>readFromFile(String fileName) {
Hashtable<String, String>hashData = new Hashtable<String, String>();

try {
File f = new File("D:\\java\\" + fileName);
BufferedReaderbr = new BufferedReader(new FileReader(f));
String line = null; while ((line = br.readLine()) != null) {
String[] details = line.split("\t");
hashData.put(details[0], details[1]);
}
} catch (FileNotFoundException e) {
e.printStackTrace();

CSE II-I SITSR22

} catch (IOException e) {
e.printStackTrace();
}
returnhashData;
}
}

Output:

CSE II-I SITSR22

12.Write a Java program that correctly implements the producer – consumer

problem using the concept of interthread communication.

Program:
classItemQueue {
int item;
booleanvalueSet = false;
synchronized intgetItem()
{
while (!valueSet)
try {
wait();
} catch (InterruptedException e) {
System.out.println("InterruptedException caught");
}
System.out.println("Consummed:" + item); valueSet
= false;
try {
Thread.sleep(1000);
} catch (InterruptedException e) {
System.out.println("InterruptedException caught");
}
notify();
return item;
}
synchronized void putItem(int item) {
while (valueSet)

CSE II-I SITSR22

try { wait();
} catch
(InterruptedE
xception e) {
System.out.println("InterruptedException caught");
}
this.item = item;
valueSet = true;
System.out.println("Produced: " + item);
try {
Thread.sleep(1000);
} catch (InterruptedException e) {
System.out.println("InterruptedException caught");
}
notify();
}
}
class Producer implements Runnable{
ItemQueueitemQueue;
Producer(ItemQueueitemQueue){
this.itemQueue = itemQueue; new
Thread(this, "Producer").start();
}
public void run() {
int i = 0; while(true) {
itemQueue.putItem(i++);
}
}
}
class Consumer implements Runnable{

CSE II-I SITSR22

ItemQueue itemQueue;
Consumer(ItemQueueitemQueue){
this.itemQueue = itemQueue; new
Thread(this, "Consumer").start();
}
public void run() { while(true)
{ itemQueue.getItem();
}
}
}
classProducerConsumer{
public static void main(String args[]) {
ItemQueueitemQueue
= new ItemQueue(); new Producer(itemQueue); new
Consumer(itemQueue);
}
}

Output:

CSE II-I SITSR22

13.Write a Java program to list all the files in a directory including the files
present in all its subdirectories.
Program:
importjava.util.Scanner;
import java.io.*;
public class ListingFiles {
public static void main(String[] args) {
String path = null;
Scanner read = new Scanner(System.in);
System.out.print("Enter the root directory name: "); path =
read.next() + ":\\"; File f_ref = new File(path);
if (!f_ref.exists()) {
printLine();
System.out.println("Root directory does not exists!"); printLine();
}
else {
String ch = "y";
while (ch.equalsIgnoreCase("y")) {
printFiles(path);
System.out.print("Do you want to open any sub-directory(Y/N): ");
ch = read.next().toLowerCase(); if (ch.equalsIgnoreCase("y")) {
System.out.print("Enter the sub-directory name: "); path = path +
"\\\\" + read.next(); File f_ref_2 = new File(path);
if (!f_ref_2.exists()) {
printLine();
System.out.println("The sub-directory does not exists!");
printLine();

CSE II-I SITSR22

intlastIndex = path.lastIndexOf("\\");

path = path.substring(0, lastIndex);

}
}
}
}
System.out.println("***** Program Closed *****");
}
public static void printFiles(String path) {
System.out.println("Current Location: " + path);
File f_ref = new File(path);
File[] filesList = f_ref.listFiles();
for (File file : filesList) {
if (file.isFile())
System.out.println("- " + file.getName());
else
System.out.println("> " + file.getName());
}
}
public static void printLine() {
System.out.println("- -");
}
}
Output:

CSE II-I SITSR22

14. Write a Java program that implements Quick sort algorithm for sorting a
list of names 41 in ascending Order.
Program:
public class QuickSortOnStrings { String names[];
int length;
public static void main(String[] args) {
QuickSortOnStringsobj = new
QuickSortOnStrings();
String stringsList[] = {""cse", "aiml", "ds", "se", "cs", "iot", "hello"};
obj.sort(stringsList);
for (String i : stringsList) {
System.out.print(i);
System.out.print(" ");
}
}
void sort(String array[]) {
if (array == null || array.length == 0) {
return;
}
this.names = array;
this.length = array.length;
quickSort(0, length - 1);

CSE II-I SITSR22

}
void quickSort(intlowerIndex, inthigherIndex) {
int i = lowerIndex; int j = higherIndex;
String pivot = this.names[lowerIndex + (higherIndex - lowerIndex) / 2];
while (i<= j) {
while (this.names[i].compareToIgnoreCase(pivot) < 0) {

i++;
}
while (this.names[j].compareToIgnoreCase(pivot) > 0) {
j--;
} if (i<= j)
{
exchangeNames(i, j);
i++;
j--;
}
}
if (lowerIndex< j) {

quickSort(lowerIndex, j);
}
if (i<higherIndex) { quickSort(i,
higherIndex);
}
}
void exchangeNames(int i, int j)
{

CSE II-I SITSR22

String temp = this.names[i];

this.names[i] = this.names[j];
this.names[j] = temp;
}
}
Output:

15.Write a Java program that implements Bubble sort algorithm for sorting in
descending order and also shows the number of interchanges occurred for the
given set of integers.
Program:
importjava.util.Scanner;
public class BubbleSort {
public static void main(String[] args) {
Scanner read = new
Scanner(System.in);
int size, count = 0;
//Reading size of the list
System.out.print("Enter the list size: ");
size = read.nextInt(); //Creating list
with elements int list[] = new int[size];
System.out.println("Enter any " + size + " integer numbers: ");
for(inti = 0; i< size; i++)

list[i] = read.nextInt();

CSE II-I SITSR22

// Bubble sort logic int temp=0;

for(inti=0;i<size-1;i++) {
for(int j=0;j<size-i1;j++) {
if(list[j]<list[j+1])
{
temp=list[j];
list[j]=list[j+1];
list[j+1]=temp;
count++;
}
}
}
// Displaying sorted list
System.out.println("List of sorted elements: ");
for(int x:list) {
System.out.print(x + " ");
}
System.out.println("\nTotal number of Interchanges is " + count);
}
}
Output:

CSE II-I SITSR22

CS Classroom Paper 1 Guide
No ratings yet
CS Classroom Paper 1 Guide
56 pages
ISTQB Advanced Level Technical Test Analyst- Exam Insights: Q&A with Explanations
From Everand
ISTQB Advanced Level Technical Test Analyst- Exam Insights: Q&A with Explanations
SUJAN
No ratings yet
Syllabus CSEN1111-OOP With Java
No ratings yet
Syllabus CSEN1111-OOP With Java
7 pages
Adv Java Experiment 02
No ratings yet
Adv Java Experiment 02
8 pages
Cycle Sheet It Java
No ratings yet
Cycle Sheet It Java
2 pages
CSEN1111 OBJECT ORIENTED PROGRAMMING
No ratings yet
CSEN1111 OBJECT ORIENTED PROGRAMMING
7 pages
Basic Prog
No ratings yet
Basic Prog
25 pages
21BCS11408_Arpit Anand(JAVA Day1)
No ratings yet
21BCS11408_Arpit Anand(JAVA Day1)
12 pages
AutoCVmkr CV Template
No ratings yet
AutoCVmkr CV Template
1 page
CSE R22 08 NOV 2022-Course Structure
No ratings yet
CSE R22 08 NOV 2022-Course Structure
52 pages
21CSL35-OOPS LAB - Lab Manual 21CSL35-OOPS LAB - Lab Manual
No ratings yet
21CSL35-OOPS LAB - Lab Manual 21CSL35-OOPS LAB - Lab Manual
88 pages
21BCS7586_PriyanshuMalik_Day~6
No ratings yet
21BCS7586_PriyanshuMalik_Day~6
5 pages
Android App Development Test
No ratings yet
Android App Development Test
2 pages
21BCS7586_PriyanshuMalik_Day~4
No ratings yet
21BCS7586_PriyanshuMalik_Day~4
7 pages
R22 - OOPS Using JAVA Lab Manual 2-2
No ratings yet
R22 - OOPS Using JAVA Lab Manual 2-2
58 pages
JavaLab Sanjay
No ratings yet
JavaLab Sanjay
23 pages
Indira Gandhi National Open University: Lab Manual Mca
No ratings yet
Indira Gandhi National Open University: Lab Manual Mca
54 pages
Practicals
No ratings yet
Practicals
29 pages
10605mc-1_decrypted
No ratings yet
10605mc-1_decrypted
3 pages
PC File
No ratings yet
PC File
48 pages
Ex No1
No ratings yet
Ex No1
31 pages
Computer Science Course Plan
No ratings yet
Computer Science Course Plan
430 pages
MCA
No ratings yet
MCA
63 pages
Ap Computer Science A Course Overview
No ratings yet
Ap Computer Science A Course Overview
2 pages
Bca Cbcs 2016
No ratings yet
Bca Cbcs 2016
26 pages
Nisarg Java File
No ratings yet
Nisarg Java File
51 pages
OOPs Java Lab Manual
No ratings yet
OOPs Java Lab Manual
29 pages
21BCS9492 - Vishesh - JAVA (Day 1)
No ratings yet
21BCS9492 - Vishesh - JAVA (Day 1)
8 pages
Java Programs
No ratings yet
Java Programs
173 pages
Final - Basics of Java Lab Manual (BPLCK205C)
No ratings yet
Final - Basics of Java Lab Manual (BPLCK205C)
32 pages
6.mathematical Simulation Lab
No ratings yet
6.mathematical Simulation Lab
9 pages
Master
No ratings yet
Master
1 page
B.tech IT Syllabus 2017 Regulation
No ratings yet
B.tech IT Syllabus 2017 Regulation
12 pages
FY Syllabus Integrated BCA+MCA 2024-25 Final
No ratings yet
FY Syllabus Integrated BCA+MCA 2024-25 Final
35 pages
6739 week 1-6
No ratings yet
6739 week 1-6
19 pages
Record Oops
No ratings yet
Record Oops
30 pages
Comp Syllab
No ratings yet
Comp Syllab
128 pages
R 2008 Cse Syllabus
No ratings yet
R 2008 Cse Syllabus
89 pages
OOPs Java Lab Manual
No ratings yet
OOPs Java Lab Manual
29 pages
MCASyllabusR 20
No ratings yet
MCASyllabusR 20
82 pages
OOP with JAVA - BCS306A Lab manual
No ratings yet
OOP with JAVA - BCS306A Lab manual
39 pages
Daa Lab Manual2020 1
No ratings yet
Daa Lab Manual2020 1
132 pages
FOP Practical
No ratings yet
FOP Practical
39 pages
Pratice Sheet Java - If Switch
No ratings yet
Pratice Sheet Java - If Switch
4 pages
Anjal - Mahato - 20048637 1.0
No ratings yet
Anjal - Mahato - 20048637 1.0
55 pages
CSE 3rd Sem R2008
No ratings yet
CSE 3rd Sem R2008
15 pages
Sheet No
No ratings yet
Sheet No
20 pages
DAA Course File
No ratings yet
DAA Course File
6 pages
SEM III BR Computer Science and Engineering
No ratings yet
SEM III BR Computer Science and Engineering
21 pages
Design and Analysis of Algorithms
No ratings yet
Design and Analysis of Algorithms
5 pages
150+ C Pattern Programs
From Everand
150+ C Pattern Programs
Hernando Abella
No ratings yet
Computer Engineering Laboratory Solution Primer
From Everand
Computer Engineering Laboratory Solution Primer
Karan Bhandari
No ratings yet
Salesforce Certified Platform Developer I CRT-450 Exam Preparation
From Everand
Salesforce Certified Platform Developer I CRT-450 Exam Preparation
Georgio Daccache
No ratings yet
Oracle Certified Professional Java Programmer OCPJP 1Z0 809
From Everand
Oracle Certified Professional Java Programmer OCPJP 1Z0 809
Manish Soni
No ratings yet
150+ JavaScript Pattern Programs
From Everand
150+ JavaScript Pattern Programs
Hernando Abella
No ratings yet
Cisco Packet Tracer Implementation: Building and Configuring Networks: 1, #1
From Everand
Cisco Packet Tracer Implementation: Building and Configuring Networks: 1, #1
S. R. Jena
No ratings yet
Advanced C Concepts and Programming: First Edition
From Everand
Advanced C Concepts and Programming: First Edition
Gayatri
3/5 (1)
Essential n8n Playbook
From Everand
Essential n8n Playbook
Leandro Calado
No ratings yet
Learning Oracle 12c: A PL/SQL Approach
From Everand
Learning Oracle 12c: A PL/SQL Approach
Prof. Sham Tickoo
No ratings yet
Blue Prism Developer Certification Case Based Practice Question - Latest 2023
From Everand
Blue Prism Developer Certification Case Based Practice Question - Latest 2023
Exam OG
No ratings yet
Factorial TCP
No ratings yet
Factorial TCP
8 pages
Java Variables
No ratings yet
Java Variables
30 pages
MATLAB TUTORIAL 2023
No ratings yet
MATLAB TUTORIAL 2023
11 pages
Java Tutorial - Balaji
100% (1)
Java Tutorial - Balaji
11 pages
PetroChem Engg PDF
No ratings yet
PetroChem Engg PDF
90 pages
Built-In String Functions in PHP
No ratings yet
Built-In String Functions in PHP
10 pages
Anjali Basera 12th
No ratings yet
Anjali Basera 12th
8 pages
Intro To Python
100% (1)
Intro To Python
122 pages
TCS DEC - 18 Solved
No ratings yet
TCS DEC - 18 Solved
11 pages
STRING - Built-In Methods
No ratings yet
STRING - Built-In Methods
1 page
COMAL On The BBC Microcomputer
No ratings yet
COMAL On The BBC Microcomputer
456 pages
Course Module-C Lab
No ratings yet
Course Module-C Lab
7 pages
Visual Basic MCQ
100% (1)
Visual Basic MCQ
19 pages
PHP Practical Slips University
No ratings yet
PHP Practical Slips University
5 pages
ANSYS Mechanical Advances (Using Command Objects) : APDL Commands
No ratings yet
ANSYS Mechanical Advances (Using Command Objects) : APDL Commands
37 pages
Java Flash Card
No ratings yet
Java Flash Card
18 pages
CHAPTER 1 - Introduction-F - Part 1
No ratings yet
CHAPTER 1 - Introduction-F - Part 1
23 pages
AddOn (P ValveMO)
No ratings yet
AddOn (P ValveMO)
52 pages
C Language Programes
No ratings yet
C Language Programes
180 pages
Clip Batch
No ratings yet
Clip Batch
3 pages
Python Notes
No ratings yet
Python Notes
75 pages
Computer_PYQ_2015_2023
No ratings yet
Computer_PYQ_2015_2023
25 pages
Java Basic Questions
100% (1)
Java Basic Questions
38 pages
Dust Tutorial GitHub
No ratings yet
Dust Tutorial GitHub
15 pages
Conversions Question 1
No ratings yet
Conversions Question 1
13 pages
1D Array Programs
No ratings yet
1D Array Programs
28 pages
DOC-20250111-WA0002.
No ratings yet
DOC-20250111-WA0002.
6 pages
A Comparison of The Syntax of Python and Java PDF
No ratings yet
A Comparison of The Syntax of Python and Java PDF
6 pages
UNIX Cmds&amp Programming
No ratings yet
UNIX Cmds&amp Programming
54 pages
Automata Theory: Reference: Introduction To Automata Theory Languages and Computation Hopcraft, Ullman and Motwani
No ratings yet
Automata Theory: Reference: Introduction To Automata Theory Languages and Computation Hopcraft, Ullman and Motwani
22 pages

java cseab lab manual (2)

Uploaded by

java cseab lab manual (2)

Uploaded by

SIDDHARTHA INSTITUTE OF TECHNOLOGY & SCIENCES

public class Cse

CSE II-I SITSR22

CSE II-I SITSR22

CSE II-I SITSR22

CSE II-I SITSR22

CSE II-I SITSR22

CSE II-I SITSR22

CSE II-I SITSR22

CSE II-I SITSR22

CSE II-I SITSR22

CSE II-I SITSR22

CSE II-I SITSR22

3) a) Develop an applet that displays a simple message.

CSE II-I SITSR22

CSE II-I SITSR22

CSE II-I SITSR22

CSE II-I SITSR22

4. Write a program that creates a user interface to perform integer divisions.

CSE II-I SITSR22

Label l1, l2,

CSE II-I SITSR22

msg = "Arithemetic Exception ";

CSE II-I SITSR22

CSE II-I SITSR22

CSE II-I SITSR22

CSE II-I SITSR22

CSE II-I SITSR22

CSE II-I SITSR22

} catch (InterruptedException ex) {

CSE II-I SITSR22

CSE II-I SITSR22

// Java program to delete a node from

public class DLL {

CSE II-I SITSR22

public void printlist(Node node) {

CSE II-I SITSR22

DLL dll = new DLL();

CSE II-I SITSR22

public class TrafficLightsExample extends Applet implements ItemListener{

public void init(){

redLight = new Checkbox("Red", grp, false);

CSE II-I SITSR22

msg.setFont(new Font("Serif", Font.BOLD, 20));

CSE II-I SITSR22

CSE II-I SITSR22

System.out.println("*** Finding the Area of Rectangle ***");

CSE II-I SITSR22

public static void main(String[] args) {

CSE II-I SITSR22

CSE II-I SITSR22

} catch (Exception ex) {

CSE II-I SITSR22

public class MouseDemo extends Applet implements MouseListener,

CSE II-I SITSR22

public void mousePressed(MouseEvent me) {

CSE II-I SITSR22

showStatus("Currently mouse dragged" + mx + " " + my);

CSE II-I SITSR22

CSE II-I SITSR22

CSE II-I SITSR22

CSE II-I SITSR22

12.Write a Java program that correctly implements the producer – consumer

CSE II-I SITSR22

CSE II-I SITSR22

CSE II-I SITSR22

CSE II-I SITSR22

CSE II-I SITSR22

path = path.substring(0, lastIndex);

CSE II-I SITSR22

CSE II-I SITSR22

CSE II-I SITSR22

String temp = this.names[i];

CSE II-I SITSR22

// Bubble sort logic int temp=0;

CSE II-I SITSR22

System.out.println("* Finding the Area of Rectangle *");