Sunil Bhagwat

TY B.B.A. (C.A.) Sem V : Core Java Practical Slips Solutions

2025-09-29T08:39:00.018+05:30

SAVITRIBAI PHULE PUNE UNIVERSITY, PUNE

T.Y.B.B.A.(C.A.) Semester – V (CBCS 2019 Pattern) University Practical Examination

Lab Course: (CA-506) Computer Laboratory Based on 503, 504

Core Java, MongoDB / Python

Q.1. Core Java:

Slip No. 1

/** A) Write a ‘java’ program to display characters from ‘A’ to ‘Z’. */

class Slip1_A

{

public static void main(String args[])

{

for(char ch = 'A' ; ch <= 'Z'; ch++)

{

System.out.print(ch+" ");

}

/** B) Write a ‘java’ program to copy only non-numeric data from one file to another file. */

import java.io.*;
class Slip1_B
{
public static void main(String args[]) throws IOException
{
File ifile = new File("in.dat");
File ofile = new File("out.dat");
try{
FileReader in = new FileReader(ifile);
FileWriter out = new FileWriter(ofile, true);
int ch;
while((ch = in.read()) != -1)
{
if(Character.isDigit(ch))
continue;
out.write(ch);
}
in.close();
out.close();
}
catch(IOException e)
{
System.out.println(e);
System.exit(-1);
}
}
}

Slip No. 2

/* A) Write a java program to display all the vowels from a given string */

class Slip2_A {

public static void main(String args[])

{

String str = "Hello World";

char ch;

for(int i=0; i < str.length(); i++)

{

ch = str.charAt(i);

if(ch == 'a' || ch == 'A' || ch == 'e' || ch == 'E' || ch == 'i' || ch == 'I' || ch == 'o' || ch == 'O' || ch == 'u' || ch == 'U')

{

System.out.print(ch + " ");

}

/** B) Design a screen in Java to handle the Mouse Events such as MOUSE_MOVED and MOUSE_CLICK and display the position of the Mouse_Click in a TextField */

import java.awt.*;

import java.awt.event.*;

class MyFrame extends Frame

{

TextField t, t1;

Label l, l1;

int x, y;

Panel p;

MyFrame(String title)

{

super(title);

setLayout(new FlowLayout()); // Frame

p = new Panel();

p.setLayout(new GridLayout(2, 2, 5, 5));

l = new Label("Co-ordinates of clicking");

t = new TextField(20);

l1 = new Label("Co-ordinates of movement");

t1 = new TextField(20);

p.add(l);

p.add(t);

p.add(l1);

p.add(t1);

add(p);

addMouseListener(new MyClick());

addMouseMotionListener(new MyMove());

setSize(500, 500);

setVisible(true);

addWindowListener(new WindowAdapter(){

public void windowClosing(WindowEvent e)

{

dispose();

}

});

}

class MyClick extends MouseAdapter

{

public void mouseClicked(MouseEvent me)

{

x = me.getX();

y = me.getY();

t.setText("X = "+ x + " Y = " + y);

}

class MyMove extends MouseMotionAdapter

{

public void mouseMoved(MouseEvent me)

{

x = me.getX();

y = me.getY();

t1.setText("X = "+ x + " Y = " + y);

}

class Slip2_B

{

public static void main(String[] args) {

MyFrame f = new MyFrame("Slip Number 4");

}

Slip No. 3

/** A) Write a 'java' program to check whether given number is Armstrong or not. (Use static keyword).*/

import java.io.*;

class Slip3_A

{

public static int checkArmstrongNumber(int Number)

{

int rem, sum = 0;

while(Number > 0)

{

rem = Number%10;

sum = sum + rem * rem * rem;

Number = Number/10;

}

return sum;

}

public static void main(String args[]) throws IOException

{

BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

System.out.println("Enter the number : ");

int n = Integer.parseInt(br.readLine());

if (n == checkArmstrongNumber(n))

{

System.out.println(n + " is armstrong number.");

}

else{

System.out.println(n + " is not armstrong number.");

}

/** B) Define an abstract class Shape with abstract methods area() and volume(). Derive abstract class Shape into two classes Cone and Cylinder. Write a java Program to calculate area and volume of Cone and Cylinder. (Use Super Keyword). (Area of Cone = 3.14 * r ( r + l)) */

import java.io.*;

abstract class Shape

{

final double pi = 3.14;

abstract double area();

abstract double volume();

}

class Cone extends Shape{

int radius, height;

Cone(){

radius = 0;

height = 0;

}

Cone(int radius, int height){

this.radius = radius;

this.height = height;

}

double area(){

return pi * radius * ( Math.sqrt(radius*radius+height*height));

}

double volume(){

return (pi * (radius * radius) * height)/3;

}

class Cylinder extends Shape{

int radius, height;

Cylinder(){

radius = 0;

height = 0;

}

Cylinder(int radius, int height){

this.radius = radius;

this.height = height;

}

double area(){

return (2*pi*radius*height) + (2*pi*radius*radius);

}

double volume(){

return pi * radius * radius * height;

}

class Slip3_B

{

public static void main(String args[]) throws IOException

{

BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

System.out.println("Enter the radius: ");

int radius = Integer.parseInt(br.readLine());

System.out.println("Enter the height: ");

int height = Integer.parseInt(br.readLine());

Cone c = new Cone(radius, height);

System.out.println("The area of a Cone = " + c.area());

System.out.println("The volume of a Cone = " + c.volume());

Cylinder cl = new Cylinder(radius, height);

System.out.println("The area of a Cylinder = " + cl.area());

System.out.println("The volume of a Cylinder = " + cl.volume());

}

Slip No. 5

/** A) Write a java program to display following pattern:

4 5

3 4 5

2 3 4 5

1 2 3 4 5

class Slip5_A

{

public static void main(String args[])

{

for (int i = 5; i > 0; i--)

{

for (int j = i; j <= 5; j++)

{

System.out.print(j);

}

System.out.println();

}

/** B) Write a java program to accept list of file names through command line. Delete the files having extension .txt. Display name, location and size of remaining files.*/

import java.io.*;

class Slip5_B

{

public static void main(String args[]) throws IOException

{

for(int i = 0; i < args.length; i++)

{

File f = new File(args[i]);

if(f.isFile())

{

String name = f.getName();

if(name.endsWith(".txt"))

{

f.delete();

System.out.println("File is deleted." + f);

}

else{

System.out.println("File Name : " + name);

System.out.println("File Location : " + f.getAbsolutePath());

System.out.println("File Size : " + f.length() + "bytes");

}

else

{

System.out.println(args[i] + " is not a file.");

}

Slip No. 6

/** A) Write a java program to accept a number from user, if it zero then throw user defined Exception “Number Is Zero”, otherwise calculate the sum of first and last digit of that number. (Use static keyword). */

import java.io.*;

class ZeroNumExc extends Exception{}

public class Slip6_A {

static int n;

public static void main(String args[]){

try {

int first, last = 0;

BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

System.out.print("Enter Number : ");

n = Integer.parseInt(br.readLine());

if(n == 0)

{

throw new ZeroNumExc();

}

else

{

if(n < 10)

first = n;

else

{

first = n%10;

while(n>0)

{

last = n%10;

n = n / 10;

}

System.out.print("Sum of First and Last Number is : " + (first + last));

}

} catch (ZeroNumExc nz) {

System.out.println("Number is Zero");

}

catch(Exception e){}

}

/** B) Write a java program to display transpose of a given matrix. */

class Slip6_B

{

public static void main(String args[])

{

int matrix[][] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}};

int transposeMatrix[][] = new int[3][3];

for(int i = 0; i < 3; i++)

{

for(int j = 0; j < 3; j++)

{

transposeMatrix[i][j] = matrix[j][i];

}

System.out.println("The Original Matrix is : ");

for(int i = 0; i < 3; i++)

{

for(int j = 0; j < 3; j++)

{

System.out.print(matrix[i][j] + " ");

}

System.out.println();

}

System.out.println("The Transpose Matrix is : ");

for(int i = 0; i < 3; i++)

{

for(int j = 0; j < 3; j++)

{

System.out.print(transposeMatrix[i][j] + " ");

}

System.out.println();

}

Slip No. 8

/** A) Define an Interface Shape with abstract method area(). Write a java program to

calculate an area of Circle and Sphere.(use final keyword) */

interface Shape

{

public final double PI = 3.14;

public double area();

}

class Circle implements Shape

{

int radius;

Circle(int radius)

{

this.radius = radius;

}

public double area()

{

return (PI * radius * radius);

}

class Sphere implements Shape

{

int radius;

Sphere(int radius)

{

this.radius = radius;

}

public double area()

{

return (4 * PI * radius * radius);

}

public class Slip8_A {

public static void main(String args[])

{

Shape s = new Circle(2);

System.out.println("The area of Circle : " + s.area());

s = new Sphere(2);

System.out.println("The area of Sphere : " + s.area());

}

/** B) Write a java program to display the files having extension .txt from a given directory.*/

import java.io.*;

class Slip8_B

{

public static void main(String args[])

{

File f = new File("./");

String fileList[] = f.list();

for(String file : fileList)

{

if(file.endsWith(".txt"))

{

System.out.println(file);

}

Slip No. 9

/* A) Write a java program to display following pattern:

0 1

0 1 0

1 0 1 0

class Slip9_A

{

public static void main(String args[])

{

for (int i = 1; i <= 4; i++)

{

for (int j = 1; j <= i; j++)

{

if ((i+j)%2 == 0)

System.out.print("1");

else

System.out.print("0");

}

System.out.println();

}

/** B) Write a java program to validate PAN number and Mobile Number. If it is invalid then throw user defined Exception “Invalid Data”, otherwise display it. */

import java.io.*;

class InvalidData extends Exception{

InvalidData()

{

System.out.println("Invalid Data");

}

class Slip9_B{

public static void main( String args[]){

Long mobileNumber;

String panNumber;

BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

try

{

System.out.print("Enter PAN Number : ");

panNumber = br.readLine();

if(panNumber.matches("[A-Z]{5}[0-9]{4}[A-Z]{1}")){

System.out.println("Valid PAN CARD Number..!");

}

else

{

throw new InvalidData();

}

System.out.print("Enter Mobile Number : ");

mobileNumber = Long.parseLong(br.readLine());

if(mobileNumber.toString().matches("(0/91)?[7-9][0-9]{9}")){

System.out.println("Valid Mobile Number..!");

}

else

{

throw new InvalidData();

}

} catch (InvalidData id) {

System.out.println("You Enter Invalid Details...!");

}

catch (NumberFormatException e){

System.out.println("You Enter Invalid Details...!");

}

catch(Exception e){}

}

Slip No. 12

/** A) Write a java program to display each String in reverse order from a String array.*/

class Slip12_A

{

public static void main(String args[])

{

String strList[] = {"TYBCA", "SYBCS", "Arts", "Mathematics", "Computer Science"};

for(String s : strList)

{

StringBuffer str = new StringBuffer(s);

System.out.println(str.reverse());

}

/** B) Write a java program to display multiplication table of a given number into the List box by clicking on button.*/

import java.awt.*;

import java.awt.event.*;

class Slip12_B extends Frame implements ActionListener

{

List list = new List();

Label t;

Button show;

String str = "";

Panel p;

List result = new List();

Slip12_B(String title)

{

super(title);

setLayout(new FlowLayout());

p = new Panel();

p.setLayout(new GridLayout(20, 1, 5, 5));

t = new Label("Select given number to display table");

p.add(t);

list.add("1");

list.add("2");

list.add("3");

list.add("4");

list.add("5");

list.add("6");

list.add("7");

list.add("8");

list.add("9");

list.add("10");

p.add(list);

show = new Button("Show");

p.add(show);

show.addActionListener(this);

add(p);

setSize(300, 800);

setVisible(true);

addWindowListener(new WindowAdapter() {

public void windowClosing(WindowEvent e)

{

dispose();;

}

});

}

public void actionPerformed(ActionEvent e){

Button btn = (Button) e.getSource();

if(btn.getLabel() == "Show")

{

int num = Integer.parseInt(list.getSelectedItem());

result.removeAll();

for(int i = 1; i <= 10; i++)

{

int a = num*i;

result.add(num +" * " + i +" = "+ a);

}

p.add(result);

}

public static void main(String args[])

{

new Slip12_B("Multiplication Table");

}

Slip No. 18

/** A) Write a Java program to calculate area of Circle, Triangle & Rectangle. (Use Method Overloading) */

class Circle

{

int radius;

Circle(int r)

{

radius = r;

}

void area()

{

double a = 3.14 * radius * radius;

System.out.println("The area of Circle = " + a);

}

class Triangle

{

int base, height;

Triangle(int b, int h)

{

base = b;

height = h;

}

void area()

{

double a = 0.5 * base * height;

System.out.println("The area of Triangle = " + a);

}

class Rectangle

{

int length, breadth;

Rectangle(int l, int b)

{

length = l;

breadth = b;

}

void area()

{

double a = length * breadth;

System.out.println("The area of Rectangle = " + a);

}

class Slip18_A

{

public static void main(String args[])

{

Circle c = new Circle(3);

c.area();

Triangle t = new Triangle(8, 6);

t.area();

Rectangle r = new Rectangle(5, 3);

r.area();

}

/** B) Write a java program to copy the data from one file into another file, while copying change the case of characters in target file and replaces all digits by ‘*’ symbol. */

import java.io.*;

class Slip18_B

{

public static void main(String args[]) throws IOException

{

FileReader fin = new FileReader("in.dat");

FileWriter fout = new FileWriter("out.dat");

int b;

while((b=fin.read())!=-1) {

char ch = (char)b;

if(Character.isLowerCase(ch))

ch = Character.toUpperCase(ch);

else if (Character.isUpperCase(ch))

ch = Character.toLowerCase(ch);

else if (Character.isDigit(ch))

ch = '*';

fout.write(ch);

}

fin.close();

fout.close();

}

Practical Implementation of Singleton Class

2025-09-28T17:11:00.001+05:30

Practical Implementation of Singleton Class

class Singleton

{

public static void main(String args[])

{

Thread t = new Thread(new Runnable(){

public void run()

{

DatabaseConnection obj = DatabaseConnection.getInstance();

}

});

Thread t1 = new Thread(new Runnable(){

public void run()

{

DatabaseConnection obj = DatabaseConnection.getInstance();

}

});

t.start();

t1.start();

}

class DatabaseConnection{

private static DatabaseConnection instance;

private DatabaseConnection()

{

// private constructor to prevent external instatiation

System.out.println("Instance will be created.");

}

public static synchronized DatabaseConnection getInstance()

{

if(instance == null)

{

instance = new DatabaseConnection();

}

return instance;

}

TYBSc (CS) Sem V : Object Oriented Programming Using Java I Practical Slips Solutions

2025-09-28T16:31:00.023+05:30

SAVITRIBAI PHULE PUNE UNIVERSITY, PUNE

T. Y. B.Sc. (Computer Science) Semester V

Practical Examination

SUBJECT: CS-359 Practical course based on

CS-355 (Object Oriented Programming Using Java I)

Slip No. 1

/* Q1) Write a Program to print all Prime numbers in an array of ‘n’ elements. (use command line arguments) */

class Slip1

{
public static void main(String args[])
{
System.out.println("The prime numbers are: ");
for(int i = 0; i < args.length; i++)
{
boolean isPrime= true;
int num = Integer.parseInt(args[i]);
for(int j = 2; j < num; j++)
{
if(num%j == 0)
{
isPrime= false;
break;
}
}
if(isPrime== true)
{
System.out.println(num);
}
}
}
}

How run it:

/* Q. 2 - Define an abstract class Staff with protected memebers id and name. Define a parameterized constructor. Define one subclass OfficeStaff with member department. Create n object of OfficeStaff and display all details.*/

import java.util.*;

abstract class Staff{

protected int id;

protected String name;

Staff(int id, String name)

{

this.id = id;

this.name = name;

}

class OfficeStaff extends Staff{

String department;

OfficeStaff(int id, String name, String department)

{

super(id, name);

this.department = department;

}

void display()

{

System.out.println("[id = " + id + " Name = " + name + " Department = " + department + " ]");

}

class Slip1_2

{

public static void main(String[] args) {

int id;

String name, department;

Scanner sc = new Scanner(System.in);

System.out.println("How many staff memebers you have to enter: ");

int n = sc.nextInt();

OfficeStaff []os = new OfficeStaff[n];

for (int i = 0; i < n; i++) {

System.out.println("Enter the staff member id number: ");

id = sc.nextInt();

System.out.println("Enter the staff member name: ");

name = sc.next();

System.out.println("Enter the staff member department: ");

department = sc.next();

os[i] = new OfficeStaff(id, name, department);

}

for (int i = 0; i < n; i++)

os[i].display();

}

How to run it:

Slip No. 2

/* Q. 1 Write a program to read the First Name and Last Name of a person, his weight and height using

command line arguments. Calculate the BMI Index which is defined as the individual's body mass

divided by the square of their height.

(Hint : BMI = Wts. In kgs / (ht)2)*/

class Slip2_1

{

public static void main(String args[])

{

String FirstName = args[0];

String LastName = args[1];

float weight = Float.parseFloat(args[2]);

float height = Float.parseFloat(args[3]);

// To convert height centimeter to meter

height = height / 100;

float BMI = weight / (height * height);

System.out.println("First Name : " + FirstName);

System.out.println("Last Name : " + LastName);

System.out.println("Weight : " + weight);

System.out.println("Height : " + height);

System.out.println("The Body Mass Index (BMI) : " + BMI + " kg / m2");

}

How to run it:

/* Q. 2) Define a class CricketPlayer (name,no_of_innings,no_of_times_notout, totatruns, bat_avg).

Create an array of n player objects.

Calculate the batting average for each player using static method avg().

Define a static sort method which sorts the array on the basis of average.

Display the player details in sorted order.*/

class CricketPlayer

{

String name;

int no_of_innings, no_of_times_notout, totatruns;

double bat_avg;

CricketPlayer(String name, int no_of_innings, int no_of_times_notout, int totatruns)

{

this.name = name;

this.no_of_innings = no_of_innings;

this.no_of_times_notout = no_of_times_notout;

this.totatruns = totatruns;

}

public static double avg(CricketPlayer player)

{

if((player.no_of_innings - player.no_of_times_notout) == 0)

{

return 0.0;

}

return (double) player.totatruns / (player.no_of_innings - player.no_of_times_notout);

}

public static void sortPlayerByAvg(CricketPlayer players[])

{

for (int i = 0; i < players.length - 1; i++)

{

for (int j = 0; j < players.length - i - 1; j++)

{

if (players[j].bat_avg < players[j + 1].bat_avg)

{

CricketPlayer temp = players[j];

players[j] = players[j+1];

players[j+1] = temp;

}

public void displayPlayerDetails()

{

System.out.println("Name : " + name + ", Innings : " + no_of_innings + ", Not Outs : " + no_of_times_notout + ", Total Runs : " + totatruns + ", Batting Average : " + String.format("%.2f", bat_avg));

}

class Slip2_2

{

public static void main(String args[])

{

CricketPlayer players[] = new CricketPlayer[3];

players[0] = new CricketPlayer("Virat Kohli", 250, 30, 12000);

players[1] = new CricketPlayer("Rohit Sharma", 220, 20, 9500);

players[2] = new CricketPlayer("MS Dhoni", 350, 80, 10700);

for (CricketPlayer player: players)

{

player.bat_avg = CricketPlayer.avg(player);

}

CricketPlayer.sortPlayerByAvg(players);

System.out.println("Player details sorted by batting average: ");

for (CricketPlayer player: players)

{

player.displayPlayerDetails();

}

How to run it:

Slip No. 3

/** Q. 1) Write a program to accept 'n' name of cities from the user and sort them in ascending order. */

import java.util.*;

class Slip3_1

{

public static void main(String args[])

{

Scanner sc = new Scanner(System.in);

System.out.print("Enter how many city you want to enter : ");

int n = sc.nextInt();

String city[] = new String[n];

for(int i = 0; i < n; i++)

{

System.out.print("\n\nEnter city name: ");

city[i]= sc.next();

}

String temp;

for(int i = 0; i < n; i++)

{

for(int j=i+1; j < n; j++)

{

if(city[i].compareTo(city[j])>0)

{

temp = city[i];

city[i] = city[j];

city[j] = temp;

}

System.out.print("\n\nSorted Cities are : ");

for(int i = 0; i < n; i++)

{

System.out.print(city[i]+" ");

}

How to run it:

/** Q. 2) Define a class patient (patient_name, patient_age, patient_oxy_level, patient_HRCT_report). Create an object of patient. Handle appropriate exception while patient oxygen level less than 95% and HRCT scan report greater than 10, then throw user defined Exception "Patient is Covid Positive(+) and Need to Hospitalized" otherwise display its information.

import java.util.*;

class patient{

String patient_name;

int patient_age;

int patient_oxy_level;

int patient_HRCT_report;

patient(String patient_name, int patient_age, int patient_oxy_level, int patient_HRCT_report)

{

this.patient_name = patient_name;

this.patient_age = patient_age;

this.patient_oxy_level = patient_oxy_level;

this.patient_HRCT_report = patient_HRCT_report;

}

class Slip3_2

{

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

System.out.println("How many patient you want to insert: ");

int number = sc.nextInt();

patient[] obj = new patient[number];

for(int i = 0; i < number; i++)

{

System.out.println("Enter patient name: ");

String name = sc.next();

System.out.println("Enter patient age: ");

int age = sc.nextInt();

System.out.println("Enter patient oxygen level: ");

int oxylevel = sc.nextInt();

System.out.println("Enter patient HRCT report: ");

int HRCTreport = sc.nextInt();

obj[i] = new patient(name, age, oxylevel, HRCTreport);

}

for(int i = 0; i < number; i++)

{

if(obj[i].patient_oxy_level < 95 && obj[i].patient_HRCT_report > 10)

{

try{

throw new NullPointerException("\n");

}

catch(Exception e)

{

System.out.println("Patient is Covid Positive(+) and Need to Hospitalized");

}

else

{

System.out.println("Patient name: "+ obj[i].patient_name);

System.out.println("Patient age " + obj[i].patient_age);

System.out.println("Patient oxygen level " +obj[i].patient_oxy_level);

System.out.println("Patient HRCT report " + obj[i].patient_HRCT_report);

System.out.println();

}

How to run it:

Slip No. 4

/* Q1) Write a program to print an array after changing the rows and columns of a given

two-dimensional array.*/

import java.util.*;

class Slip4_1{

public static void main(String args[])

{

System.out.println("Enter the number of rows and columns: ");

Scanner sc = new Scanner(System.in);

int r = sc.nextInt();

int c = sc.nextInt();

int matrix[][] = new int[r][c];

System.out.println("Enter the element of matrix: ");

for(int i = 0; i < r; i++)

{

for(int j = 0; j < c; j++)

{

matrix[i][j] = sc.nextInt();

}

System.out.println("The Original matrix: ");

for(int i = 0; i < r; i++)

{

for(int j = 0; j < c; j++)

{

System.out.print(matrix[i][j] + " ");

}

System.out.println();

}

System.out.println("After changing rows and columns of matrix: ");

for(int i = 0; i < c; i++)

{

for(int j = 0; j < r; j++)

{

System.out.print(matrix[j][i] + " ");

}

System.out.println();

}

How to run it:

/* Write a program to design a screen using AWT that will take a user name and password.

If the user name and password are not same, raise an Exception with appropriate message.

User can have 3 login chances only. Use clear button to clear the TextFields. */

import java.awt.*;

import java.awt.event.*;

class InvalidPasswordException extends Exception

{

InvalidPasswordException()

{

System.out.println("Invalid User name and Password.");

}

class LoginForm extends Frame implements ActionListener

{

Label name, password;

TextField uname, upassword, msg;

Button login, clear;

Panel p;

int attempt = 0;

char c = '*';

LoginForm(String title)

{

super(title);

setLayout(new FlowLayout());

name = new Label("User name : ");

uname = new TextField(20);

password = new Label("Password : ");

upassword = new TextField(20);

upassword.setEchoChar(c);

msg = new TextField(10);

msg.setEditable(false);

p = new Panel();

p.setLayout(new GridLayout(2, 2, 5, 5));

p.add(name);

p.add(uname);

p.add(password);

p.add(upassword);

clear = new Button("Clear");

clear.addActionListener(this);

p.add(login);

p.add(clear);

p.add(msg);

add(p);

setSize(500, 500);

setVisible(true);

addWindowListener(new WindowAdapter(){

public void windowClosing(WindowEvent e)

{

dispose();

}

});

}

public void actionPerformed(ActionEvent ae)

{

Button btn = (Button)(ae.getSource());

if(attempt < 3)

{

if((btn.getLabel()) == "Clear")

{

uname.setText("");

upassword.setText("");

}

if((btn.getLabel()) == "Login")

{

try{

String user = uname.getText();

String passwd = upassword.getText();

if(user.compareTo(passwd) == 0)

{

msg.setText("Valid");

System.out.println("Username is valid");

}

else{

throw new InvalidPasswordException();

}

catch(Exception e)

{

msg.setText("Error");

}

attempt++;

}

else{

System.out.println("You are using 3 attempt");

System.exit(0);

}

class Slip4_2

{

public static void main(String[] args) {

new LoginForm("Login Form");

}

How to run it:

Slip No. 5

/* Q1) Write a program for multilevel inheritance such that Country is inherited from Continent.

State is inherited from Country. Display the place, State, Country and Continent.*/

import java.io.*;

class Continent

{

String continent;

BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

void continentInput() throws IOException

{

System.out.println("Enter the continent name: ");

continent = br.readLine();

}

class Country extends Continent

{

String country;

void countryInput() throws IOException

{

System.out.println("Enter the country name: ");

country = br.readLine();

}

class State extends Country

{

String state;

void stateInput() throws IOException

{

System.out.println("Enter the state name: ");

state = br.readLine();

}

class Place extends State

{

String place;

void placeInput() throws IOException

{

System.out.println("Enter the place name: ");

place = br.readLine();

}

class Slip5_1

{

public static void main(String args[]) throws IOException

{

Place p = new Place();

p.continentInput();

p.countryInput();

p.stateInput();

p.placeInput();

System.out.println("Place is : " + p.place);

System.out.println("State is : " + p.state);

System.out.println("Country is : " + p.country);

System.out.println("Continent is : " + p.continent);

}

How to run it:

/* Q2) Write a menu driven program to perform the following operations on multidimensional array

ie matrices :

1. Addition

2. Multiplication

3. Exit

import java.util.*;

class MatrixOperations

{

public int[][] getMatrixInput(String name)

{

Scanner sc = new Scanner(System.in);

System.out.println("Enter number of rows for "+ name + ": ");

int rows = sc.nextInt();

System.out.println("Enter number of columns for "+ name + ": ");

int columns = sc.nextInt();

int matrix[][] = new int[rows][columns];

System.out.println("Enter elements for " + name + ": ");

for(int i = 0; i < rows; i++)

{

for(int j = 0; j < columns; j++)

{

System.out.print("Enter element [" + i + "][" + j + "]:");

matrix[i][j] = sc.nextInt();

}

return matrix;

}

public void printMatrix(int matrix[][])

{

System.out.println("The given matrix is:");

for(int i = 0; i < matrix.length; i++)

{

for(int j = 0; j < matrix[0].length; j++)

{

System.out.print(matrix[i][j] + "\t");

}

System.out.println();

}

public int[][] addMatrices(int matrix1[][], int matrix2[][])

{

if(matrix1.length != matrix2.length || matrix1[0].length != matrix2[0].length)

{

System.out.println("Matrices must have the same dimensions for addition.");

return null;

}

int rows = matrix1.length;

int columns = matrix1[0].length;

int sumMatrix[][] = new int[rows][columns];

for(int i = 0; i < rows; i++)

{

for(int j = 0; j < columns; j++)

{

sumMatrix[i][j] = matrix1[i][j] + matrix2[i][j];

}

return sumMatrix;

}

public int[][] multiplyMatrices(int matrix1[][], int matrix2[][])

{

if(matrix1[0].length != matrix2.length)

{

System.out.println("Number of columns in Matrix 1 must be equal to number of rows in Matrix 2 for multiplication. ");

return null;

}

int rows = matrix1.length;

int columns1 = matrix1[0].length;

int columns2 = matrix2[0].length;

int productMatrix[][] = new int[rows][columns2];

for(int i = 0; i < rows; i++)

{

for(int j = 0; j < columns2; j++)

{

for(int k = 0; k < columns1; k++)

{

productMatrix[i][j] += matrix1[i][k] * matrix2[k][j];

}

return productMatrix;

}

class Slip5_2

{

public static void main(String args[])

{

Scanner sc = new Scanner(System.in);

int choice;

MatrixOperations m = new MatrixOperations();

int matrix1[][] = m.getMatrixInput("Matrix 1");

int matrix2[][] = m.getMatrixInput("Matrix 2");

do{

System.out.println("\n Matrix Operations Menu: ");

System.out.println("1. Addition");

System.out.println("2. Multiplication");

System.out.println("3. Exit");

System.out.println("Enter your choice: ");

choice = sc.nextInt();

switch (choice) {

case 1:

int addMatrix[][] = m.addMatrices(matrix1, matrix2);

m.printMatrix(addMatrix);

break;

case 2:

int productMatrix[][] = m.multiplyMatrices(matrix1, matrix2);

m.printMatrix(productMatrix);

break;

case 3:

System.out.println("Exiting program. Good Bye!!!");

break;

default:

System.out.println("Invalid choice. Please try again.");

}

}while(choice != 3);

sc.close();

}

How to run it:

Slip No. 6

/** Q1) Write a program to display the Employee(Empid, Empname, Empdesignation, Empsal) information using toString(). */

class Employee

{

int Empid, Empsal;

String Empname, Empdesignation;

Employee(int id, String name, String designation, int salary)

{

Empid = id;

Empname = name;

Empdesignation = designation;

Empsal = salary;

}

public String toString()

{

return "Employee[Employee id = "+Empid+", Employee Name = "+Empname+", Employee Designation = "+Empdesignation+", Employee Salary = "+Empsal+"]";

}

class Slip6_1

{

public static void main(String args[])

{

Employee e = new Employee(1, "Sunil", "Manager", 450000);

System.out.println(e.toString());

}

How to run it:

/** Q2) Create an abstract class “order” having members id, description. Create two subclasses “Purchase Order” and “Sales Order” having members customer name and Vendor name respectively. Define methods accept and display in all cases. Create 3 objects each of Purchase Order and Sales Order and accept and display details. */

import java.io.*;

abstract class Order

{

int id;

String description;

}

class PurchaseOrder extends Order

{

String Customername, Vendorname;

public void accept() throws IOException

{

System.out.println("Enter the id, description, names of customers and vendors: ");

BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

id = Integer.parseInt(br.readLine());

description = br.readLine();

Customername = br.readLine();

Vendorname = br.readLine();

}

public void display()

{

System.out.println("id: "+ id);

System.out.println("Description: "+ description);

System.out.println("Customername: "+ Customername);

System.out.println("Vendorname: "+ Vendorname);

}

class SalesOrder extends Order

{

String Customername,Vendorname;

public void accept() throws IOException

{

System.out.println("Enter the id, description, names of customers and vendors: ");

BufferedReader br=new BufferedReader(new InputStreamReader(System.in));

id = Integer.parseInt(br.readLine());

description = br.readLine();

Customername = br.readLine();

Vendorname = br.readLine();

}

public void display()

{

System.out.println("id: "+ id);

System.out.println("Description: "+ description);

System.out.println("Customername: "+ Customername);

System.out.println("Vendorname: "+ Vendorname);

}

class Slip6_2

{

public static void main(String [] args) throws IOException

{

int i;

System.out.println("Enter your Choice: ");

BufferedReader br=new BufferedReader(new InputStreamReader(System.in));

System.out.println("1. Purchase Order");

System.out.println("2. Sales Order");

int ch = Integer.parseInt(br.readLine());

switch(ch)

{

case 1:

System.out.println("Enter the number of purchase Orders: ");

int n = Integer.parseInt(br.readLine());

PurchaseOrder []p = new PurchaseOrder[n];

for(i = 0; i < n; i++)

{

p[i] = new PurchaseOrder();

p[i].accept();

}

for(i=0;i<n;i++)

{

p[i].display();

}

break;

case 2:

System.out.println("Enter the number of sales orders: ");

int m = Integer.parseInt(br.readLine());

SalesOrder []s = new SalesOrder[m];

for(i = 0; i < m; i++)

{

s[i] = new SalesOrder();

s[i].accept();

}

for(i = 0; i < m; i++)

{

s[i].display();

}

break;

}

How to run it:

Slip No. 7

/* Q. 1) Design a class for Bank. Bank class should support following operations.

a. Deposit a certain amount into an account

b. Withdraw a certain amount from an account

c. Return a Balance value specifying the amount with details.

import java.util.*;

class Bank

{

private String accno;

private String name;

private String acc_type;

private long balance;

Scanner sc = new Scanner(System.in);

//method to open new account

public void openAccount() {

System.out.print("Enter Account No: ");

accno = sc.next();

System.out.print("Enter Account type: ");

acc_type = sc.next();

System.out.print("Enter Name: ");

name = sc.next();

System.out.print("Enter Balance: ");

balance = sc.nextLong();

}

//method to display account details

public void showAccount() {

System.out.println("Name of account holder: " + name);

System.out.println("Account no.: " + accno);

System.out.println("Account type: " + acc_type);

System.out.println("Balance: " + balance);

}

//method to deposit money

public void deposit() {

long amt;

System.out.println("Enter the amount you want to deposit: ");

amt = sc.nextLong();

balance = balance + amt;

}

//method to withdraw money

public void withdrawal() {

long amt;

System.out.println("Enter the amount you want to withdraw: ");

amt = sc.nextLong();

if (balance >= amt) {

balance = balance - amt;

System.out.println("Balance after withdrawal: " + balance);

} else {

System.out.println("Your balance is less than " + amt + "\tTransaction failed...!!" );

}

//method to search an account number

public boolean search(String ac_no) {

if (accno.equals(ac_no)) {

showAccount();

return (true);

}

return (false);

}

public class Slip7_1 {

public static void main(String arg[]) {

Scanner sc = new Scanner(System.in);

//create initial accounts

System.out.print("How many number of customers do you want to input? ");

int n = sc.nextInt();

Bank C[] = new Bank[n];

for (int i = 0; i < C.length; i++) {

C[i] = new Bank();

C[i].openAccount();

}

// loop runs until number 5 is not pressed to exit

int ch;

do {

System.out.println("\n ***Banking System Application***");

System.out.println("\n1. Display all account details \n2. Search by Account number\n3. Deposit the amount \n4. Withdraw the amount \n5. Exit ");

System.out.println("Enter your choice: ");

ch = sc.nextInt();

switch (ch) {

case 1:

for (int i = 0; i < C.length; i++) {

C[i].showAccount();

}

break;

case 2:

System.out.print("Enter account no. you want to search: ");

String ac_no = sc.next();

boolean found = false;

for (int i = 0; i < C.length; i++) {

found = C[i].search(ac_no);

if (found) {

break;

}

if (!found) {

System.out.println("Search failed! Account doesn't exist..!!");

}

break;

case 3:

System.out.print("Enter Account no. : ");

ac_no = sc.next();

found = false;

for (int i = 0; i < C.length; i++) {

found = C[i].search(ac_no);

if (found) {

C[i].deposit();

break;

}

if (!found) {

System.out.println("Search failed! Account doesn't exist..!!");

}

break;

case 4:

System.out.print("Enter Account No : ");

ac_no = sc.next();

found = false;

for (int i = 0; i < C.length; i++) {

found = C[i].search(ac_no);

if (found) {

C[i].withdrawal();

break;

}

if (!found) {

System.out.println("Search failed! Account doesn't exist..!!");

}

break;

case 5:

System.out.println("See you soon...");

break;

}

while (ch != 5);

}

How to run it:

/** Write a program to accept a text file from user and display the contents of a file in reverse order and change its case.*/

import java.io.*;

class Slip7_2

{

public static void main(String args[]) throws IOException

{

BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

System.out.println("Enter file name: ");

String fname = br.readLine();

File f = new File(fname);

if(f.isFile())

{

BufferedInputStream bis = new BufferedInputStream(new FileInputStream(fname));

int size = bis.available();

for(int i = size-1; i >= 0; i--)

{

bis.mark(i);

bis.skip(i);

char ch = (char)bis.read();

if(Character.isLowerCase(ch))

ch = Character.toUpperCase(ch);

else if (Character.isUpperCase(ch))

ch = Character.toLowerCase(ch);

System.out.print(ch);

bis.reset();

}

bis.close();

}

else

System.out.println("File not found");

}

How to run it:

First create a text file in current folder. e.g. input.txt

Slip No. 8

/** Q1) Create a class Sphere, to calculate the volume and surface area of sphere. (Hint : Surface area=4*3.14(r*r), Volume=(4/3)3.14(r*r*r))*/

class Sphere

{

int radius;

Sphere(int radius)

{

this.radius = radius;

}

double calculateVolume()

{

return (4/3) * 3.14 * (radius * radius * radius);

}

double calculateSurfaceArea()

{

return (4 * 3.14 * (radius * radius));

}

class Slip8_1

{

public static void main(String args[])

{

Sphere s = new Sphere(3);

System.out.println("The volume of Sphere : " + s.calculateVolume());

System.out.println("The surface area of Sphere : " + s.calculateSurfaceArea());

}

How to run it:

/** Q2) Design a screen to handle the Mouse Events such as MOUSE_MOVED and MOUSE_CLICKED and display the position of the Mouse_Click in a TextField. */

import java.awt.*;

import java.awt.event.*;

class MyFrame extends Frame

{

Label l, l1;

TextField t, t1;

int x, y;

Panel p;

MyFrame(String title)

{

super(title);

setLayout(new FlowLayout()); // Frame

p = new Panel();

p.setLayout(new GridLayout(2, 2, 5, 5));

l = new Label("Co-ordinates of clicking");

t = new TextField(20);

l1 = new Label("Co-ordinates of movement");

t1 = new TextField(20);

p.add(l);

p.add(t);

p.add(l1);

p.add(t1);

add(p);

addMouseListener(new MyClick());

addMouseMotionListener(new MyMove());

setSize(500, 500);

setVisible(true);

addWindowListener(new WindowAdapter(){

public void windowClosing(WindowEvent e)

{

dispose();

}

});

}

class MyClick extends MouseAdapter

{

public void mouseClicked(MouseEvent me)

{

x = me.getX();

y = me.getY();

t.setText("X = "+ x + " Y = " + y);

}

class MyMove extends MouseMotionAdapter

{

public void mouseMoved(MouseEvent me)

{

x = me.getX();

y = me.getY();

t1.setText("X = "+ x + " Y = " + y);

}

class Slip8_2

{

public static void main(String[] args) {

new MyFrame("Slip Number 8");

}

How to run it:

Slip No. 11

/** Q1) Define an interface “Operation” which has method volume( ).Define a constant PI having a value 3.142 Create a class cylinder which implements this interface (members – radius, height). Create one object and calculate the volume. (V = PI * r * r * h) */

interface Operation

{

double PI = 3.142;

public double volume();

}

class Cylinder implements Operation

{

int radius, height;

Cylinder(int r, int h)

{

radius = r;

height = h;

}

public double volume()

{

return (PI * radius * radius * height);

}

class Slip11_1

{

public static void main(String args[])

{

Cylinder c = new Cylinder(2, 5);

System.out.println("The volume of Cylender is : " + c.volume());

}

How to run it:

/** Q2) Write a program to accept the username and password from user if username and password are not same then raise "Invalid Password" with appropriate msg. */

import java.util.*;

class InvalidPasswordException extends Exception

{

InvalidPasswordException()

{

System.out.println("Invalid Password");

}

class Slip11_2

{

public static void main(String[] args) {

String username, password;

Scanner sc = new Scanner(System.in);

try

{

System.out.println("Enter the username: ");

username = sc.next();

System.out.println("Enter the password: ");

password = sc.next();

if (username.compareTo(password) != 0)

{

throw new InvalidPasswordException();

}

else

{

System.out.println("Username and Password are matched...");

}

catch(InvalidPasswordException ip)

{

}

finally{

sc.close();

}

How to run it:

Slip No. 13

/** Q1) Write a program to accept a file name from command prompt, if the file exits then display number of words and lines in that file.*/

import java.io.*;

class Slip13_1

{

public static void main(String args[]) throws IOException

{

File f = new File(args[0]);

if(f.exists())

{

BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream(f)));

String line;

int wordCount = 0, lineCount = 0;

while((line = br.readLine()) != null)

{

lineCount++;

String words[] = line.split("\\s+");

wordCount += words.length;

}

System.out.println("Total number of words : " + wordCount);

System.out.println("Total number of lines : " + lineCount);

}

else

{

System.out.println(args[0] + " does not exists.");

}

How to run it:

Create input.txt file and write some data into it.

/** Write a java program to display the system date and time in various

formats shown below:

Current date is : 31/08/2021

Current date is : 08-31-2021

Current date is : Tuesday August 31 2021

Current date and time is : Fri August 31 15:25:59 IST 2021

Current date and time is : 31/08/21 15:25:59 PM +0530

Note: Use java.util.Date and java.text.SimpleDateFormat class

import java.util.Date;

import java.text.SimpleDateFormat;

class Slip13_2{

public static void main(String args[])

{

Date date = new Date();

/* Current date is : 31/08/2021 */

SimpleDateFormat formatter = new SimpleDateFormat("dd/MM/yyyy");

String strDate= formatter.format(date);

System.out.println("Current date is : " + strDate);

/* Current date is : 08-31-2021 */

formatter = new SimpleDateFormat("MM-dd-yyyy");

strDate= formatter.format(date);

System.out.println("Current date is : " + strDate);

/* Current date is : Tuesday August 31 2021 */

formatter = new SimpleDateFormat("EEEEE, MMMMM dd yyyy");

strDate= formatter.format(date);

System.out.println("Current date is : " + strDate);

/* Current date and time is : Fri August 31 15:25:59 IST 2021 */

formatter = new SimpleDateFormat("E, MMMMM dd HH:mm:ss z yyyy");

strDate = formatter.format(date);

System.out.println("Current date and time is : " + strDate);

/* Current date and time is : 31/08/21 15:25:59 PM +0530 */

formatter = new SimpleDateFormat("dd/MM/yy HH:mm:ss a Z");

strDate = formatter.format(date);

System.out.println("Current date and time is : " + strDate);

}

How to run it:

Slip No. 14

/** Q1) Write a program to accept a number from the user, if number is zero then throw user defined

exception “Number is 0” otherwise check whether no is prime or not (Use static keyword). */

import java.io.*;

class ZeroNumExc extends Exception{}

public class Slip14_2 {

static int n;

public static void main(String args[]){

try {

BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

System.out.print("Enter Number : ");

n = Integer.parseInt(br.readLine());

if(n == 0)

{

throw new ZeroNumExc();

}

else

{

if(n == 1)

{

System.out.println(n + " is not a prime nor a composite.");

}

else{

boolean flag = true;

for (int i = 2; i < n; i++)

{

if(n%i == 0)

{

flag = false;

break;

}

if(flag)

System.out.println("Given number is prime.");

else

System.out.println("Given number is not prime.");

}

} catch (ZeroNumExc nz) {

System.out.println("Number is 0");

}

catch(Exception e){}

}

How to run it:

/** Q2) Write a Java program to create a Package “SY” which has a class SYMarks (members – ComputerTotal, MathsTotal, and ElectronicsTotal). Create another package TY which has a class TYMarks (members – Theory, Practicals). Create ‘n’ objects of Student class (having rollNumber, name, SYMarks and TYMarks). Add the marks of SY and TY computer subjects and calculate the Grade (‘A’ for >= 70, ‘B’ for >= 60 ‘C’ for >= 50, Pass Class for > =40 else ‘FAIL’) and display the result of the student in proper format.*/

1) First to create SY folder and save the SYMarks.java file into it.

package SY;

import java.io.*;

public class SYMarks

{

public int ComputerTotal, MathsTotal, ElectronicTotal;

public void set() throws IOException

{

BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

System.out.println("Enter the Computer Total Marks out of 200");

ComputerTotal = Integer.parseInt(br.readLine());

System.out.println("Enter the Maths Total Marks out of 200");

MathsTotal = Integer.parseInt(br.readLine());

System.out.println("Enter the Electronic Total Marks out of 200");

ElectronicTotal = Integer.parseInt(br.readLine());

}

2) After that to create TY folder and save the TYMarks.java file into it.

package TY;

import java.io.*;

public class TYMarks

{

public int Theory, Practicals;

public void set() throws IOException

{

BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

System.out.println("Enter the Theory Marks out of 400");

Theory = Integer.parseInt(br.readLine());

System.out.println("Enter the Practicals Marks out of 200");

Practicals = Integer.parseInt(br.readLine());

}

3) In current folder (Outside of SY and TY) and save the Student.java file into it.

import SY.SYMarks;

import TY.TYMarks;

import java.io.*;

class Student

{

int rollNumber;

String name, grade;

public float grandTotal, syTotal, tyTotal;

public float per;

public void set() throws IOException

{

BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

System.out.println("Enter roll number of the student");

rollNumber = Integer.parseInt(br.readLine());

System.out.println("Enter name of the student");

name = br.readLine();

}

public static void main(String args[]) throws IOException

{

BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

System.out.println("Enter number of the students");

int n = Integer.parseInt(br.readLine());

SYMarks sy[] = new SYMarks[n];

TYMarks ty[] = new TYMarks[n];

Student s[] = new Student[n];

for (int i = 0; i < n; i++)

{

s[i] = new Student();

sy[i] = new SYMarks();

ty[i] = new TYMarks();

s[i].set();

sy[i].set();

ty[i].set();

s[i].syTotal = sy[i].ComputerTotal + sy[i].MathsTotal + sy[i].ElectronicTotal;

s[i].tyTotal = ty[i].Theory + ty[i].Practicals;

s[i].grandTotal = s[i].syTotal + s[i].tyTotal;

s[i].per = (s[i].grandTotal/1200)*100;

if(s[i].per>=70)

s[i].grade="A";

else if(s[i].per>=60)

s[i].grade="B";

else if(s[i].per>=50)

s[i].grade="C";

else if(s[i].per>=40)

s[i].grade="Pass";

else

s[i].grade="Fail";

}

System.out.println("Roll No\tName\tSyTotal\tTyTotal\tGrandTotal\tPercentage\tGrade");

for(int i=0;i<n;i++)

{

System.out.println(s[i].rollNumber+"\t"+s[i].name+"\t"+s[i].syTotal+"\t"+s[i].tyTotal+"\t"+s[i].grandTotal+"\t\t"+s[i].per+"\t\t"+s[i].grade);

}

How to run it:

Slip No. 15

/** Q1) Accept the names of two files and copy the contents of the first to the second. First file having Book name and Author name in file.*/

import java.io.*;

class Slip15_1

{

public static void main(String args[]) throws IOException

{

BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

System.out.println("Enter first file name: ");

String iFile = br.readLine();

System.out.println("Enter second file name: ");

String oFile = br.readLine();

File ifile = new File(iFile);

File ofile = new File(oFile);

try{

FileReader in = new FileReader(ifile);

FileWriter out = new FileWriter(ofile, true);

int ch;

while((ch = in.read()) != -1)

{

out.write(ch);

}

System.out.println("Copy the contents of the first to the second file successfully.");

in.close();

out.close();

}

catch(IOException e)

{

System.out.println(e);

System.exit(-1);

}

How to run it:

Create two text file named as first.txt and second.txt. First file contains the data Name Book and Author name:

/** Q2) Write a program to define a class Account having members custname, accno. Define default and parameterized constructor. Create a subclass called SavingAccount with member savingbal, minbal. Create a derived class AccountDetail that extends the class SavingAccount with members, depositamt and withdrawalamt. Write a appropriate method to display customer details. */

class Account

{

String custname;

double accno;

Account()

{

custname = "";

accno = 0.0;

}

Account(String custname, double accno)

{

this.custname = custname;

this.accno = accno;

}

class SavingAccount extends Account

{

double savingbal;

double minbal;

SavingAccount(String custname, double accno, double savingbal, double minbal)

{

super(custname, accno);

this.savingbal = savingbal;

this.minbal = minbal;

}

class AccountDetails extends SavingAccount

{

double depositeamt;

double withdrawalamt;

AccountDetails(String custname, double accno, double savingbal, double minbal, double depositeamt, double withdrawalamt)

{

super(custname, accno, savingbal, minbal);

this.depositeamt = depositeamt;

this.withdrawalamt = withdrawalamt;

}

void DispayDetails()

{

System.out.println("The Customer Details :");

System.out.println("The Customer Name :" + custname);

System.out.println("The Customer Account Number :" + accno);

System.out.println("The Customer Saving Balance :" + savingbal);

System.out.println("The Customer Minimum Balance :" + minbal);

System.out.println("The Deposte Amount :" + depositeamt);

System.out.println("The withdrawal Amount :" + withdrawalamt);

}

class Slip15_2

{

public static void main(String[] args) {

AccountDetails ad = new AccountDetails("ABC", 123, 12500, 500, 250, 1000);

ad.DispayDetails();

}

How to run it:

First Year Web Technology Practical Slips Solution

2025-04-15T18:24:00.009+05:30

Web Technology Practical Slips Solution

*******************************

File Name : FYBBA_Practical_1.html

Q1. Write a JavaScript program to calculate the volume of a sphere.

------------------------------------------------------------------->

<!DOCTYPE html>

<html>

<head>

<title> To calculate the volume of a sphere. </title>

.ContainerBox{

margin: 20% auto;

width: 50%;

border: 2px solid #ddd;

padding: 10px;

text-align: center;

}

</style>

</head>

<body>

<label>Input radius value and get the volume of a

sphere.</label>

<label>Radius</label><br>

<label>Volume</label><br>

<input type="text" name="volume" id="volume"

placeholder="0.0000">

<button onclick="calculateVolume()">Calculate</button>

</div>

/* Function To Calculated Volume of the Sphere */

function calculateVolume(){

/* Get the radius from input field */

var radius = document.getElementById("radius").value;

/* Calculate the volume of the sphere using 4/3*PI*radius^3 */

var volume = (4/3)*3.14*radius*radius*radius;

/* Set the volume to volume input field. */

document.getElementById("volume").value = volume;

}

</script>

</body>

</html>

*******************************

File Name : FYBBA_Practical_2.html

Q2. Create HTML page to Divide the frames in to different sections as shown below and add appropriate HTML files to each frame.

------------------------------------------------------------------->

<!DOCTYPE html>

<html>

<head>

<title>Create HTML page to Divide the frames into

different section</title>

</head>

<body>

</body>

</html>

*******************************

File Name : First_Frame.html

<!DOCTYPE html>

<html>

<head>

<title>First Frame</title>

</head>

<body>

<center><h1>Sunil Valmik Bhagwat</h1>

<p> At - Gavandgaon Post - Suregaon Raste

Tal - Yeola Dist - Nashik </p></center>

</body>

</html>

*******************************

File Name : Second_Frame.html

<!DOCTYPE html>

<html>

<head>

<title>Second Frame</title>

</head>

<body>

<h4>Bulleted list of favourite colours</h4>

<ol>

<li>Orange</li>

<li>Purple</li>

</ol>

</body>

</html>

*******************************

File Name : Third_Frame.html

<!DOCTYPE html>

<html>

<head>

<title>Third Frame</title>

</head>

<body>

<h4> Numbered List of City : </h4>

<ol>

<li>Nashik</li>

<li>Mumbai</li>

<li>Dhule</li>

</ol>

</body>

</html>

*******************************

File Name : Four_Frame.html

<!DOCTYPE html>

<html>

<head>

<title>Fourth Frame</title>

</head>

<body>

<h5>Scrolling Message</h5>

<h3>

Lorem Ipsum is simply dummy text of the printing and typesetting industry. Lorem Ipsum has been the industry's standard dummy text ever since the 1500s, when an unknown printer took a galley of type and scrambled it to make a type specimen book.

It has survived not only five centuries, but also the leap into electronic typesetting, remaining essentially unchanged. It was popularised in the 1960s with the release of Letraset sheets containing

</h3>

</body>

</html>

*******************************

File Name : Fifth_Frame.html

<!DOCTYPE html>

<html>

<head>

<title>Fifth Frame</title>

<style>

.blink

{

animation: blinker 0.6s linear infinite;

color: pink;

font-size: 20px;

font-weight: bold;

}

@keyframes blinker

{

50% { opacity: 0;

}

</style>

</head>

<body>

<h5>Blinking Reminders</h5>

<h4 class="blink"> Here is your text that has to blink. </h4>

</body>

</html>

*******************************

File Name : Six_Frame.html

<!DOCTYPE html>

<html>

<head>

<title>Third Frame</title>

</head>

<body>

<h4> Name of Countries : </h4>

<ol>

<li>India</li>

<li>Mumbai</li>

<li>Dhule</li>

</ol>

</body>

</html>

*******************************

File Name : FYBBA_Practical_3.html

Q1. Write a java script program to accept a number form user and

display its multiplication table

------------------------------------------------------------------->

<!DOCTYPE html>

<html>

<head>

<title> To Display the Multiplication Table.</title>

.ContainerBox{

margin: 5% auto;

width: 50%;

border: 2px solid #ddd;

padding: 10px;

text-align: center;

}

table{

margin: 0 auto;

}

</style>

</head>

<body>

<label>Enter the number you want to display

multiplication table : </label>

Get Multiplication Table

</button>

</div>

/* Function To Calculated Multiplication Table */

function multiplicationTable(){

/* Get the number from input field */

var num = document.getElementById("num").value;

// Table to display multiplication table

var string = "<label>Multiplication Table</label>

<tr>

<th>Index</th>

<th>Value</th>";

// for loop to create table row and data

for(var row = 1; row <= 10; row++){

string += "<tr><td>"+row+"</td><td>"

+ row * num + "</td></tr>";

}

string += "</table>";

document.getElementById("demo").innerHTML = string;

}

</script>

</body>

</html>

*******************************

File Name : FYBBA_Practical_4.html

Q.2 Write the HTML code to create the following table. Use internal CSS to format the table

------------------------------------------------------------------->

<!DOCTYPE html>

<html>

<head>

<title> To Create the Table. </title>

table, th, td{

border: 1px solid #ddd;

padding: 15px;

border-collapse: collapse;

margin: auto;

}

</style>

</head>

<body>

<table>

<tr>

<th colspan="2" width="70%">Price</th>

</tr>

<tr>

<th style="text-align: left;">Paise</th>

</tr>

<tr>

</tr>

<tr>

</tr>

<tr>

</tr>

<tr>

</tr>

<tr>

</tr>

</table>

</body>

</html>

*******************************

File Name : FYBBA_Practical_5.html

Q1. Write a java script program to accept a number from user and calculate and display its sum of digits

------------------------------------------------------------------->

<!DOCTYPE html>

<html>

<head>

<title> To Display the Sum of Digits of Number.</title>

.ContainerBox{

margin: 5% auto;

width: 50%;

border: 2px solid #ddd;

padding: 10px;

text-align: center;

}

</style>

</head>

<body>

<label>Enter the number : </label>

<button onclick="calculateSum();">Calculate Sum</button>

<label>The of accepted number is :</label>

</div>

/* Function To Calculated Multiplication Table */

function calculateSum(){

/* Get the number from input field */

var num = parseInt(document.getElementById("num").value);

var sum = 0;

while(num > 0){

sum += (num % 10);

num = (num / 10);

}

document.getElementById("demo").innerHTML = parseInt(sum);

}

</script>

</body>

</html>

*******************************

File Name : FYBBA_Practical_6.html

Q2. Write HTML code to design a web as per given specification. Divide the browser screen into two frames. The first frame will display the heading.

Divide the second frame into two columns. The frame on the left should be name of cities consisting of hyperlinks.

Clicking on any one of these hyperlinks will display related information in right hand side name as shown below

------------------------------------------------------------------->

<!DOCTYPE html>

<html>

<head>

<title> Divide the browser screen into two frames.</title>

</head>

<body>

</body>

</html>

*******************************

File Name : IT_Industry_Frame.html

<!DOCTYPE html>

<html>

<head>

<title>IT Industry City Name Frame</title>

</head>

<body>

<ol>

<li><a href="mumbai.html" target="C">Mumbai</a></li>

</ol>

</body>

</html>

*******************************

File Name : pune.html

<!DOCTYPE html>

<html>

<head>

<title>IT Industry Detail Frame</title>

</head>

<body>

<ul>

<li>Infosys</li>

<li>Persistent</li>

</ul>

</body>

</html>

*******************************

File Name : mumbai.html

<!DOCTYPE html>

<html>

<head>

<title>IT Industry Detail Frame</title>

</head>

<body>

<h1> Mumbai </h1>

<ul>

<li>Persistent</li>

</ul>

</body>

</html>

*******************************

File Name : IT_Industry_Frame.html

<!DOCTYPE html>

<html>

<head>

<title>IT Industry Title Frame</title>

</head>

<body>

<center><h1>IT Industries in INDIA</h1>

</body>

</html>

*******************************

File Name : FYBBA_Practical_7.html

Q1. Write a java script program to accept a number from user and

check whether it is Armstrong number or not

------------------------------------------------------------------->

<!DOCTYPE html>

<html>

<head>

<title>

Check whether given number is Armstrong number or not.

</title>

.ContainerBox{

margin: 5% auto;

width: 50%;

border: 2px solid #ddd;

padding: 10px;

text-align: center;

}

</style>

</head>

<body>

<label>Enter the number : </label>

<button onclick="calculateArmstrongNumber();">Submit</button>

<label>Result :</label>

</div>

/* Function To Calculated Multiplication Table */

function calculateArmstrongNumber(){

/* Get the number from input field */

var num = parseInt(document.getElementById("num").value);

var sum = 0, num1 = 0, temp = 0;

temp = num;

while(temp > 0){

num1 = (temp % 10);

temp = parseInt(temp / 10);

sum += (num1*num1*num1);

}

if(sum == num){

document.getElementById("demo").innerHTML = "The of accepted number is <b>Armstrong number</b>";

}

else{

document.getElementById("demo").innerHTML = "The of accepted number is <b>not Armstrong number<b>";

}

</script>

</body>

</html>

*******************************

File Name : FYBBA_Practical_8.html

Q2. Create HTML web page with following specifications [25]

i) Title should be about your College.

ii) Put image in the background

iii) Place your college name at the top of page in large text followed by

address in smaller size.

iv) Add names of courses offered, each in different color, style and font

v) Add scrolling text about college.

vi) Add any image at the bottom.

(use External CSS to format the webpage)

------------------------------------------------------------------->

<!DOCTYPE html>

<html>

<head>

<title> N.V.P. College. Lasalgaon</title>

body{

background: url("nvp.png");

background-size: cover;

background-position: center;

background-repeat: no-repeat;

background-attachment: fixed;

}

h1{

color: white;

text-align: center;

font-size: 60px;

font-weight: 900;

}

h1 span{

font-size: 30px;

}

address{

text-align: center;

color: white;

font-size: 20px;

}

h4{

Color: red;

font-size :30px;

}

p {

font-size: 25px;

color:blue;

font-family :"Times new roman";

font-style:italic;

}

div {

background-color: lightblue;

width: 600px;

height: 150px;

overflow: scroll;

}

img {

border: 1px solid red;

border-radius: 4px;

padding: 5px;

width: 150px;

}

</style>

</head>

<body>

<h1> <span>Nutan Vidya Prasarak Mandal's</span>

<br> Arts, Commerce and Science College.

</h1>

<address> Lasalgaon (Nashik) </address>

<h4> Course Offered </h4>

<p> BBA(Computer Application)</p>

<div>

We have been in education from 1967, during which time we have helped

thousands of students to find their career paths and improve their job

prospects. We have transportable qualifications, big infrastructure,

comfortable learning environment, high level of personal student care and

the dedicated lecturers who eagerly share their knowledge and expertise with

students.

We have been in education from 1967, during which time we have helped

thousands of students to find their career paths and improve their job

prospects. We have transportable qualifications, big infrastructure,

comfortable learning environment, high level of personal student care and

the dedicated lecturers who eagerly share their knowledge and expertise with

students.

</div>

</body>

</html>

*******************************

File Name : Slip_4_1.html

<!-- ---------------------------------------------------------------

Q1. Write a java script program to accept a number from user and check whether it is Armstrong number or not

------------------------------------------------------------------->

<!DOCTYPE html>

<html>

<head>

<title> To Check whether it is Armstrong Number or not.</title>

.ContainerBox{

margin: 5% auto;

width: 50%;

border: 2px solid #ddd;

padding: 10px;

text-align: center;

}

</style>

</head>

<body>

<label>Enter the number : </label>

<button onclick="calculate();">Check</button>

<label>The given result :</label>

</div>

function calculate(){

var num = parseInt(document.getElementById("num").value);

var sum = 0, rem = 0, temp = num;

while(temp > 0){

rem = parseInt(temp % 10)

sum += rem * rem * rem;

temp = parseInt(temp / 10);

}

if(num == sum)

document.getElementById("demo").innerHTML = num + " is Armstrong number.";

else

document.getElementById("demo").innerHTML = num + " is not Armstrong number.";

}

</script>

</body>

</html>

*******************************

File Name : Slip_5_1.html

Q1. Write a java script program to accept a number from user and check whether it is perfect number or not.

------------------------------------------------------------------->

<!DOCTYPE html>

<html>

<head>

<title> To Check whether it is perfect Number or not.</title>

.ContainerBox{

margin: 5% auto;

width: 50%;

border: 2px solid #ddd;

padding: 10px;

text-align: center;

}

</style>

</head>

<body>

<label>Enter the number : </label>

<button onclick="calculate();">Check</button>

<label>The given result :</label>

</div>

function calculate(){

var num = parseInt(document.getElementById("num").value);

var sum = 0;

for(var i = 1; i < num; i++){

if(num % i == 0)

sum += i;

}

if(num == sum)

document.getElementById("demo").innerHTML = num + " is perfect number.";

else

document.getElementById("demo").innerHTML = num + " is not perfect number.";

}

</script>

</body>

</html>

*******************************

File Name : Slip_6_1.html

<!-- ---------------------------------------------------------------

Q1. Write java script program to accept a number from user and check whether it is prime number or not

------------------------------------------------------------------->

<!DOCTYPE html>

<html>

<head>

<title> To Check whether it is prime Number or not.</title>

.ContainerBox{

margin: 5% auto;

width: 50%;

border: 2px solid #ddd;

padding: 10px;

text-align: center;

}

</style>

</head>

<body>

<label>Enter the number : </label>

<button onclick="calculate();">Check</button>

<label>The given result :</label>

</div>

/* Function To Calculated Multiplication Table */

function calculate(){

/* Get the number from input field */

var num = parseInt(document.getElementById("num").value);

var flag = 0;

for(var i = 2; i < num; i++){

if(num % i == 0)

flag = 1;

}

if(flag == 0)

document.getElementById("demo").innerHTML = num + " is prime number.";

else

document.getElementById("demo").innerHTML = num + " is not prime number.";

}

</script>

</body>

</html>

*******************************

File Name : Slip_7_1.html

<!-- ---------------------------------------------------------------

Q1. Write a java script program to accept a string from user and display the count of vowel characters from that string

------------------------------------------------------------------->

<!DOCTYPE html>

<html>

<head>

<title> The count of vowel </title>

.ContainerBox{

margin: 5% auto;

width: 50%;

border: 2px solid #ddd;

padding: 10px;

text-align: center;

}

</style>

</head>

<body>

<label>Enter the string : </label>

<button onclick="calculate();">Check</button>

<label>The given result :</label>

</div>

/* Function To Calculated Multiplication Table */

function calculate(){

/* Get the number from input field */

var str = document.getElementById("str").value;

const vowels = "aeiouAEIOU";

var count = 0;

for(const char of str){

if(vowels.includes(char))

count += 1;

}

document.getElementById("demo").innerHTML = "The number of vowels are : " + count;

}

</script>

</body>

</html>

*******************************

File Name : Slip_8_1.html

Q1. Write a java script program to accept a string and character from user

and check the count of occurrences of that character in string.

------------------------------------------------------------------->

<!DOCTYPE html>

<html>

<head>

<title> Check the count of occurrences </title>

.ContainerBox{

margin: 5% auto;

width: 50%;

border: 2px solid #ddd;

padding: 10px;

text-align: center;

}

</style>

</head>

<body>

<label>Enter the string : </label>

<label>Enter the character : </label>

<button onclick="calculate();">Check</button>

<label>The given result :</label>

</div>

function calculate(){

var str = document.getElementById("str").value;

var char = document.getElementById("char").value;

var count = 0;

for(const ch of str){

if(char.includes(ch))

count += 1;

}

document.getElementById("demo").innerHTML = "The " + char +" count of occurrences are : " + count;

}

</script>

</body>

</html>

*******************************

File Name : Slip_9_1.html

Q1. Write a java script program to accept a string and check whether the input string is palindrome string or not

------------------------------------------------------------------->

<!DOCTYPE html>

<html>

<head>

<title> Check whether the input string is palindrome string or not </title>

.ContainerBox{

margin: 5% auto;

width: 50%;

border: 2px solid #ddd;

padding: 10px;

text-align: center;

}

</style>

</head>

<body>

<label>Enter the string : </label>

<button onclick="calculate();">Check</button>

<label>The given result :</label>

</div>

function calculate(){

var str = document.getElementById("str").value;

let rev = str.split("").reverse().join("");

if(rev == str)

document.getElementById("demo").innerHTML = "The given string is palindrome string";

else

document.getElementById("demo").innerHTML = "The given string is not palindrome string";

}

</script>

</body>

</html>

*******************************

File Name : Slip_10_1.html

Q1. Write a JavaScript program to accept a string and a position (number) from user and display the character at specified position

------------------------------------------------------------------->

<!DOCTYPE html>

<html>

<head>

<title> Check whether the input string is palindrome string or not </title>

.ContainerBox{

margin: 5% auto;

width: 50%;

border: 2px solid #ddd;

padding: 10px;

text-align: center;

}

</style>

</head>

<body>

<label>Enter the string : </label>

<label>Enter the positin (number) : </label>

<button onclick="calculate();">Check</button>

<label>The given result :</label>

</div>

function calculate(){

var str = document.getElementById("str").value;

var pos = parseInt(document.getElementById("num").value);

let cstr = str.charAt(pos);

document.getElementById("demo").innerHTML = "The character at " + pos + "th position is : " + cstr;

}

</script>

</body>

</html>

To Connect Java program with the MYSQL Database

2025-02-03T08:53:00.009+05:30

To connect java application with the MYSQL database, first of all to install MYSQL database in your machine.

To install MYSQL in your machine then follow the below steps:

1) To download MYSQL database on its official website : https://dev.mysql.com/downloads/installer/

2) After that double click on this exe file and run the installer. Choose Full setup option and click next.

3) Execute the entire file and wait to complete to install.

4) Next to check product configuration.

5) In this step choose port number. Default port number is 3306. If it was already acquired by other application like WAMP server or apache server, then change its value like 3307 or 3308.

6) After that select authentication method. Select recommended method.

7) Choose password and user account as per your choice.

8) Follow next step and finish the installation process.

Watch this video to install MYSQL installation process: https://youtu.be/QqFWLDSgedg?si=4yvPUXTUQI0DRX2P

To connect java application with the MYSQL Database:

1) Create database in MYSQL database using the following SQL Query.

2) Write JAVA application to connect MYSQL Database and save using “MyDatabase.java” name.

import java.sql.*;

class MyDatabase{

public static void main(String args[]){

try{

Connection con = DriverManager.getConnection("jdbc:mysql://localhost:3309/emp?autoReconnect=true&useSSL=false", "root", "root");

//here emp is database name, root is username and password

if(con!= null){

Statement stmt=con.createStatement();

ResultSet rs=stmt.executeQuery("select * from employee");

while(rs.next())

System.out.println(rs.getInt(1) +" "+ rs.getString(2) +" "+ rs.getInt(3));

}

con.close();

}

catch(Exception e){

System.out.println(e);

}

3) Compile this java program using : javac MyDatabase.java

4) After that run this program with the JDBC connector file download from https://dev.mysql.com/downloads/connector/j/

To run this file using : java -cp mysql-connector-java-8.0.11.jar;. MyDatabase

All right. Your database is connected successfully. If your like this post then share your friends.

SYBSc (CS) Sem III : Data Structure Slip 20 Que - 2

2024-10-19T21:43:00.007+05:30

SAVITIBAI PHULE UNIVERSITY OF PUNE

S. Y. B.Sc. (Computer Science) Semester III

Practical Examination

SUBJECT: CS-233 Practical course based on CS231

/* Q2. There are lists where new elements are always appended at the end of the list. The list can be implemented as a circular list with the external pointer pointing to the last element of the list. Implement singly linked circular list of integers with append and display operations. The operation append(L, n), appends to the end of the list, n integers either accepted from user or randomly generated.*/

#include<stdio.h>

#include<stdlib.h>

struct node

{

int data;

struct node *next;

};

struct node * create(struct node *head)

{

struct node *newnode = NULL, *temp = NULL;

newnode = (struct node*) malloc(sizeof(struct node));

if(newnode!=NULL)

{

printf("Enter node data");

scanf("%d",&(newnode->data));

newnode->next = NULL;

if(head == NULL)

{

head = newnode;

newnode->next = head;

}

else

{

temp = head;

while(temp->next != head)

{

temp = temp->next;

}

temp->next = newnode;

newnode->next = head;

}

return head;

}

struct node * append(struct node *head, int n)

{

struct node *newnode = NULL, *temp = NULL;

newnode = (struct node*) malloc(sizeof(struct node));

newnode->data = n;

newnode->next = NULL;

temp = head;

while(temp->next != head)

{

temp = temp->next;

}

temp->next = newnode;

newnode->next = head;

return head;

}

void display(struct node *head)

{

struct node *temp = head;

{

printf("%d\t", temp->data);

temp = temp->next;

}while(temp != head);

}

int main()

{

int num, i;

struct node *head = NULL;

printf("Enter the number of nodes in list: ");

scanf("%d", &num);

for(i = 0; i < num; i++)

head = create(head);

display(head);

printf("\n enter data to be append:");

scanf("%d",&num);

head = append(head, num);

display(head);

system("pause");

return 0;

}

SYBSc (CS) Sem III : Data Structure Slip 14 Que - 2

2024-10-15T22:42:00.003+05:30

SAVITIBAI PHULE UNIVERSITY OF PUNE

S. Y. B.Sc. (Computer Science) Semester III

Practical Examination

SUBJECT: CS-233 Practical course based on CS231

/* Q. 2 A doubly ended queue allows additions and deletions from both the ends that

is front and rear. Initially additions from the front will not be possible. To avoid

this situation, the array can be treated as if it were circular. Implement a

queue library (dstqueue.h) of integers using a static implementation of the

circular queue and implementing the following operations.

a. isFull(Q)

b. addFront(Q)

c. getRear(Q)

d. deleteRear(Q)

// File name : "dstqueue.c"

#include"dstqueue.h"

int init(struct Queue *q)

{

q->front = q->rear = -1;

}

int isEmpty(struct Queue *q)

{

if(q->front == q->rear)

{

return 1;

}

else{

return 0;

}

int isFull(struct Queue *q)

{

if(q->rear == MAX-1)

{

return 1;

}

else{

return 0;

}

int addFront(struct Queue *q, int x)

{

if(isFull(q) == 1)

{

printf("The queue is overflow...");

return 1;

}

else{

q->data[++(q->front)] = x;

}

return 0;

}

int getRear(struct Queue *q)

{

if(isEmpty(q) == 1)

{

printf("The stack is underflow...");

return 1;

}

else{

return q->data[q->rear];

}

int deleteRear(struct Queue *q)

{

if(isEmpty(q) == 1)

{

printf("The stack is underflow...");

return 1;

}

else{

return q->data[++(q->rear)];

}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "dstqueue.h"

#include<stdio.h>

#include<stdlib.h>

#define MAX 30

struct Queue

{

int data[MAX];

int front, rear;

};

int init(struct Queue *Q);

int isEmpty(struct Queue *Q);

int isFull(struct Queue *q);

int addFront(struct Queue *Q, int x);

int getRear(struct Queue *Q);

int deleteRear(struct Queue *Q);

//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "main.c"

#include"dstqueue.h"

int main()

{

struct Queue q;

int ch, num;

init(&q);

do{

printf("\n1. addFront \n2. getRear \n3. deleteRear \n4. Exit \n");

scanf("%d", &ch);

switch(ch)

{

case 1:

printf("Enter the element to insert into queue: ");

scanf("%d", &num);

addFront(&q, num);

break;

case 2:

printf("The current element : %d", getRear(&q));

break;

case 3:

printf("The deleted element : %d", deleteRear(&q));

break;

default:

printf("Thank you visit again ....\n\n");

break;

}

}while(ch != 4);

system("PAUSE");

return 0;

}

SYBSc (CS) Sem III : Data Structure Slip 11 Que - 2

2024-10-15T22:18:00.002+05:30

SAVITIBAI PHULE UNIVERSITY OF PUNE

S. Y. B.Sc. (Computer Science) Semester III

Practical Examination

SUBJECT: CS-233 Practical course based on CS231

/* Q. 2 Implement a priority queue library (Priority.h) of integers using a static implementation of the queue and implementing the below two operations. Write a driver program that includes queue library and calls different queue operations.

1) Add an element with its priority into the queue.

2) Delete an element from queue according to its priority. */

// File name : "PriorityQ.c"

#include"PriorityQ.h"

int initPQ(struct PriorityQueue *pq)

{

pq->front = pq->rear = -1;

return 0;

}

int isFullPQ(struct PriorityQueue *pq)

{

if(pq->rear == MAX-1)

return 1;

else

return 0;

}

int isEmptyPQ(struct PriorityQueue *pq)

{

if(pq->front == -1)

return 1;

else

return 0;

}

void InsertPQ(struct PriorityQueue *pq, struct data dt)

{

struct data temp;

int i, j;

pq->rear++;

pq->d[pq->rear] = dt;

if(pq->front == -1)

pq->front = 0;

for( i = pq->front; i <= pq->rear; i++)

{

for( j = i+1; j <= pq->rear; j++ )

{

if( pq->d[i].priority > pq->d[j].priority )

{

temp = pq->d[i];

pq->d[i] = pq->d[j];

pq->d[j] = temp;

}

else

{

if( pq->d[i].priority == pq->d[j].priority )

{

if( pq->d[i].order > pq->d[j].order )

{

temp = pq->d[i];

pq->d[i] = pq->d[j];

pq->d[j] = temp;

}

struct data DeletePQ(struct PriorityQueue *pq)

{

struct data t = pq->d[pq->front];

if( pq->front == pq->rear )

pq->front = pq->rear = -1;

else

pq->front++;

return t;

}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "PriorityQ.h"

#include<stdio.h>

#include<stdlib.h>

#define MAX 10

struct data

{

int item;

int priority;

int order;

};

struct PriorityQueue

{

struct data d[MAX];

int front;

int rear;

};

int initPQ(struct PriorityQueue *pq);

int isFullPQ(struct PriorityQueue *pq);

int isEmptyPQ(struct PriorityQueue *pq);

void InsertPQ(struct PriorityQueue *pq, struct data dt);

struct data DeletePQ(struct PriorityQueue *pq);

//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "main.c"

#include"PriorityQ.h"

int main(int argc, char *argv[])

{

struct PriorityQueue q;

struct data temp;

int i = 0, ch;

initPQ(&q);

do{

printf("\n1. Insert \n2. Delete \n3. Exit \n");

scanf("%d", &ch);

switch(ch)

{

case 1:

if(isFullPQ(&q))

printf("\n Queue is full.");

else

{

printf("Enter the data and Priority : ");

printf("\nData \t Priority\n");

scanf("%d%d", &(temp.item), &(temp.priority));

temp.order = i++;

InsertPQ(&q, temp);

}

break;

case 2:

if(isEmptyPQ(&q))

printf("\n Queue is Empty");

else

{

temp = DeletePQ(&q);

printf("Data = %d \t Priority = %d \n", temp.item, temp.priority);

}

break;

default:

printf("Thank you visit again ....\n\n");

break;

}

}while(ch>0 && ch<3);

system("PAUSE");

return 0;

}

SYBSc (CS) Sem III : Data Structure Slip 21 Que - 2

2024-10-15T08:52:00.006+05:30

SAVITIBAI PHULE UNIVERSITY OF PUNE

S. Y. B.Sc. (Computer Science) Semester III

Practical Examination

SUBJECT: CS-233 Practical course based on CS231

/* Q. 2. Read the data from the file "employee.txt" and sort on names in alphabetical order (use strcmp) using insertion sort and selection sort */

// File Name: "employee.txt" (This file create separate with txt extension and save in current folder.)

John

Aniket

Julie

Dolly

Rosemary

// File Name: "Slip21_2.c"

#include<stdio.h>

#include<stdlib.h>

#define MAX 20

typedef struct employee{

char name[MAX];

}record;

record emp[MAX];

int read_file(record *a){

int i = 0;

FILE *fp;

if ((fp = fopen("employee.txt", "r")) != NULL)

{

while (!feof(fp)){

fscanf(fp, "%s", a[i].name);

i++;

}

return (i-1);

}

void InsertionSort(record *a, int n)

{

int i, j;

record elem;

for (i = 1; i <= n; i++)

{

elem = a[i];

for (j = i-1; strcmp(a[j].name, elem.name) > 0 && j > 0; j--)

{

a[j + 1] = a[j];

}

a[i] = elem;

}

void SelectionSort(int A[], int n)

{

int i = 0, j = 0, loc = 0, min = 0, temp = 0;

for ( i = 0; i < n-1; i++)

{

min = A[i];

loc = i;

for ( j = i+1; j < n; j++)

{

if ( min > A[j])

{

min = A[j];

loc = j;

}

temp = A[i];

A[i] = A[loc];

A[loc] = temp;

}

void display(record *a, int n)

{

int i;

printf("\n\n");

for (i = 0; i < n; i++) {

printf("%s ", a[i].name);

}

printf("\n\n");

}

int main()

{

int n = read_file(emp);

printf("%d", n);

InsertionSort(emp, n);

display(emp, n);

int n = read_file(emp);

printf("%d", n);

SelectionSort(emp, n);

display(emp, n);

system("pause");

return 0;

}

SYBSc (CS) Sem III : Data Structure Slip 21 Que - 1

2024-10-15T08:45:00.003+05:30

SAVITIBAI PHULE UNIVERSITY OF PUNE

S. Y. B.Sc. (Computer Science) Semester III

Practical Examination

SUBJECT: CS-233 Practical course based on CS231

/* Q. 1. Write a program that reverses a string of characters. The function should use a stack library (cststack.h). Use a static implementation of the stack. */

/// File name : "cststack.h"

#include"cststack.h"

int init(struct Stack *s)

{

s->top = -1;

}

int isEmpty(struct Stack *s)

{

if(s->top == -1)

{

return 1;

}

else{

return 0;

}

int isFull(struct Stack *s)

{

if(s->top == MAX-1)

{

return 1;

}

else{

return 0;

}

int Push(struct Stack *s, char x)

{

if(isFull(s) == 1)

{

printf("The stack is overflow...");

return 1;

}

else{

s->top++;

s->data[s->top] = x;

}

return 0;

}

char Pop(struct Stack *s)

{

if(isEmpty(s) == 1)

{

printf("The stack is underflow...");

return 1;

}

else{

return s->data[(s->top)--];

}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "cststack.h"

#include<stdio.h>

#include<stdlib.h>

#define MAX 30

struct Stack

{

char data[MAX];

int top;

};

int init(struct Stack *s);

int isEmpty(struct Stack *s);

int isFull(struct Stack *s);

int Push(struct Stack *s, char x);

char Pop(struct Stack *s);

//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "main.c"

#include"cststack.h"

int main(int argc, char *argv[])

{

struct Stack s;

char str[MAX];

int i = 0;

init(&s);

printf("Enter the given String :: ");

scanf("%s", str);

while(str[i] != '\0')

{

Push(&s, str[i]);

i++;

}

while(!isEmpty(&s))

{

printf("%c", Pop(&s));

}

system("PAUSE");

return 0;

}

SYBSc (CS) Sem III : Data Structure Slip 17 Que - 2

2024-10-15T08:35:00.003+05:30

SAVITIBAI PHULE UNIVERSITY OF PUNE

S. Y. B.Sc. (Computer Science) Semester III

Practical Examination

SUBJECT: CS-233 Practical course based on CS231

/* Q. 2. Write a program that copies the contents of one stack into another. Use stack library to perform basic stack operations. The order of two stacks must be identical. (Hint: Use a temporary stack to preserve the order). */

/// File name : "stack.c"

#include"stack.h"

int init(struct Stack *s)

{

s->top = -1;

}

int isEmpty(struct Stack *s)

{

if(s->top == -1)

{

return 1;

}

else{

return 0;

}

int isFull(struct Stack *s)

{

if(s->top == MAX-1)

{

return 1;

}

else{

return 0;

}

int Push(struct Stack *s, int n)

{

if(isFull(s) == 1)

{

printf("The stack is overflow...");

return 1;

}

else{

s->top++;

s->data[s->top] = n;

}

return 0;

}

int Pop(struct Stack *s)

{

if(isEmpty(s) == 1)

{

printf("The stack is underflow...");

return 1;

}

else{

return s->data[(s->top)--];

}

int Peek(struct Stack *s)

{

if(isEmpty(s) == 1)

{

printf("The stack is underflow...");

return 1;

}

else{

return s->data[s->top];

}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "stack.h"

#include<stdio.h>

#include<stdlib.h>

#define MAX 30

struct Stack

{

int data[MAX];

int top;

};

int init(struct Stack *s);

int isEmpty(struct Stack *s);

int isFull(struct Stack *s);

int Push(struct Stack *s, int n);

int Pop(struct Stack *s);

int Peek(struct Stack *s);

//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "main.c"

#include"stack.h"

int main(int argc, char *argv[])

{

struct Stack s, s1, s2;

int A[MAX], n = 0, i = 0, num = 0;

init(&s);

printf("How many number we have to enter : ");

scanf("%d", &n);

printf("Enter the stack elements: ");

for (i = 0; i < n; i++)

{

scanf("%d", &num);

Push(&s, num);

}

for (i = 0; i < n; i++)

{

A[i] = Pop(&s);

}

init(&s1);

for (i = 0; i < n; i++)

{

Push(&s1, A[i]);

}

for (i = 0; i < n; i++)

{

A[i] = Pop(&s1);

}

init(&s2);

for (i = 0; i < n; i++)

{

Push(&s2, A[i]);

}

for (i = 0; i < n; i++)

{

printf("%d\t", Pop(&s2));

}

system("PAUSE");

return 0;

}

SYBSc (CS) Sem III : Data Structure Slip 17 Que - 1

2024-10-15T08:29:00.005+05:30

SAVITIBAI PHULE UNIVERSITY OF PUNE

S. Y. B.Sc. (Computer Science) Semester III

Practical Examination

SUBJECT: CS-233 Practical course based on CS231

/* Implement a list library (singlylist.h) for a singly linked list. Create a linked list, reverse it and display reversed linked list.*/

/// File name : "singlylist.c"

#include"singlylist.h"

void CreateList()

{

struct node *NewNode = NULL;

NewNode = (struct node *) malloc(sizeof(struct node));

if (NewNode != NULL)

{

NewNode->Next = NULL;

printf("Enter the data value: ");

scanf("%d", &(NewNode->data));

if (Head == NULL)

{

Head = Last = NewNode;

}

else

{

Last->Next = NewNode;

Last = NewNode;

}

void Display()

{

struct node *temp = Head;

printf("\n\nThe given Linked List is : ");

while (temp != NULL)

{

if (temp->Next != NULL)

printf("%d ->", temp->data);

else

printf("%d", temp->data);

temp = temp->Next;

}

struct Node* ReverseLinkedList()

{

struct Node *current = NULL, *reverse = NULL, *temp = NULL;

current = Head;

while(current != NULL)

{

temp = reverse;

reverse = current;

current = current->Next;

reverse->Next = temp;

}

Head = reverse;

}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "singlylist.h"

#include<stdio.h>

#include<stdlib.h>

struct node{

int data;

struct node *Next;

}*Head, *Last;

void CreateList();

void Display();

struct Node* ReverseLinkedList();

//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "main.c"

#include"singlylist.h"

int main(int argc, char *argv[])

{

int pos = 0, choice = 0;

struct Node *rev = NULL;

{

printf("\n\nEnter your choice: \n1. Create \n2. Display \n3. Reverse the List \n4. Exit \n\n");

scanf("%d", &choice);

switch(choice)

{

case 1:

CreateList();

break;

case 2:

Display();

break;

case 3:

ReverseLinkedList();

break;

default:

printf("Thank you visit again ....\n\n");

break;

}

}while(choice != 4);

system("PAUSE");

return 0;

}

SYBSc (CS) Sem III : Data Structure Slip 13 Que - 1

2024-10-15T08:23:00.006+05:30

SAVITIBAI PHULE UNIVERSITY OF PUNE

S. Y. B.Sc. (Computer Science) Semester III

Practical Examination

SUBJECT: CS-233 Practical course based on CS231

/* Q. 1. Implement a stack library (ststack.h) of integers using a static implementation of the stack and implementing the operations like init(S), S = push(S) and S = pop(S). Write a driver program that includes stack library and calls different stack operations. */

/// File name : "ststack.c"

#include"ststack.h"

int init(struct Stack *s)

{

s->top = -1;

}

int isEmpty(struct Stack *s)

{

if(s->top == -1)

{

return 1;

}

else{

return 0;

}

int isFull(struct Stack *s)

{

if(s->top == MAX-1)

{

return 1;

}

else{

return 0;

}

int Push(struct Stack *s)

{

int n;

if(isFull(s) == 1)

{

printf("The stack is overflow...");

return -1;

}

else{

printf("Enter the stack elements: ");

scanf("%d", &n);

s->top++;

s->data[s->top] = n;

}

return 0;

}

int Pop(struct Stack *s)

{

if(isEmpty(s) == 1)

{

printf("The stack is underflow...");

return -1;

}

else{

return s->data[(s->top)--];

}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "ststack.h"

#include<stdio.h>

#include<stdlib.h>

#define MAX 30

struct Stack

{

int data[MAX];

int top;

};

int init(struct Stack *s);

int isEmpty(struct Stack *s);

int isFull(struct Stack *s);

int Push(struct Stack *s);

int Pop(struct Stack *s);

//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "main.c"

#include"ststack.h"

int main(int argc, char *argv[])

{

struct Stack s;

int choice = 0, n;

{

printf("\n\nEnter your choice: \n1. Init \n2. Push \n3. Pop \n4. Exit \n\n");

scanf("%d", &choice);

switch(choice)

{

case 1:

init(&s);

break;

case 2:

Push(&s);

break;

case 3:

if ((n = Pop(&s)) != -1)

printf("Stack element : %d", n);

break;

default:

printf("Thank you visit again ....\n\n");

break;

}

}while(choice != 4);

system("PAUSE");

return 0;

}

SYBSc (CS) Sem III : Data Structure Slip 13 Que - 2

2024-10-15T08:16:00.003+05:30

SAVITIBAI PHULE UNIVERSITY OF PUNE

S. Y. B.Sc. (Computer Science) Semester III

Practical Examination

SUBJECT: CS-233 Practical course based on CS231

/* Q2 Write a program that sorts the elements of linked list using bubble sort technique */

#include<stdio.h>

#include<stdlib.h>

struct Node

{

int data;

struct Node *Next;

}*Head, *Last;

void CreateList()

{

struct Node *NewNode = (struct Node*) malloc(sizeof(struct Node));

if (NewNode != NULL)

{

printf("Enter the data value: ");

scanf("%d", &(NewNode->data));

NewNode->Next = NULL;

if (Head == NULL)

{

Head = Last = NewNode;

}

else

{

Last->Next = NewNode;

Last = NewNode;

}

void Display()

{

struct Node *temp = Head;

printf("\n\nThe given Linked List is : ");

while (temp != NULL)

{

if (temp->Next != NULL)

printf("%d ->", temp->data);

else

printf("%d", temp->data);

temp = temp->Next;

}

void SortLinkedList()

{

struct Node *current = Head, *index = NULL;

int temp;

if (Head != NULL)

{

while (current != NULL)

{

index = current->Next;

while (index != NULL)

{

if (current->data > index->data)

{

temp = current->data;

current->data = index->data;

index->data = temp;

}

index = index->Next;

}

current = current->Next;

}

int main()

{

int pos = 0, choice = 0;

{

printf("\n\nEnter your choice: \n1. Create \n2. Display \n3. Sort the List \n4. Exit \n\n");

scanf("%d", &choice);

switch(choice)

{

case 1:

CreateList();

break;

case 2:

Display();

break;

case 3:

SortLinkedList();

break;

default:

printf("Thank you visit again ....\n\n");

break;

}

}while(choice != 4);

system("pause");

return 0;

}

SYBSc (CS) Sem III : Data Structure Slip 10 Que - 1

2024-10-07T21:06:00.004+05:30

SAVITIBAI PHULE UNIVERSITY OF PUNE

S. Y. B.Sc. (Computer Science) Semester III

Practical Examination

SUBJECT: CS-233 Practical course based on CS231

/* Q. 1. Implement a linear queue library (st_queue.h) of integers using a static implementation of the queue and implementing the init(Q), add(Q) and peek(Q) operations. Write a program that includes queue library and calls different queue operations.*/

/// File name : "st_queue.c"

#include"st_queue.h"

int init(struct Queue *q)

{

q->front = q->rear = -1;

}

int isEmpty(struct Queue *q)

{

if(q->front == q->rear)

{

return 1;

}

else{

return 0;

}

int isFull(struct Queue *q)

{

if(q->rear == MAX-1)

{

return 1;

}

else{

return 0;

}

int add(struct Queue *q, int x)

{

if(isFull(q) == 1)

{

printf("The queue is overflow...");

return 1;

}

else{

q->data[++(q->rear)] = x;

}

return 0;

}

int peek(struct Queue *q)

{

if(isEmpty(q) == 1)

{

printf("The stack is underflow...");

return 1;

}

else{

return q->data[++(q->front)];

}

void Display(struct Queue *q)

{

int i = 0;

printf("\n The Queue elements are : \t");

for(i = q->front + 1; i <= q->rear; i++)

printf("%d\t", q->data[i]);

}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "st_queue.h"

#include<stdio.h>

#include<stdlib.h>

#define MAX 20

struct Queue

{

int data[MAX];

int front, rear;

};

int init(struct Queue *q);

int isEmpty(struct Queue *q);

int isFull(struct Queue *q);

int add(struct Queue *q, int x);

int peek(struct Queue *q);

void Display(struct Queue *q);

//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "main.c"

#include"st_queue.h"

int main()

{

struct Queue q;

int ch, num;

init(&q);

do{

printf("\n1. Insert \n2. Delete \n3. Display \n4. Exit \n");

scanf("%d", &ch);

switch(ch)

{

case 1:

printf("Enter the element to insert into queue: ");

scanf("%d", &num);

add(&q, num);

break;

case 2:

peek(&q);

break;

case 3:

Display(&q);

break;

default:

printf("Thank you visit again ....\n\n");

break;

}

}while(ch != 4);

system("pause");

return 0;

}

SYBSc (CS) Sem III : Data Structure Slip 8 Que - 2

2024-10-06T18:12:00.001+05:30

SAVITIBAI PHULE UNIVERSITY OF PUNE

S. Y. B.Sc. (Computer Science) Semester III

Practical Examination

SUBJECT: CS-233 Practical course based on CS231

/* Q. 2. Write a C program to check whether the contents of two stacks are identical. Use stack library to perform basic stack operations. Neither stack should be changed.*/

/// File name : "stack.c"

#include"stack.h"

int init(struct Stack *s)

{

s->top = -1;

}

int isEmpty(struct Stack *s)

{

if(s->top == -1)

{

return 1;

}

else{

return 0;

}

int isFull(struct Stack *s)

{

if(s->top == MAX-1)

{

return 1;

}

else{

return 0;

}

int Push(struct Stack *s, int n)

{

if(isFull(s) == 1)

{

printf("The stack is overflow...");

return 1;

}

else{

s->top++;

s->data[s->top] = n;

}

return 0;

}

int Pop(struct Stack *s)

{

if(isEmpty(s) == 1)

{

printf("The stack is underflow...");

return 1;

}

else{

return s->data[(s->top)--];

}

int Peek(struct Stack *s)

{

if(isEmpty(s) == 1)

{

printf("The stack is underflow...");

return 1;

}

else{

return s->data[s->top];

}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "stack.h"

#include<stdio.h>

#include<stdlib.h>

#define MAX 30

struct Stack

{

int data[MAX];

int top;

};

int init(struct Stack *s);

int isEmpty(struct Stack *s);

int isFull(struct Stack *s);

int Push(struct Stack *s, int n);

int Pop(struct Stack *s);

int Peek(struct Stack *s);

//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "main.c"

#include"stack.h"

int main(int argc, char *argv[])

{

struct Stack s1, s2;

int n, i, num, flag = 0;

init(&s1);

printf("How many number we have to enter in stack 1 : ");

scanf("%d", &n);

printf("Enter the stack elements: ");

for (i = 0; i < n; i++)

{

scanf("%d", &num);

Push(&s1, num);

}

init(&s2);

printf("How many number we have to enter in stack 2 : ");

scanf("%d", &n);

printf("Enter the stack elements: ");

for (i = 0; i < n; i++)

{

scanf("%d", &num);

Push(&s2, num);

}

while(!isEmpty(&s1) && !isEmpty(&s2))

{

if(Pop(&s1) != Pop(&s2))

{

flag = 0;

break;

}

flag = 1;

}

if( flag == 1)

printf("The contents of two stacks are identical.\n\n");

else

printf("The contents of two stacks are not identical.\n\n");

system("PAUSE");

return 0;

}

SYBSc (CS) Sem III : Data Structure Slip 8 Que - 1

2024-10-06T18:05:00.005+05:30

SAVITIBAI PHULE UNIVERSITY OF PUNE

S. Y. B.Sc. (Computer Science) Semester III

Practical Examination

SUBJECT: CS-233 Practical course based on CS231

/* Q. 1. Implement a list library (singlylist.h) for a singly linked list of integer with the operations create, delete specific element and display. Write a menu driven program to call these operations.*/

/// File name : "singlylist.h"

#include"singlylist.h"

void CreateList()

{

struct node *NewNode = NULL;

NewNode = (struct node *) malloc(sizeof(struct node));

if (NewNode != NULL)

{

NewNode->Next = NULL;

printf("Enter the data value: ");

scanf("%d", &(NewNode->data));

if (Head == NULL)

{

Head = Last = NewNode;

}

else

{

Last->Next = NewNode;

Last = NewNode;

}

void DeleteAtPosition(int Position)

{

struct node *temp = Head, *temp1 = NULL;

int i = 0;

if (Position == 1)

{

Head = temp->Next;

free(temp);

}

else

{

for (i = 2; i < Position; i++)

{

if (temp->Next->Next != NULL)

{

temp = temp->Next;

}

temp1 = temp->Next;

temp->Next = temp1->Next;

free(temp1);

}

void Display()

{

struct node *temp = Head;

printf("\n\nThe given Linked List is : ");

while (temp != NULL)

{

if (temp->Next != NULL)

printf("%d ->", temp->data);

else

printf("%d", temp->data);

temp = temp->Next;

}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "singlylist.h"

#include<stdio.h>

#include<stdlib.h>

struct node{

int data;

struct node *Next;

}*Head, *Last;

void CreateList();

void DeleteAtPosition(int Position);

void Display();

//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "main.c"

#include"singlylist.h"

int main(int argc, char *argv[])

{

int pos = 0, choice = 0;

{

printf("\n\nEnter your choice: \n1. Create \n2. Delete \n3. Display \n4. Exit \n\n");

scanf("%d", &choice);

switch(choice)

{

case 1:

CreateList();

break;

case 2:

printf("Enter the position to delete the element : ");

scanf("%d", &pos);

DeleteAtPosition(pos);

break;

case 3:

Display();

break;

default:

printf("Thank you visit again ....\n\n");

break;

}

}while(choice != 4);

system("PAUSE");

return 0;

}

SYBSc (CS) Sem III : Data Structure Slip 7 Que - 1

2024-10-06T17:58:00.001+05:30

SAVITIBAI PHULE UNIVERSITY OF PUNE

S. Y. B.Sc. (Computer Science) Semester III

Practical Examination

SUBJECT: CS-233 Practical course based on CS231

/* Q.1 Sort a random array of n integers (accept the value of n from user) in ascending order by using quick sort algorithm */

#include<stdio.h>

#include<stdlib.h>

#define MAX 100

void CreateArray(int A[], int n)

{

int i = 0;

for ( i = 0; i < n; i++)

A[i] = rand();

}

void DisplayArray(int A[], int n)

{

int i = 0;

for ( i = 0; i < n; i++)

printf("%d \t", A[i]);

}

void QuickSort(int A[], int low, int high)

{

int pivot, t, i, j;

if ( low <= high)

{

pivot = A[low];

i = low + 1;

j = high;

while ( i <= j)

{

while ( pivot >= A[i] && i <= high)

i++;

while ( pivot < A[j] && j >= low)

j--;

if ( i < j)

{

t = A[i];

A[i] = A[j];

A[j] = t;

}

A[low] = A[j];

A[j] = pivot;

QuickSort(A, low, j-1);

QuickSort(A, j+1, high);

}

int main(){

int A[MAX], num = 0;

printf("Enter How many element we want to in array: ");

scanf("%d", &num);

CreateArray(A, num);

printf("\n\nThe given array elements are: \n\n");

DisplayArray(A, num);

QuickSort(A, 0, num-1);

printf("\n\n");

DisplayArray(A, num);

printf("\n\n");

system("pause");

return 0;

}

SYBSc (CS) Sem III : Data Structure Slip 7 Que - 2

2024-10-06T17:55:00.002+05:30

SAVITIBAI PHULE UNIVERSITY OF PUNE

S. Y. B.Sc. (Computer Science) Semester III

Practical Examination

SUBJECT: CS-233 Practical course based on CS231

/* Q. 2 Write a program that checks whether a string of characters is palindrome or not. The function should use a stack library (cststack.h) of stack of characters using a static implementation of the stack. */

/// File name : "cststack.c"

#include"cststack.h"

int init(struct Stack *s)

{

s->top = -1;

}

int isEmpty(struct Stack *s)

{

if(s->top == -1)

{

return 1;

}

else{

return 0;

}

int isFull(struct Stack *s)

{

if(s->top == MAX-1)

{

return 1;

}

else{

return 0;

}

int Push(struct Stack *s, char x)

{

if(isFull(s) == 1)

{

printf("The stack is overflow...");

return 1;

}

else{

s->top++;

s->data[s->top] = x;

}

return 0;

}

char Pop(struct Stack *s)

{

if(isEmpty(s) == 1)

{

printf("The stack is underflow...");

return 1;

}

else{

return s->data[(s->top)--];

}

char Peek(struct Stack *s)

{

if(isEmpty(s) == 1)

{

printf("The stack is underflow...");

return 1;

}

else{

return s->data[s->top];

}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "cststack.h"

#include<stdio.h>

#include<stdlib.h>

#define MAX 30

struct Stack

{

char data[MAX];

int top;

};

int init(struct Stack *s);

int isEmpty(struct Stack *s);

int isFull(struct Stack *s);

int Push(struct Stack *s, char x);

char Pop(struct Stack *s);

char Peek(struct Stack *s);

//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "main.c"

#include"cststack.h"

int main(int argc, char *argv[])

{

struct Stack s;

char str[MAX], temp[MAX];

int i = 0;

init(&s);

printf("Enter the given String :: ");

scanf("%s", str);

while(str[i] != '\0')

{

Push(&s, str[i]);

i++;

}

i = 0;

while(!isEmpty(&s))

{

temp[i] = Pop(&s);

i++;

}

if(strcmp(str, temp) == 0)

{

printf("Given string is palindrome.\n\n");

}

else

{

printf("Given string is not a palindrome.\n\n");

}

system("PAUSE");

return 0;

}

SYBSc (CS) Sem III : Data Structure Slip 6 Que - 2

2024-10-06T16:04:00.004+05:30

SAVITIBAI PHULE UNIVERSITY OF PUNE

S. Y. B.Sc. (Computer Science) Semester III

Practical Examination

SUBJECT: CS-233 Practical course based on CS231

/* Q. 2 Implement a queue library (dyqueue.h) of integers using a dynamic (linked list) implementation of the queue and implement init, enqueue, dequeue, isempty, peek operations.*/

/// File name : "dyqueue.c"

#include"dyqueue.h"

int init()

{

front = rear = NULL;

return 0;

}

int isEmpty()

{

if((front == NULL && rear == NULL) || front == rear)

return 1;

else

return 0;

}

void enqueue(int x)

{

struct Queue *NewNode = NULL;

NewNode = (struct Queue*) malloc(sizeof(struct Queue));

if (NewNode != NULL)

{

NewNode->data = x;

NewNode->Next = NULL;

if (front == NULL)

rear = front = NewNode;

else{

rear->Next = NewNode;

rear = NewNode;

}

int dequeue()

{

int x;

struct Queue *temp = front;

if(isEmpty() == 1)

{

printf("Queue is empty...");

return -1;

}

else

{

x = front->data;

if(front == rear)

front = rear = NULL;

else

front = front->Next;

free(temp);

return (x);

}

int peek()

{

int x;

struct Queue *temp = front;

x = front->data;

if(front == rear)

front = rear = NULL;

else

front = front->Next;

return (x);

}

void Display()

{

struct Queue *temp = front;

printf("\n The Queue elements are : \t");

while(temp)

{

printf("%d\t", temp->data);

temp = temp->Next;

}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "dyqueue.h"

#include<stdio.h>

#include<stdlib.h>

struct Queue

{

int data;

struct Queue *Next;

}*front, *rear;

int init();

int isEmpty();

void enqueue(int x);

int dequeue();

int peek();

void Display();

//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "main.c"

#include"dyqueue.h"

int main(int argc, char *argv[])

{

int ch, num;

init();

do{

printf("\n1. Insert \n2. Delete \n3. Display \n4. Exit \n");

scanf("%d", &ch);

switch(ch)

{

case 1:

printf("Enter the element to insert into queue: ");

scanf("%d", &num);

enqueue(num);

break;

case 2:

dequeue();

break;

case 3:

Display();

break;

default:

printf("Thank you visit again ....\n\n");

break;

}

}while(ch != 4);

system("PAUSE");

return 0;

}

SYBSc (CS) Sem III : Data Structure Slip 5 Que - 2

2024-10-06T15:53:00.002+05:30

SAVITIBAI PHULE UNIVERSITY OF PUNE

S. Y. B.Sc. (Computer Science) Semester III

Practical Examination

SUBJECT: CS-233 Practical course based on CS231

/* Q. 2 Implement a priority queue library (Priority.h) of integers using a static implementation of the queue and implement the below two operations.

1) Add an element with its priority into the queue.

2) Delete an element from queue according to its priority.

// File name : "PriorityQ.c"

#include"PriorityQ.h"

int initPQ(struct PriorityQueue *pq)

{

pq->front = pq->rear = -1;

return 0;

}

int isFullPQ(struct PriorityQueue *pq)

{

if(pq->rear == MAX-1)

return 1;

else

return 0;

}

int isEmptyPQ(struct PriorityQueue *pq)

{

if(pq->front == -1)

return 1;

else

return 0;

}

void InsertPQ(struct PriorityQueue *pq, struct data dt)

{

struct data temp;

int i, j;

pq->rear++;

pq->d[pq->rear] = dt;

if(pq->front == -1)

pq->front = 0;

for( i = pq->front; i <= pq->rear; i++)

{

for( j = i+1; j <= pq->rear; j++ )

{

if( pq->d[i].priority > pq->d[j].priority )

{

temp = pq->d[i];

pq->d[i] = pq->d[j];

pq->d[j] = temp;

}

else

{

if( pq->d[i].priority == pq->d[j].priority )

{

if( pq->d[i].order > pq->d[j].order )

{

temp = pq->d[i];

pq->d[i] = pq->d[j];

pq->d[j] = temp;

}

struct data DeletePQ(struct PriorityQueue *pq)

{

struct data t = pq->d[pq->front];

if( pq->front == pq->rear )

pq->front = pq->rear = -1;

else

pq->front++;

return t;

}

///////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "PriorityQ.h"

#include<stdio.h>

#include<stdlib.h>

#define MAX 10

struct data

{

int item;

int priority;

int order;

};

struct PriorityQueue

{

struct data d[MAX];

int front;

int rear;

};

int initPQ(struct PriorityQueue *pq);

int isFullPQ(struct PriorityQueue *pq);

int isEmptyPQ(struct PriorityQueue *pq);

void InsertPQ(struct PriorityQueue *pq, struct data dt);

struct data DeletePQ(struct PriorityQueue *pq);

//////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "main.c"

#include"PriorityQ.h"

int main(int argc, char *argv[])

{

struct PriorityQueue q;

struct data temp;

int i = 0, ch;

initPQ(&q);

do{

printf("\n1. Insert \n2. Delete \n3. Exit \n");

scanf("%d", &ch);

switch(ch)

{

case 1:

if(isFullPQ(&q))

printf("\n Queue is full.");

else

{

printf("Enter the data and Priority : ");

printf("\nData \t Priority\n");

scanf("%d%d", &(temp.item), &(temp.priority));

temp.order = i++;

InsertPQ(&q, temp);

}

break;

case 2:

if(isEmptyPQ(&q))

printf("\n Queue is Empty");

else

{

temp = DeletePQ(&q);

printf("Data = %d \t Priority = %d \n", temp.item, temp.priority);

}

break;

default:

printf("Thank you visit again ....\n\n");

break;

}

}while(ch>0 && ch<3);

system("PAUSE");

return 0;

}

SYBSc (CS) Sem III : Data Structure Slip 4 Que - 2

2024-10-06T12:10:00.000+05:30

SAVITIBAI PHULE UNIVERSITY OF PUNE

S. Y. B.Sc. (Computer Science) Semester III

Practical Examination

SUBJECT: CS-233 Practical course based on CS231

/* Write a program to reverse the elements of a queue using queue library. Implement basic queue operations init, enqueue, dequeue. */

// File name : "Queue.c"

#include"Queue.h"

int init(struct Queue *q)

{

q->front = q->rear = -1;

}

int isEmpty(struct Queue *q)

{

if(q->front == q->rear)

{

return 1;

}

else{

return 0;

}

int isFull(struct Queue *q)

{

if(q->rear == MAX-1)

{

return 1;

}

else{

return 0;

}

int enqueue(struct Queue *q, int x)

{

if(isFull(q) == 1)

{

printf("The queue is overflow...");

return 1;

}

else{

q->data[++(q->rear)] = x;

}

return 0;

}

int dequeue(struct Queue *q)

{

if(isEmpty(q) == 1)

{

printf("The stack is underflow...");

return 1;

}

else{

return q->data[++(q->front)];

}

void Display(struct Queue *q)

{

int i = 0;

printf("\n The Queue elements are : \t");

for(i = q->front + 1; i <= q->rear; i++)

printf("%d\t", q->data[i]);

}

void Reverse(struct Queue *q)

{

int x;

if (isEmpty(q) == 1)

return;

x = dequeue(q);

Reverse(q);

enqueue(q, x);

}

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "Queue.h"

#include<stdio.h>

#include<stdlib.h>

#define MAX 20

struct Queue

{

int data[MAX];

int front, rear;

};

int init(struct Queue *q);

int isEmpty(struct Queue *q);

int isFull(struct Queue *q);

int enqueue(struct Queue *q, int x);

int dequeue(struct Queue *q);

void Display(struct Queue *q);

void Reverse(struct Queue *q);

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : main.c

#include"Queue.h"

int main(int argc, char *argv[])

{

struct Queue q;

int ch, num;

init(&q);

do{

printf("\n1. Insert \n2. Reverse \n3. Display \n4. Exit \n");

scanf("%d", &ch);

switch(ch)

{

case 1:

printf("Enter the element to insert into queue: ");

scanf("%d", &num);

enqueue(&q, num);

break;

case 2:

Reverse(&q);

break;

case 3:

Display(&q);

break;

default:

printf("Thank you visit again ....\n\n");

break;

}

}while(ch != 4);

system("PAUSE");

return 0;

}

SYBSc (CS) Sem III : Data Structure Slip 3 Que - 2

2024-10-06T12:00:00.001+05:30

SAVITIBAI PHULE UNIVERSITY OF PUNE

S. Y. B.Sc. (Computer Science) Semester III

Practical Examination

SUBJECT: CS-233 Practical course based on CS231

/* Q.2 Write a C program to evaluate postfix expression*/

#include<stdio.h>

#include<stdlib.h>

#define MAX 30

struct Stack

{

char data[MAX];

int top;

};

int init(struct Stack *s)

{

s->top = -1;

}

int isEmpty(struct Stack *s)

{

if(s->top == -1)

{

return 1;

}

else{

return 0;

}

int isFull(struct Stack *s)

{

if(s->top == MAX-1)

{

return 1;

}

else{

return 0;

}

int Push(struct Stack *s, char x)

{

if(isFull(s) == 1)

{

printf("The stack is overflow...");

return 1;

}

else{

s->top++;

s->data[s->top] = x;

}

return 0;

}

char Pop(struct Stack *s)

{

if(isEmpty(s) == 1)

{

printf("The stack is underflow...");

return 1;

}

else{

return s->data[(s->top)--];

}

char Peek(struct Stack *s)

{

if(isEmpty(s) == 1)

{

printf("The stack is underflow...");

return 1;

}

else{

return s->data[s->top];

}

int Priority(char x)

{

if(x == '(')

return 0;

else if(x == '+' || x == '-')

return 1;

else if(x == '*' || x == '/')

return 2;

else if(x == '^' || x == '$')

return 3;

else

return -1;

}

int main()

{

struct Stack s;

char exp[MAX], temp[MAX];

int i = 0, n1, n2, n3, n;

init(&s);

printf("Enter the postfix expression without space :: ");

scanf("%s", exp);

strcpy(temp, exp);

while(temp[i] != '\0')

{

if(isdigit(temp[i]))

{

Push(&s, temp[i]-48);

}

else

{

n2 = Pop(&s); // Operand 1

n1 = Pop(&s); // OPerand 2

switch(temp[i])

{

case '+':

{

n3 = n1 + n2;

break;

}

case '-':

{

n3 = n1 - n2;

break;

}

case '*':

{

n3 = n1 * n2;

break;

}

case '/':

{

n3 = n1 / n2;

break;

}

Push(&s, n3);

}

i++;

}

printf("\n The result of Postfix expression %s = %d \n\n", exp, Pop(&s));

system("pause");

return 0;

}

SYBSc(CS) Sem III : Data Structure Slip 2 : Que - 1

2024-10-06T11:50:00.000+05:30

SAVITIBAI PHULE UNIVERSITY OF PUNE

S. Y. B.Sc. (Computer Science) Semester III

Practical Examination

SUBJECT: CS-233 Practical course based on CS231

/* Q. 1. Implement a list library (singlylist.h) for a singly linked list of integer with the operations create, display. Write a menu driven program to call these operations. */

// File name : "singlylist.c"

#include"singlylist.h"

void CreateList()

{

struct node *NewNode = NULL;

NewNode = (struct node *) malloc(sizeof(struct node));

if (NewNode != NULL)

{

NewNode->Next = NULL;

printf("Enter the data value: ");

scanf("%d", &(NewNode->data));

if (Head == NULL)

{

Head = Last = NewNode;

}

else

{

Last->Next = NewNode;

Last = NewNode;

}

void Display()

{

struct node *temp = Head;

printf("\n\nThe given Linked List is : ");

while (temp != NULL)

{

if (temp->Next != NULL)

printf("%d ->", temp->data);

else

printf("%d", temp->data);

temp = temp->Next;

}

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "singlylist.h"

#include<stdio.h>

#include<stdlib.h>

struct node{

int data;

struct node *Next;

}*Head, *Last;

void CreateList();

void Display();

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : main.c

#include"singlylist.h"

int main(int argc, char *argv[])

{

int pos = 0, choice = 0;

{

printf("\n\nEnter your choice: \n1. Create \n2. Display \n3. Exit \n\n");

scanf("%d", &choice);

switch(choice)

{

case 1:

CreateList();

break;

case 2:

Display();

break;

default:

printf("Thank you visit again ....\n\n");

break;

}

}while(choice != 3);

system("PAUSE");

return 0;

}

SYBSc(CS) Sem III : Data Structure Slip 2 : Que - 2

2024-10-06T11:41:00.001+05:30

SAVITIBAI PHULE UNIVERSITY OF PUNE

S. Y. B.Sc. (Computer Science) Semester III

Practical Examination

SUBJECT: CS-233 Practical course based on CS231

/* Write a program that copies the contents of one stack into another. Use stack library to perform basic stack operations. The order of two stacks must be identical. (Hint : Use a temporary stack to preserve the order.) */

// File name : "Stack.c"

#include"stack.h"

int init(struct Stack *s)

{

s->top = -1;

}

int isEmpty(struct Stack *s)

{

if(s->top == -1)

{

return 1;

}

else{

return 0;

}

int isFull(struct Stack *s)

{

if(s->top == MAX-1)

{

return 1;

}

else{

return 0;

}

int Push(struct Stack *s, int n)

{

if(isFull(s) == 1)

{

printf("The stack is overflow...");

return 1;

}

else{

s->top++;

s->data[s->top] = n;

}

return 0;

}

int Pop(struct Stack *s)

{

if(isEmpty(s) == 1)

{

printf("The stack is underflow...");

return 1;

}

else{

return s->data[(s->top)--];

}

int Peek(struct Stack *s)

{

if(isEmpty(s) == 1)

{

printf("The stack is underflow...");

return 1;

}

else{

return s->data[s->top];

}

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : "stack.h"

#include<stdio.h>

#include<stdlib.h>

#define MAX 30

struct Stack

{

int data[MAX];

int top;

};

int init(struct Stack *s);

int isEmpty(struct Stack *s);

int isFull(struct Stack *s);

int Push(struct Stack *s, int n);

int Pop(struct Stack *s);

int Peek(struct Stack *s);

////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////

// File name : main.c

#include"stack.h"

int main(int argc, char *argv[])

{

struct Stack s, s1, s2;

int A[MAX], n = 0, i = 0, num = 0;

init(&s);

printf("How many number we have to enter : ");

scanf("%d", &n);

printf("Enter the stack elements: ");

for (i = 0; i < n; i++)

{

scanf("%d", &num);

Push(&s, num);

}

for (i = 0; i < n; i++)

{

A[i] = Pop(&s);

}

init(&s1);

for (i = 0; i < n; i++)

{

Push(&s1, A[i]);

}

for (i = 0; i < n; i++)

{

A[i] = Pop(&s1);

}

init(&s2);

for (i = 0; i < n; i++)

{

Push(&s2, A[i]);

}

for (i = 0; i < n; i++)

{

printf("%d\t", Pop(&s2));

}

system("PAUSE");

return 0;

}