Pre-Lab

1.

package prelab2_1;

public class StockDemo

private String symbol,name;

private double previousClosingPrice,currentPrice;

public double getChangePercent()

return ((currentPrice-previousClosingPrice)/currentPrice)*100;

public void setData(String s,String n,double p,double c)

symbol=s;

name=n;

previousClosingPrice=p;

currentPrice=c;

public String toString()

String s;

s="Stock symbol "+symbol+" Stock name "+name+" Percentage "+

getChangePercent();

return s;

}
package prelab2_1a;

import java.util.Scanner;

import preelab2.StockDemo;

public class Demo

public static void main(String args[])

Scanner s=new Scanner(System.in);

StockDemo S1=new StockDemo();

S1.setData(s.next(),s.next(),s.nextDouble(),s.nextDouble());

System.out.println(S1);

s.close();

}
2.

package Demos;

import java.util.*;

public class Search

static int a[]=new int[10];

static Scanner s=new Scanner(System.in);

public static void main(String args[])

int i,ch;

System.out.println("Enter the elements");

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

a[i]=Integer.parseInt(args[i]);

while(true)

System.out.println("***MENU***");

System.out.println("1.Linear Search");

System.out.println("2.Binary Search");

System.out.println("3.Bubble Sort");

System.out.println("4.exit");

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

ch=s.nextInt();

switch(ch)

case 1:linearSearch();

break;

case 2:binarySearch();

break;

case 3:bubbleSort();
 break;

case 4:System.exit(0);

default:System.out.println("Invalid Choice");

public static void linearSearch()

int key,i;

System.out.println("Enter Key value");

key=s.nextInt();

for(i=0;i<a.length;i++)

if(a[i]==key)

System.out.println(key+"is found at "+i+" index");

break;

if(i==a.length)

System.out.println(key+"not found");

public static void binarySearch()

int key,low,high,mid;

System.out.println("Enter key value");

key=s.nextInt();

low=0;

high=a.length-1;

while(low<=high)
 {

mid=(low+high)/2;

if(key==a[mid])

System.out.println(key+"is found at "+mid+" index");

break;

else if(key<a[mid])

high=mid-1;

else if(key>a[mid])

low=mid+1;

if(low>high)

System.out.println(key+"not found");

public static void printArray()

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

System.out.println(a[i]);

public static void bubbleSort()

int i,j,temp;

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

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

if(a[j]>a[j+1])

{
 temp=a[j];

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

a[j+1]=temp;

printArray();

}
In-Lab

1.

package inlab2;

public class QuadraticEquations

private double a;

private double b;

private double c;

public void setCoefficients(double x,double y,double z)

a=x;

b=y;

c=z;

public double getDiscriminant()

return Math.pow(b,2)-4*a*c;

public double getRoot1()

return (-b+Math.sqrt(getDiscriminant()))/2*a;

public double getRoot2()

return (-b-Math.sqrt(getDiscriminant()))/2*a;

}
package inlab2;

public class QuadDemo

public static void main(String args[])

QuadraticEquations q=new QuadraticEquations();

q.setCoefficients(6,5,1);

System.out.println(q.getDiscriminant());

System.out.println(q.getRoot1());

System.out.println(q.getRoot2());

}
2.

package Student;

public class Student

private String name,gender,department;

private long id;

public boolean setName(String n)

int flag=0;

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

if((n.charAt(i)>='A'&&n.charAt(i)<='Z')||(n.charAt(i)>='a'&&n.charAt(i)<='z'))

{}

else

flag=1;

break;

if(flag==1)

return false;

else

name=n;

return true;

public boolean setGender(String g)

if(g.equals("M")||g.equals("F"))
 {

gender=g;

return true;

else

return false;

public boolean setDepartment(String d)

if(d.equals("BT")||d.equals("CE")||d.equals("CSE")||d.equals("ECE")||d.equals("EEE")||d.e
quals("ECSE")||d.equals("ME")||d.equals("PE"))

department=d;

return true;

else

return false;

public boolean setId(long i)

if(i>99999999&&i<1000000000)

id=i;

return true;

else

return false;

public boolean setData(long i,String n,String g,String d)

boolean a=setId(i);
 boolean b=setName(n);

boolean c=setGender(g);

boolean z=setDepartment(d);

if(a && b && c && z)

return true;

else

return false;

public String toString()

String s;

s=String.format("ID : %d %nName : %s %nGender : %s %nDepartment :

%s",id,name,gender,department);

return s;

}
import java.util.Scanner;

public class StudentDemo {

public static void main(String[] args) {

Scanner sc=new Scanner(System.in);

Student s1=new Student();

System.out.println("Enter ID");

long i=sc.nextLong();

System.out.println("Enter Name");

String n=sc.next();

System.out.println("Enter Gender");

String g=sc.next();

System.out.println("Enter Department");

String dept=sc.next();

s1.setData(I,n,g,dept);

System.out.println(s1);

}
Post-Lab

1.

package Demos;

public class Time {

private static int a[]=new int[100000];

public static void linearSearch(int key)

int i;

for(i=0;i<a.length;i++)

if(a[i]==key)

System.out.println(key+" is found at "+i+" index");

break;

if(i==a.length)

System.out.println(key+" not found");

public static void main(String args[])

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

a[i]=getRandomNumber();

long startTime = System.currentTimeMillis();

linearSearch(a[0]);

long endTime = System.currentTimeMillis();

long executionTime = endTime - startTime;

System.out.println("Best Case Time-"+executionTime);

startTime = System.currentTimeMillis();
 linearSearch(a[a.length-1]);

endTime = System.currentTimeMillis();

executionTime = endTime - startTime;

System.out.println("Worst Case Time-"+executionTime);

startTime = System.currentTimeMillis();

linearSearch(a[(a.length-1)/2]);

endTime = System.currentTimeMillis();

executionTime = endTime - startTime;

System.out.println("Average Case Time-"+executionTime);

public static int getRandomNumber()

int max=100000, min=1;

int x = (int)(Math.random()* ((max - min) + 1)) + min;

return x;

}
2.

package Demos;

import java.util.Scanner;

public class Matrix {

public static void main(String args[])

Scanner s=new Scanner(System.in);

int r,i,j;

r=Integer.parseInt(args[0]);

int a[][]=new int[r][r];

System.out.println("Enter elements in the matrix");

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

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

a[i][j]=s.nextInt();

while(true)

int ch;

System.out.println("MENU");

System.out.println("1.Sum of All Elements");

System.out.println("2.Print the data in matrix form");

System.out.println("3.Print the elements of principal diagonal");

System.out.println("4.Print the sum of elements in principal diagonal");

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

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

ch=s.nextInt();

switch (ch)
{

case 1: int sum=0;

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

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

sum=sum+a[i][j];

System.out.println("Sum of all elements="+sum);

break;

case 2:for(i=0;i<r;i++)

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

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

System.out.println(" ");

break;

case 3:for(i=0;i<r;i++)

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

if(i==j)

System.out.println(a[i][j]);

break;

case 4:int sp=0;

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

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

if(i==j)

sp=sp+a[i][j];

System.out.println("Sum of principal diagonal

elements="+sp);

break;

case 5: System.exit(0);

default:System.out.println("Invalid choice");