Class : BCA SEM IV

Subject 4CS04BDS1 : Introduction to algorithm and data structure

Program list
1. Write a program for the sum of two integers.

import java.util.*;
class prg1
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int a,b,c;
System.out.print("Enter no1 : ");
a=sc.nextInt();
System.out.print("Enter no2 : ");
b=sc.nextInt();

c=a+b;
System.out.print(a + "+" + b + "=" +c);
}
}

2. Write a program that finds maximum from two entered numbers.

import java.util.*;
class prg2
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int a,b;
System.out.print("Enter no1 : ");
a=sc.nextInt();
System.out.print("Enter no2 : ");
b=sc.nextInt();
if(a>b)
System.out.print(a + " is maximum");
else
System.out.print(b + " is maximum");
}
}
3. Write a program that finds minimum from two entered numbers.

import java.util.*;
class prg3
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int a,b;
System.out.print("Enter no1 : ");
a=sc.nextInt();
System.out.print("Enter no2 : ");
b=sc.nextInt();
if(a<b)
System.out.print(a + " is minimum");
else
System.out.print(b + " is minimum");
}

4. Write a Program that calculates simple interest.

import java.util.*;
class prg4
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int p,r,n;
float i;
System.out.print("Enter Present value : ");
p=sc.nextInt();
System.out.print("Enter Rate of Interest: ");
r=sc.nextInt();
System.out.print("Enter no of years : ");
n=sc.nextInt();
i=(p*r*n)/100;
System.out.print("\n Simple Interest : " +i);
}

5. Write a Program that calculates area of rectangle ( A = l*b).

 import java.util.*;
class prg5
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int l,b,a;
System.out.print("Enter length : ");
l=sc.nextInt();
System.out.print("Enter bridth : ");
b=sc.nextInt();
a=l*b;
System.out.print("\n Area of rectangle : "+ a);
}

6. Write a Program that calculates area of circle (A =PI*R*R).

import java.util.*;
class prg6
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int r;
double a;
System.out.print("Enter radius : ");
r=sc.nextInt();
a=3.14*r*r;
System.out.print("\n Area of circle : " + a);
}

7. Write a program that check given number is positive, negative or zero.

import java.util.*;
class prg7
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int no;
System.out.print("Enter no : ");
no=sc.nextInt();
if(no>0)
System.out.print(no + " is positive");
 else if(no<0)
System.out.print(no+ " is negative");
else
System.out.print (no + " is zero");

}
}

8. Write a program that check given number is odd or even.

import java.util.*;
class prg8
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int no;
System.out.print("Enter no : ");
no=sc.nextInt();
if(no%2==0)
System.out.print(no + " is even");
else
System.out.print(no + " is odd");

9. Write a program that print 1 to n numbers using while loop.

import java.util.*;
class prg9
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int no,i=1;
System.out.print("Enter no : ");
no=sc.nextInt();
while(i<=no)
{
System.out.print("\t" + i);
i=i+1;
}

}
10. Write a program that print sum of 1 to n number and display 1 to n number using for loop.

import java.util.*;
class prg10
{
public static void main(String args[])
{
Scanner sc=new Scanner(System.in);
int no,i,sum=0;
System.out.print("Enter no : ");
no=sc.nextInt();
for(i=1;i<=no;i++)
{
System.out.print("\t"+i);
//sum=sum+i;
}
sum=no*(no+1)/2;
System.out.print("\n Sum : " + sum);

11. Write a program that find maximum and minimum program from 3 integers.

import java.util.*;
class prg11
{
public static void main(String args[])
{
int a,b,c;
Scanner sc=new Scanner(System.in);
System.out.print("Enter no1 : ");
a=sc.nextInt();
System.out.print("Enter no2 : ");
b=sc.nextInt();
System.out.print("Enter no3 : ");
c=sc.nextInt();
System.out.print("\n\n******************\n\n");
if(a>b && a>c)
System.out.print(a + " is maximum");
else if(b>a && b>c)
System.out.print(b + " is maximum");
else
System.out.print(c + " is maximum");

System.out.print("\n\n******************\n\n");
 if(a<b && a<c)
System.out.print(a + " is minimum");
else if(b<a && b<c)
System.out.print(b + " is minimum");
else
System.out.print(c + " is minimum");
}
}

12. Write a program that check given number is prime or not.

import java.util.*;
class prg12
{
public static void main(String args[])
{
int a,i,ck=0;
Scanner sc=new Scanner(System.in);
System.out.print("Enter no1 : ");
a=sc.nextInt();
for(i=2;i<a;i++)
{
if(a%i==0)
{
ck=1;
break;
}
}
if(ck==0)
System.out.print(a + " is prime");
else
System.out.print(a+ " is not prime");
}
}

13. Write a program for print reverse number of given input number.

import java.util.*;
class prg13
{
public static void main(String args[])
{
int a,r,rev=0;
Scanner sc=new Scanner(System.in);
System.out.print("Enter no1 : ");
a=sc.nextInt();
 while(a>0)
{
r=a%10;
rev=(rev*10)+r;
a=a/10;
}
System.out.print("Reverse no : " + rev);
}
}

14. Write a program for print sum of digit of given number.

import java.util.*;
class prg14
{
public static void main(String args[])
{
int a,r,sum=0;
Scanner sc=new Scanner(System.in);
System.out.print("Enter no1 : ");
a=sc.nextInt();
while(a>0)
{
r=a%10;
sum=sum+r;
a=a/10;
}
System.out.print("Sum of digits : " + sum);
}
}

15. Write a program to check if given no is Armstrong or not.

import java.util.*;
class prg15
{
public static void main(String args[])
{
int a,r,sum=0,t;
Scanner sc=new Scanner(System.in);
System.out.print("Enter no1 : ");
a=sc.nextInt();
t=a;
while(a>0)
{
r=a%10;
 sum=sum+(r*r*r);
a=a/10;
}
if(t==sum)
System.out.print(t + " is armstrong");
else
System.out.print(t + " is not armstrong");
}
}

16. Write a program that displays factorial of given number using for loop
.
import java.util.*;
class prg16
{
public static void main(String args[])
{
int a,i,f=1;
Scanner sc=new Scanner(System.in);
System.out.print("Enter no1 : ");
a=sc.nextInt();
for(i=1;i<=a;i++)
f=f*i;
System.out.print("Factorial : " + f);

}
}

17. Write a program that displays factorial of given number using recursion.

import java.util.*;
class prg17
{
public static void main(String args[])
{
int a,i,f=1;
Scanner sc=new Scanner(System.in);
System.out.print("Enter no1 : ");
a=sc.nextInt();
System.out.print (" Factorial of " + a + " is : " + fact(a));

}
public static int fact(int n)
{
int result;
if(n==1)
return 1;
 result=n*fact(n-1);
return result;
}
}

18. Write a program for Fibonacci series using recursion.

import java.util.*;
class prg18
{
static int a=0,b=1,c,i=1;
public static void main(String args[])
{
int a,f=1;
Scanner sc=new Scanner(System.in);
System.out.print("Enter no1 : ");
a=sc.nextInt();

fib(a);

}
public static void fib(int n)
{
if(n>0)
{
System.out.print(a + " \t");
c=a+b;
a=b;
b=c;
n=n-1;
fib(n);
}
}
}

19. Write a Program to input five numbers into an array and display sum of them.

import java.util.*;
class prg19
{
public static void main(String args[])
{
int a[]=new int[5];
Scanner sc=new Scanner(System.in);
int i,sum=0;
for(i=0;i<5;i++)
 {
System.out.print("Enter a[" + i + "] element : ");
a[i]=sc.nextInt();
}
System.out.print("\n\n***************************\n\n");
for(i=0;i<5;i++)
{
System.out.print(a[i] +"\t");
sum=sum+a[i];
}
System.out.print ("\n Sum : " + sum);
}
}

20. Write a Program to input five numbers into an array and display maximum from them.

import java.util.*;
class prg20
{
public static void main(String args[])
{
int a[]=new int[5];
Scanner sc=new Scanner(System.in);
int i,max;
for(i=0;i<5;i++)
{
System.out.print("Enter a[" + i + "] element : ");
a[i]=sc.nextInt();
}
System.out.print("\n\n***************************\n\n");
max=a[0];
for(i=1;i<5;i++)
{
if(max<a[i])
max=a[i];
}
System.out.print("\n Maximum : " + max);
}
}

21. Write a Program to input five numbers into an array and display minimum from them.

import java.util.*;
class prg21
{
public static void main(String args[])
 {
int a[]=new int[5];
Scanner sc=new Scanner(System.in);
int i,min;
for(i=0;i<5;i++)
{
System.out.print("Enter a[" + i + "] element : ");
a[i]=sc.nextInt();
}
System.out.print("\n\n***************************\n\n");
min=a[0];
for(i=1;i<5;i++)
{
if(min>a[i])
min=a[i];
}
System.out.print("\n Minimum : " + min);
}
}

22. Write a program for linear or sequential search.

import java.util.*;
class prg22
{
public static void main(String args[])
{

Scanner sc=new Scanner(System.in);

int i,size,ck=0;
System.out.print("Enter size of array : " );
size=sc.nextInt();
int a[]=new int[size];
int key;
for(i=0;i<size;i++)
{
System.out.print("Enter a[" + i + "] element : ");
a[i]=sc.nextInt();
}
System.out.print("\n Enter search element : ");
key=sc.nextInt();
System.out.print("\n\n***************************\n\n");
for(i=0;i<size;i++)
{
if(key==a[i])
{
ck=1;
System.out.print(key + " is found at " + i + " position");
 break;
}
}
if(ck==0)
System.out.print(key + " is not found");
}
}

23. Write a program for binary search.

import java.util.*;
class prg23
{
public static void main(String args[])
{

Scanner sc=new Scanner(System.in);

int i,size,ck=0;
System.out.print("Enter size of array : " );
size=sc.nextInt();
int a[]=new int[size];
int key;
System.out.print("Enter sorted array\n");
for(i=0;i<size;i++)
{
System.out.print("Enter a[" + i + "] element : ");
a[i]=sc.nextInt();
}
System.out.print("\n Enter search element : ");
key=sc.nextInt();

System.out.print("\n\n***************************\n\n");

int beg,end,mid;
beg=0;
end=size-1;
while(beg<=end)
{
mid=(beg+end)/2;
if(key>a[mid])
beg=mid+1;
else if(key<a[mid])
end=mid-1;
else
{
ck=1;
System.out.print(key + " is found at " + mid + " position");
break;
 }
}
if(ck==0)
System.out.print(key+ " is not found");
}
}

24. Write a program for merge sort.

import java.util.*;
class prg24
{
static int n;
public static void main(String args[])
{
int a[],i;
Scanner sc=new Scanner(System.in);
System.out.print("Enter size : ");
n=sc.nextInt();
a=new int[n];
System.out.print("\n Enter array elements :\n");
for(i=0;i<n;i++)
{
System.out.print("Enter a[" + i + "] element : ");
a[i]=sc.nextInt();
}

System.out.print("\n******************************\n");
System.out.print("\n\t Before sort\n");
for(i=0;i<n;i++)
{
System.out.print(a[i]+"\t");
}
merge(a,0,n-1);
System.out.print("\n******************************\n");
System.out.print("\n\t After sort\n");
for(i=0;i<n;i++)
{
System.out.print(a[i]+"\t");
}
}
public static void merge(int a[],int low,int high)
{
if(low<high)
{
int mid=(low+high)/2;
merge(a,low,mid);
merge(a,mid+1,high);
 combine(a,low,mid,high);
}
}
public static void combine(int a[],int low,int mid,int high)
{
int i,j,k;
i=low;
j=mid+1;
k=low;
int temp[]=new int[n];
while((i<=mid)&&(j<=high))
{
if(a[i]<a[j])
{
temp[k]=a[i];
i++;
k++;
}
else if(a[j]<a[i])
{
temp[k]=a[j];
j++;
k++;
}
else
{
temp[k]=a[i];
i++;
j++;
k++;
n--;
}
}
while(i<=mid)
{
temp[k]=a[i];
i++;
k++;
}
while(j<=high)
{
temp[k]=a[j];
j++;
k++;
}
for(i=low;i<=high;i++)
{
a[i]=temp[i];
}
}
 }

25. Write a program for quick sort.

26. Write a program for display 2X2 matrix.

import java.util.*;
class prg26
{
public static void main(String args[])
{
int a[][]=new int [2][2];
Scanner sc=new Scanner(System.in);
int i,j;
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
System.out.print("Enter a[" + i + "][" + j + "] element : ");
a[i][j]=sc.nextInt();
}
}
System.out.print("\n\n*********************\n\n");
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
System.out.print(a[i][j]+"\t");
}
System.out.print("\n");
}
}
}

27. Write a program for matrix addition.

import java.util.*;
class prg27
{
public static void main(String args[])
{
int a[][]=new int [2][2];
int b[][]=new int [2][2];
int c[][]=new int [2][2];
Scanner sc=new Scanner(System.in);
int i,j;
System.out.print("\nEnter first matrix :\n");
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
System.out.print("Enter a[" + i + "][" + j + "] element : ");
a[i][j]=sc.nextInt();
}
}
System.out.print("\nEnter second matrix :\n");
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
System.out.print("Enter b[" + i + "][" + j + "] element : ");
b[i][j]=sc.nextInt();
}
}
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
c[i][j]=a[i][j]+b[i][j];
}
}

System.out.print("\n\n*********************\n\n");
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
System.out.print(a[i][j]+"\t");
}
System.out.print("\n");
}
System.out.print("\n\n*********************\n\n");
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
System.out.print(b[i][j]+"\t");
}
System.out.print("\n");
}
System.out.print("\n\n*********************\n\n");
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
System.out.print(c[i][j]+"\t");
}
System.out.print("\n");
 }
}
}

28. Write a program for matrix subtraction.

import java.util.*;
class prg28
{
public static void main(String args[])
{
int a[][]=new int [2][2];
int b[][]=new int [2][2];
int c[][]=new int [2][2];
Scanner sc=new Scanner(System.in);
int i,j;
System.out.print("\nEnter first matrix :\n");
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
System.out.print("Enter a[" + i + "][" + j + "] element : ");
a[i][j]=sc.nextInt();
}
}
System.out.print("\nEnter second matrix :\n");
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
System.out.print("Enter b[" + i + "][" + j + "] element : ");
b[i][j]=sc.nextInt();
}
}
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
c[i][j]=a[i][j]-b[i][j];
}
}

System.out.print("\n\n*********************\n\n");
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
System.out.print(a[i][j]+"\t");
}
 System.out.print("\n");
}
System.out.print("\n\n*********************\n\n");
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
System.out.print(b[i][j]+"\t");
}
System.out.print("\n");
}
System.out.print("\n\n*********************\n\n");
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
System.out.print(c[i][j]+"\t");
}
System.out.print("\n");
}
}
}

29. Write a program for matrix multiplication by a scalar variable.

import java.util.*;
class prg29
{
public static void main(String args[])
{
int a[][]=new int [2][2];
int b[][]=new int [2][2];
int s;
Scanner sc=new Scanner(System.in);
int i,j;
System.out.print("\nEnter first matrix :\n");
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
System.out.print("Enter a[" + i + "][" + j + "] element : ");
a[i][j]=sc.nextInt();
}
}
System.out.print("\n Enter scalar value : ");
s=sc.nextInt();
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
 {
b[i][j]=a[i][j]*s;
}
}

System.out.print("\n\n*********************\n\n");
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
System.out.print(a[i][j]+"\t");
}
System.out.print("\n");
}
System.out.print("\n\n*********************\n\n");
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
System.out.print(b[i][j]+"\t");
}
System.out.print("\n");
}
}
}

30. Write a program for matrix multiplication.

import java.util.*;
class prg30
{
public static void main(String args[])
{
int a[][]=new int[2][2];
int b[][]=new int[2][2];
int c[][]=new int[2][2];
int i,j,k;
Scanner sc=new Scanner(System.in);
System.out.print("\n Enter first matrix :\n");
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
System.out.print("Enter a[" + i +"][" +j + "] element :
");
a[i][j]=sc.nextInt();
}
 }
System.out.print("\n Enter second matrix :\n");
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
System.out.print("Enter b[" + i +"][" +j + "] element :
");
b[i][j]=sc.nextInt();
}
}
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
c[i][j]=0;
for(k=0;k<2;k++)
{
c[i][j]=c[i][j]+a[i][k]*b[k][j];
}
}
}
System.out.print("\n\t First matrix \n\n");
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
System.out.print(a[i][j]+"\t");
}
System.out.print("\n");
}
System.out.print("\n\t Second matrix \n\n");
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
System.out.print(b[i][j]+"\t");
}
System.out.print("\n");
}
System.out.print("\n\t Answer matrix \n\n");
for(i=0;i<2;i++)
{
for(j=0;j<2;j++)
{
System.out.print(c[i][j]+"\t");
 }
System.out.print("\n");
}
}
}

Process:

i j k

0 0 0 c[0][0]=0
c[0][0]=c[0][0]+a[0][0]*b[0][0]
c[0][0]=5

0 0 1 c[0][0]=c[0][0]+a[0][1]*b[1][0]
c[0][0]=5+2*7
=+14= 19
0 1 0 c[0][1]=0
c[0][1]=c[0][1]+a[0][0]*b[0][1]
c[0][1]=0+1*6
=6

0 1 1 c[0][1]=c[0][1]+a[0][1]*b[1][1]
=6+(2*8)
=6 +16
=22

1 0 0

1 0 1

1 1 0

1 1 1
31. Write a program for stack implementation PUSH, POP, PEEP and DISPLAY
import java.util.*;
class stack
{
int a[],no,size,top;
Scanner sc=new Scanner(System.in);
public stack()
{
System.out.print("Enter size : ");
size=sc.nextInt();
a=new int[size];
top=-1;
}
public void push()
{
if(top==size-1)
System.out.print("\n\t Stack overflow\n");
else
{
System.out.print("Enter no :");
no=sc.nextInt();
top++;
a[top]=no;
}
}
public void pop()
{
if(top==-1)
System.out.print("\n\t Stack underflow\n");
else
{
no=a[top];
top--;
System.out.print("\n\t Pop element : " + no);
}
}
public void peep()
{
if(top==-1)
System.out.print("\n\t Stack underflow\n");
else
{
no=a[top];
System.out.print("\n\t Peep element : " + no);
}
}
public void display()
 {
if(top==-1)
System.out.print("\n\t Stack underflow\n");
else
{
System.out.print("\n\n");
for(int i=top;i>=0;i--)
System.out.print(a[i]+ "\t");
}
}

}
class prg31
{
public static void main(String args[])
{
Scanner sc1=new Scanner(System.in);
stack s=new stack();
int ch;
do
{
System.out.print("\n\t[1] Push");
System.out.print("\n\t[2] Pop");
System.out.print("\n\t[3] Peep");
System.out.print("\n\t[4] Display");
System.out.print("\n\t[5] Exit");
System.out.print("\n\t Enter choice : ");
ch=sc1.nextInt();
if(ch==1)
s.push();
else if(ch==2)
s.pop();
else if(ch==3)
s.peep();
else if(ch==4)
s.display();
else if(ch==5)
break;
else
System.out.print("\n Invalid choice \n");

}while(ch!=5);
}
}
32. Write a program for Simple or Linear Queue (insert, delete and Display)
33. Write a menu driven program for double ended queue Which allows insert at front , insert at
rear, delete from front and delete from rear and display operations.
34. Write a program for create and display singly linked list in java
35. Write a program for insert first and last node in singly linked list
36. Write a program for insert Specific node in singly linked list
37. Write a menu driven program of singly link list for all possible operations.
38. Write a program for creation and traversal of doubly linked list.
39. Write a program for creation and traversal of circular linked list.

Ms.Kalpa Vora Mr. J B Khimsuriya

(Principal)