PROGRAM 1

To Create Pascal’s Triangle

Solution
import java.io.*;
import java.util.Scanner ;
class Pascal
{
public static void main (String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println(“Enter a no.”);
int n=sc.nextInt()
int [ ] pas = new int [n+1];
pas[0] = 1;
for (int i=0; i<n; i++)
{
for (int j=0; j<=i; ++j)
System.out.print(pas[j]+" ");
System.out.println( );
for (int j=i+1; j>0; j--)
pas[j]=pas[j]+pas[j-1];
}
}
}

Output

3
Variable Description Table

Algorithm
STEP 1 - START
STEP 2 - pas[0] = 1
STEP 3 - IF i=0 THEN GOTO STEP 4
STEP 4 - IF j=0 THEN GOTO STEP 5
STEP 5 - PRINT pas[j]+" "
STEP 6 - i++& IF i<n GOTO STEP 4
STEP 7 - j=0 & IF j<=i GOTO STEP 5
STEP 8 - IF j=i+1 THEN GOTO STEP 7
STEP 9 - pas[j]=pas[j]+pas[j-1]
STEP 10 - j--& IF j>0 GOTO STEP 9
STEP 11 – END

4
PROGRAM 2
To Display Entered Number in Words

Solution
import java.io.*;
import java.util.Scanner ;
class Num2Words
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter any Number(less than 99)");
int amt=sc.nextInt();
int z,g;
String x []={ “”,"Ten","Eleven","Twelve","Thirteen",
"Fourteen","Fifteen","Sixteen","Seventeen","Eighteen","Ninetee
n"};
String x1[] =
{"","One","Two" ,"Three","Four","Five" ,"Six","Seven" ,
"Eight","Nine"};
String x2[] ={ "","Twenty","Thirty","Fourty",
"Fifty","Sixty","Seventy", "Eighty","Ninety"};
z=amt%10;
g=amt/10;
if(g!=1)
System.out.println(x2[g-1]+" "+x1[z]);
else
System.out.println(x[amt-9]);
}
}

Output

5
Variable description Table

Algorithm
STEP 1 - START
STEP 2 - INPUT amt
STEP 3 - z=amt%10 , g=amt/10
STEP 4 - IF g!=1 THEN GOTO STEP 5 OTHERWISE GOTO STEP 6
STEP 5 - PRINT x2[g-1]+" "+x1[z]
STEP 6 - PRINT x[amt-9]
STEP 7 – END

6
PROGRAM 3
To Display A.P. Series and Its Sum

Solution
class APSeries
{
private double a,d;
APSeries() //default constructor
{
a = d = 0;
}
APSeries(double a,double d) //parameterized constructor
{
this.a = a;
this.d = d;
}
double nTHTerm(int n) //final AP term
{
return (a+(n-1)*d);
}
double Sum(int n) //function calculating sum
{
return (n*(a+nTHTerm(n))/2);
}
void showSeries(int n) //displaying AP Series
{
System.out.print("\n\tSeries\n\t");
for(int i=1;i<=n;i++)

7
{System.out.print(nTHTerm(i)+" ");
}
System.out.print("\n\tSum :"+Sum(n));
}
}
void main()
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter 1st term");
a=sc.nextInt(); //accepting 1st term
System.out.println("Enter Common difference");
d= sc.nextInt(); //accepting common difference
System.out.println("Enter no.of terms");
int n=Sc.nextInt(); //accepting no. of terms
nTHTerm(n);
Sum(n);
showSeries(n);
}

Output

Variable description Table

8
Algorithm
STEP 1 – START
STEP 2-a=d=0
STEP 3 - IMPORT a, d
STEP 4 - this.a = a & this.d = d
STEP 5 - IMPORT n
STEP 6 - RETURN (a+(n-1)*d)
STEP 7 - IMPORT n
STEP 8 - RETURN (n*(a+nTHTerm(n))/2)
STEP 9 - IMPORT n
STEP 10 - PRINT \n\tSeries\n\t"
STEP 11 - IF i=1;i<=n;i++ GOTO STEP 12
STEP 12 - PRINT nTHTerm(i)+" "
STEP 13 - i++ & IF i<=n GOTO STEP 12
STEP 14 - PRINT n\tSum : "+Sum(n)
STEP 15 – END

9
PROGRAM 4
To Display Calendar of Any Month of Any
Year

Solution
import java.io.*;
import java.util.Scanner ;
class Calendar
{
public void dee()
{
int i,count=0,b,d=1;
Scanner sc = new Scanner(System.in);
System.out.println(“Enter month”);
int month=sc.nextInt();
System.out.println(“Enter Year”);
int year=sc.nextInt();
String w="SMTWTFS";
int days[]={31,28,31,30,31,30,31,31,30,31,30,31};
String
month1[]={"January","February","March","April","May","June","J
uly","August","September","October","November","December"}
;
if((year%100==0 && year%400==0) || (year%100!=0 && year
%4==0))
days[1]=29;
System.out.println("================The Calendar
of"+month1[month-1]+"
"+year+"is==================");
for(i=0;i<w.length();i++)
System.out.print(w.charAt(i)+"\t");
System.out.println(" ");
for(i=1;i<year;i++)
if((year%100==0 && year%400==0) || (year%100!=0 && year
%4==0))
count+=2;
else count+=1;
for(i=0;i<month;i++)

10
count+=days[i];
count+=1;
count%=7;
b=7-count;
if(b!=1 || b!=7)
while(count>0)
{
System.out.print(' '+"\t");
count--;
}
for(i=1;i<7;i++) {
while(b>0 && d<=days[month-1])
{
System.out.print(d+"\t");
d++;
b--;
}
b=7;
System.out.println(" ");
}
}
}

Output

Variable Description Table

11
12
Algorithm
STEP 1 - START
STEP 2 - INPUT int month,int year
STEP 3 - int i,count=0,b,c,d=1 & String w="SMTWTFS"
STEP 4 - IF (year%100==0 && year%400==0) || (year%100!=0
&& year%4==0)
STEP 5 - days[1]=29
STEP 6 - PRINT "================The Calendar
of"+month1[month-1]+"
"+year+"is==================")
STEP 7 - IF i=0 THEN GOTO STEP 8
STEP 8 - PRINT (i)+"\t" & " "
STEP 9 - IF i=1 GOTO STEP 10
STEP 10 - IF (year%100==0 && year%400==0) || (year%100!
=0 && year%4==0)THEN GOTO STEP 11OTHERWISE GOTO
STEP 12
STEP 11 - count+=2
STEP 12 - count+=1
STEP 13 - IF i=0 GOTO STEP 14
STEP 14 - count+=days[i] , count+=1, count%=7 & b=7-count
STEP 15 - IF b!=1 || b!=7 GOTO STEP 16
STEP 16 - IF count>0 GOTO STEP 17,18
STEP 17 - PRINT ' '+"\t")
STEP 18 - count--
STEP 19 - IF i=1 GOTO STEP 20
STEP 20 - IF b>0 && IF d<=days[month-1] GOTO STEP 21,22
STEP 21 - PRINT d+"\t"
STEP 22 - d++ & b--
STEP 23 - b=7
STEP 24 - i++ & IF i<MONTH GOTO STEP14
STEP 25 - PRINT " "
STEP 26 – END

13
PROGRAM 5
To Calculate Factorial Using Recursion

Solution
import java.io.*;
import java.util.Scanner ;
class Factorial
{
public static void main(String args[])
{
Scanner sc= new Scanner(System.in);
System.out.println("enter no =");
int n = Sc.nextInt();
Factorial obj = new Factorial();
long f = obj.fact(n);
System.out.println("Factorial ="+f);
}
public long fact(int n)
{
if(n<2)
return 1;
else return (n*fact(n-1));
}
}

Output

14
Variable Description Table

Algorithm
STEP 1 - START
STEP 2 - INPUT n
STEP 3 - IF(n<2) THEN return 1 OTHERWISE return (n * fact(n-
1))
STEP 4 – END

15
PROGRAM 6
To Display Fibonacci Series Using Recursion

Solution
import java.io.*;
class Fibonacci
{
public static void main(String args[])
{
Fibonacci obj = new Fibonacci();
Scanner sc= new Scanner(System.in);
System.out.println("enter no of term =");
int n = Sc.nextInt();
System.out.println();
for(int i=1;i<=n;i++)
{
int f = obj.fib(i);
System.out.print(f+" ");
}
}
public int fib(int n)
{
if(n<=1)
return n;
else
return (fib(n-1) +fib(n-2));
}
}

Output

16
17
Variable Description Table

Algorithm
STEP 1 - START
STEP 2 - INPUT n
STEP 3 - IF(n<=1) THEN return 1 OTHERWISE return (fib(n-1)
+fib(n-2))
STEP 4 – END

18
PROGRAM 7
To Calculate GCD Using Recursion

Solution
import java.io.*;
import java.util.Scanner ;
class GCD
{
public static void main(String args[])
{
Scanner sc= new Scanner(System.in);
System.out.println("enter the numbers =");
int p = Sc.nextInt();
int q = Sc.nextInt();
GCD obj = new GCD();
int g = obj.calc(p,q);
System.out.println("GCD ="+g);
}
public int calc(int p,int q)
{
if(q==0)
return p;
else return calc(q,p%q);
}
}

Output

19
Variable Description Table

Algorithm
STEP 1 - START
STEP 2 - INPUT p,q
STEP 3 - IF(q=0) THEN return p OTHERWISE return calc(q,p%q)
STEP 4 – END

20
PROGRAM 8
To Display Spiral Matrix

Solution
import java.io.*;
import java.util.Scanner ;
class SpiralMatrix
{
public static void main(String[] args)
{
int a[][],r,c,k1=2,k2=3,p=0,co=0,re=0;
Scanner sc= new Scanner(System.in);
System.out.println("enter the dimension of matrix A x A =");
int l = Sc.nextInt();
a=new int[l][l];
r=l/2;c=r-1;
if(l%2==0)
{
System.out.println("wrong entry for spiral path");
System.exit(0);
}
while(p!=(int)Math.pow(l,2))
{if(co!=0)
re=1;
for(int ri=1;ri<=k1-re;ri++)
{
p++;c++;if(c==l)break;a[r][c]=p;
} if(c==l)break;
for(int dw=1;dw<=k1-1;dw++)
{
p++;r++;a[r][c]=p;
} for(int le=1;le<=k2
1;le++)
{
p++;c--;a[r][c]=p;
}
for(int up=1;up<=k2-1;up++)
{

21
p++;r--;a[r][c]=p;
} k1=k1+2;
k2=k2+2;
co++;
}
for(int y=0;y<l;y++)
{
for(int yy=0;yy<l;yy++)
System.out.print("\t"+a[y][yy]);
System.out.println();
System.out.println();
}
}
}

Output

Variable Description Table

22
Algorithm
STEP 1 - START
STEP 2 - INPUT a[][]
STEP 3 - IF p!=(int)Math.pow(l,2) GOTO STEP 4
STEP 4 - IF co!=0 GOTO STEP 5
STEP 5 - re=1
STEP 6 - IF ri=1;ri<=k1-re;ri++ GOTO STEP 7
STEP 7 - p++,c++
STEP 8 - IF c==l GOTO STEP 9
STEP 9 - BREAK
STEP 10 - a[r][c]=p
STEP 11 - IF c==l GOTO STEP 12
STEP 12 - BREAK
STEP 13 - IF dw=1 GOTO STEP 14
STEP 14 - p++,r++,a[r][c]=p
STEP 15 - IF le=1 GOTO STEP 16
STEP 16 - p++,c--,a[r][c]=p
STEP 17 - IF up=1 GOTO STEP 18
STEP 18 - p++,r--,a[r][c]=p
STEP 19 - k1=k1+2, k2=k2+2 & co++
STEP 20 - up++ & IF up<=k2-1 GOTO STEP 18
STEP 21 - le++ & IF le<=k2-1 GOTO STEP 16
STEP 22 - dw++ & IF dw<=k1-1 GOTO STEP 14
STEP 23 - IF y=0 GOTO STEP 24
STEP 24 - IF yy=0 GOTO STEP 25
STEP 25 - PRINT "\t"+a[y][yy]) & ()
STEP 26 - yy++ & IF yy<l GOTO STEP 25
STEP 27 - y++ & IF y<l GOTO STEP 24

23
STEP 28 – END

24
PROGRAM 9
To Display Magic Square

Solution
import java.io.*;
import java.util.Scanner ;
class MagicSquare
{
public static void main(String args[]) {
Scanner sc= new Scanner(System.in);
System.out.println("enter the dimension of magical square=");
int n = Sc.nextInt();
int arr[][]=new int[n][n],c=n/2-1,r=1,num;
for(num=1;num<=n*n;num++){
c++;
if(r==-1)
r=n-1;
if(c>n-1)
c=0;
if(arr[r][c]!=0)
{r=r+2;
c--;
}
arr[r][c]=num;
if(r==0&&c==0)
{r=n-1;
c=1;
arr[r][c]=++num;
}
if(c==n-1&&r==0)
arr[++r][c]=++num;
}
System.out.println();
for(r=0;r<n;r++)
{for(c=0;c<n;c++)
System.out.print(arr[r][c]+" ");
System.out.println();
}

25
}
}

Output

Variable Description Table

26
Algorithm
STEP 1 - START
STEP 2 - arr[][]=new int[n][n],c=n/2-1,r=1,num
STEP 3 - IF num=1;num<=n*n;num++ GOTO STEP 4
STEP 4 - r--,c++
STEP 5 - IF r==-1 GOTO STEP 6
STEP 6 - r=n-1
STEP 7 - IF c>n-1 GOTO STEP 8
STEP 8 - c=0
STEP 9 - IF arr[r][c]!=0 GOTO STEP 10
STEP 10 - r=r+2 & c--
STEP 11 - num++ & IF num<=n*n GOTO STEP 4
STEP 12 - arr[r][c]=num
STEP 13 - IF r==0&&c==0 GOTO STEP 14
STEP 14 - r=n-1, c=1 & arr[r][c]=++num
STEP 15 - IF c==n-1&&r==0 GOTO STEP 16
STEP 16 - arr[++r][c]=++num
STEP 17 - PRINT ()
STEP 18 - IFr=0 GOTO STEP 19
STEP 19 - IF c=0 GOT STEP 20
STEP 20 - PRINT arr[r][c]+" " & ()
STEP 21 - c++ & IF c<n GOTO STEP 20
STEP 21 - r++ & r<n GOTO STEP 19
STEP 22 – END

27
PROGRAM 10
To Search an Array Using Linear Search

Solution
import java.io.*;
import java.util.Scanner ;
class LinearSearch
{
int n,i;
int a[] = new int[100];
Scanner sc= new Scanner(System.in);
public LinearSearch(int nn){
n=nn;
}
public void input()
{
System.out.println("enter elements");
for(i=0;i<n;i++){
a[i] = Sc.nextInt();
}
}
public void display(){
System.out.println(); for(i=0;i<n;i++){
System.out.print(a[i]+" ");
}
}
public void search(int v)
{
int flag=-1;
for(int i=0; i<n ; i++)
{
if(a[i] == v)
flag =i;
}
if(flag== -1 )
System.out.println("not found");
else System.out.println(v+" found at position - "+flag);
}

28
public static void main(String args[])
{
LinearSearch obj = new LinearSearch(10);
obj.input();
obj.display();
System.out.println("enter no. to be searched -");
int v = sc.nextInt();
obj.search(v);
}
}

Output

Variable Description Table

29
Algorithm
STEP 1 - START
STEP 2 - INPUT a[]
STEP 3 - FROM i=0 to i<n REPEAT STEP 4
STEP 4 - PRINT a[i]+" "
STEP 5 - flag=-1
STEP 6 - FROM i=0 to i<n REPEAT STEP 7
STEP 7 - IF (a[i] == v) THEN flag =i
STEP 8 - IF (flag=-1) THEN GOTO STEP 9 OTHERWISE GOTO
STEP 10
STEP 9 - PRINT “ not found”
STEP 10 - PRINT v+" found at position - "+flag
STEP 11 – END

30
PROGRAM 11
To Search an Array Using Binary Search

Solution
import java.io.*;
import java.util.Scanner ;
class BinarySearch
{int n,i;
int a[] = new int[100];
Scanner sc= new Scanner(System.in);
public BinarySearch(int nn){
n=nn;
}
public void input() {
System.out.println("enter elements");
for(i=0;i<n;i++){
a[i] = sc.nextInt();
}
}
public void display()
{
System.out.println();
for(i=0;i<n;i++) {
System.out.print(a[i]+" ");
}
}
public void search(int v){
int l=0;
int u = n-1;
int m;
int flag=-1;
while( l<=u && flag == -1){
m = (l+u)/2;
if(a[m] == v)
flag = m;
else if(a[m] < v)
l = m+1;
else u = m-1;

31
}
if(flag== -1 )
System.out.println("not found");
else System.out.println(v+" found at position - "+flag);
}
public static void main(String args[]) {
BinarySearch obj = new BinarySearch(10);
obj.input();
obj.display();
System.out.println("enter no. to be searched -");
int v = sc.nextInt();
obj.search(v);
}
}

Output

Variable Description Table

32
33
Algorithm
STEP 1 - START
STEP 2 - INPUT a[]
STEP 3 - FROM i=0 to i<n REPEAT STEP 4
STEP 4 - PRINT a[i]+" "
STEP 5 - flag=-1 , l=0, u=n-1
STEP 6 - IF(l<=u && flag=-1) REPEAT STEP 7 AND Step 8
STEP 7 - m = (l+u)/2
STEP 8 - IF (a[m] == v) THEN flag =m OTHERWISE GOTO STEP
9
STEP 9 - IF (a[m] < v) THEN l = m+1 OTHERWISE u =m-1
STEP 10 - IF (flag=-1) THEN GOTO STEP 11 OTHERWISE GOTO
STEP 12
STEP 11 - PRINT “ not found”
STEP 12 - PRINT v+" found at position - "+flag
STEP 13 - END

34
PROGRAM 12
To Sort an array using selection Sort

Solution
import java.io.*;
import java.util.Scanner ;
class SelectionSort
{
int n,i;
int a[] = new int[100];
public SelectionSort(int nn)
{
n=nn;
}
public void input()
{
Scanner sc= new Scanner(System.in);
System.out.println("enter elements");
for(i=0;i<n;i++)
{
a[i] = sc.nextInt();
}
}
public void display(){
System.out.println();
for(i=0;i<n;i++){
System.out.print(a[i]+" ");
}
}
public void sort(){
int j,temp,min;
for(i=0;i<n-1;i++) {
min =i;
for(j=i+1;j<n;j++)
{
if(a[j]<a[min])
min =j;
}

35
if(min!=i){
temp = a[i];
a[i] =a[min];
a[min] = temp;
}
}
}
public static void main(String args[])
{SelectionSort x = new SelectionSort(5);
x.input();
System.out.print("Before sorting - ");
x.display();
System.out.print("After sorting - ");
x.sort();
x.display();
}
}

Output

Variable Description Table

36
Algorithm
STEP 1 - START
STEP 2 - INPUT a[]
STEP 3 - FROM i=0 to i<n REPEAT STEP 4
STEP 4 - PRINT a[i]+" "
STEP 5 - flag=-1
STEP 6 - FROM i=0 to i<n-1 REPEAT STEP 7 to STEP 11
STEP 7 - min =i
STEP 8 - FROM j=i+1 to j<n REPEAT STEP 8
STEP 9 - IF(a[j]<a[min]) then min =j
STEP 10 - IF (min!=i) GOTO STEP 11
STEP 11 - temp = a[i], a[i] =a[min], a[min] = temp

37
PROGRAM 13
To Sort an Array Using Bubble Sort

Solution
import java.io.*;
import java.util.Scanner ;
class BubbleSort
{
int n,i;
int a[] = new int[100];
public BubbleSort(int nn){
n=nn;
}
public void input()
{
Scanner sc= new Scanner(System.in);
System.out.println("enter elements");
for(i=0;i<n;i++){
a[i] = sc.nextInt();
}
}
public void display(){
System.out.println();
for(i=0;i<n;i++){
System.out.print(a[i]+" ");
}
}
public void sort()
for(i=0 ; i<n-1 ; i++){
for(j=0 ; j<n-1-i ; j++){
if(a[j] > a[j+1]){
temp = a[j];
a[j] =a[j+1];
a[j+1] = temp;
}
}
}
}

38
public static void main(String args[]){
BubbleSort x = new BubbleSort(5);
x.input();
System.out.print("Before sorting - ");
x.display();
System.out.print("After sorting - ");
x.sort();
x.display();
}
}

Output

Variable Description Table

39
Algorithm
STEP 1 - START
STEP 2 - INPUT a[]
STEP 3 - FROM i=0 to i<n REPEAT STEP 4
STEP 4 - PRINT a[i]+" "
STEP 5 - flag=-1
STEP 6 - FROM i=0 to i<n-1 REPEAT STEP 7 to STEP 9
STEP 7 - FROM j=i+1 to j<n REPEAT STEP 8
STEP 8 - IF(a[j] > a[j+1]) THEN GOTO STEP 9
STEP 9 - temp = a[i], a[i] =a[min], a[min] = temp
STEP 10 - END

40
PROGRAM 14
To Convert a Decimal no. into its Binary
Equivalent

Solution
import java.io.*;
import java.util.Scanner ;
class Dec2Bin
{
int n,i;
int a[] = new int[100];
Scanner sc= new Scanner(System.in);
public Dec2Bin(int nn)
{
n=nn;
}
public void dectobin(int no){
int c = 0;
int temp = no;
while(temp !=0)
{
a[c++] = temp % 2;
temp = temp / 2;
}
System.out.println("Binary eq. of "+no+" = ");
for( i = c-1 ; i>=0 ; i--)
System.out.print( a[ i ] );
}
public static void main(String args[])
{
Dec2Bin obj = new Dec2Bin(30);
System.out.println("enter decimal no -");
int no = sc.nextInt(); obj.dectobin(no);
}
}

41
Output

Variable Description Table

Algorithm
STEP 1 - START
STEP 2 - n = 30
STEP 3 - INPUT int no
STEP 4 - c =0 , temp = no
STEP 5 - IF (temp!=0) REPEAT STEP 6
STEP 6 - a[c++] = temp%2, temp = temp / 2
STEP 7 - FROM i=c-1 to i>0 REPEAT STEP 8
STEP 8 - PRINT a[i]
STEP 9 – END

42
43
PROGRAM 15
To Display Date from entered Day Number

Solution
import java.io.*;
import java.util.Scanner ;
class Day2Date
{
Scanner sc= new Scanner(System.in);
public void calc(int n, int yr) {
int a[ ] = { 31,28,31,30,31,30,31,31,30,31,30,31 } ;
String m[ ] = { "Jan", "Feb",
"Mar","Apr","May","Jun","Jul","Aug","Sep","Oct","Nov","Dec" } ;
if ( yr % 4 == 0)
a[1] =29;
int t=0,s=0;
while( t < n){
t =t + a[s++];
}
int d = n + a[--s] - t;
if( d == 1|| d == 21 || d == 31 ) {
System.out.println( d + "st" + m[s] + " , "+yr);
}
if( d == 2 || d == 22 ) {
System.out.println( d + "nd" + m[s] + " , "+yr);
}
if( d == 3|| d == 23 ) {
System.out.println( d + "rd" + m[s] + " , "+yr);
}
else {System.out.println( d + "th" + m[s] + " , "+yr);
}
}
public static void main(String args[])
System.out.println( "Enter day no = ");
int n = sc.nextInt();
System.out.println( "Enter year = ");
int yr = sc.nextInt();
obj.calc(n,yr);

44
}
}

45
Output

Variable Description Table

Algorithm
STEP 1 - START
STEP 2 - INITIALISE a[ ] , m[ ]
STEP 3 - INPUT n , yr
STEP 4 - IF ( yr%4=0) THEN a[1] = 29
STEP 5 - t =0 , s = 0
STEP 6 - IF ( t<n) REPEAT STEP 7
STEP 7 - t =t + a[s++]
STEP 8 - d = n + a[--s] - t
STEP 9 - IF ( d ==1|| d == 21 || d == 31 ) then PRINT d + "st"
+ m[s] + " , "+yr
STEP 10 - IF ( d ==2|| d == 22 ) then PRINT d + "nd" + m[s] +
" , "+yr

46
STEP 11 - IF ( d ==3|| d == 23 ) then PRINT d + "rd" + m[s] + "
, "+yr OTHERWISE GOTO STEP 12
STEP 12 - PRINT d + "th" + m[s] + " , "+yr
STEP 13 – END

PROGRAM 16
To create a star pattern from entered string

Solution
import java.io.*;
import java.util.Scanner ;
class Pattern
{
public static void main (String args[])
{
int i,sp,j,k,l;
Scanner sc= new Scanner(System.in);
System.out.println("enter the string =");
String s = sc.nextLine();
l=s.length();
for(i=0;i<l;i++)
if(i==l/2)
System.out.println(s);
else {
sp=Math.abs((l/2)-i);
for(j=sp;j<l/2;j++)
System.out.print(" ");
k=0;
while(k<3)
{
System.out.print(s.charAt(i));
for(j=0;j<sp-1;j++)
System.out.print(" ");
k++;
}
System.out.println(" ");
}
}
}

47
Output

Variable Description Table

Algorithm
STEP 1 - START
STEP 2 - INPUT string s
STEP 3 – calculate the length of the string
STEP 4 – if i==l/2 PRINT s
STEP 5 - else print “ “
STEP 6 – k=0
STEP 7 – if k<3 print charAt(i)
STEP 8 - if j<sp-1 print “ “
STEP 9 – k++ GOTO STEP 8
STEP 10 – print “ “
STEP 11- END

48
PROGRAM 17
To Check if Entered String is Palindrome or
Not

Solution
import java.io.*;
import java.util.Scanner ;
class Palindrome
{
public static void main(String args[])
{
Scanner sc= new Scanner(System.in);
System.out.println("enter the string=");
String s = sc.nextLine();
Scanner sc= new Scanner(System.in);
sb.reverse();
String rev = new String(sb);
if(s.equalsIgnoreCase(rev))
System.out.println("Palindrome " );
else
System.out.println("Not Palindrome " );
}
}

Output

49
Variable Description Table

Algorithm
STEP 1 - START
STEP 2 - INPUT string s
STEP 3 - StringBuffer sb = s
STEP 4 - sb.reverse
STEP 5 - String rev = sb
STEP 6 - IF rev = s GOTO STEP 7 OTHERWISE GOTO STEP 8
STEP 7 - PRINT " Palindrome"
STEP 8 - PRINT " Not Palindrome"
STEP 9 – END

50
PROGRAM 18
To Display a Frequency of Each Character in
Entered String

Solution
import java.io.*;
import java.util.Scanner ;
class Frequency
{
private int i,a1,l,p,j,freq;
public Frequency()
{
p=0;
freq=0;
}
public void count(String str)
{
int ii;
l=str.length();
System.out.print(str);
for(i=0;i<l;i++) {
char a=str.charAt(i);
for(ii=0;ii<l;ii++) {
char b = str.charAt(ii);
if (a==b)
freq=freq+1;
}
System.out.println(a+" occurs "+freq+" times");
freq=0;
}
}
public static void main(String args[])
{
Scanner sc=new Scanner (System.in);
System.out.println("enter string");
String str = sc.nextLine();
Frequency x = new Frequency();
x.count(str);

51
}
}

Output

Variable Description Table

52
Algorithm
STEP 1 - START
STEP 2 - INPUT str
STEP 3 - l=str.length()
STEP 4 - PRINT str
STEP 5 - IF i=0 THEN GOTO STEP 4 OTHERWISE GOTO STEP 22
STEP 6 - char a=str.charAt(i)
STEP 7 - IF ii=0 THEN GOTO STEP 4 OTHERWISE GOTO STEP 22
STEP 8 - char b = str.charAt(ii)
STEP 9 - IF a==b GOTO STEP 10
STEP 10 - freq=freq+1
STEP 11 - ii++ & IF ii<1 GOTO STEP 8
STEP 12 - i++ & IF i<1 GOTO STEP 6
STEP 13 - DISPLAY a+" occurs "+freq+" times"
STEP 14 – END

53
PROGRAM 19
To Find a Word in Entered String

Solution
import java.util.StringTokenizer;
import java.io.*;
import java.util.Scanner ;
public class WordSearch
{
public static void main(String[] args)
{
Scanner sc= new Scanner(System.in);
System.out.println("enter the string=");
String s = sc.nextLine();
StringTokenizer st = new StringTokenizer(s," ");
System.out.println("enter the word to be searched =");
String look = sc.nextLine();
int flag = -1;
while(st.hasMoreElements())
{
if(look.equals(st.nextElement()))
flag =1;
}
if(flag ==-1)
{System.out.println("the word not found");
}
else {
System.out.println("the word found");
}
}
}

Output

54
Variable Description Table

Algorithm
STEP 1 - START
STEP 2 - INPUT string s
STEP 3 - StringTokenizer st = s
STEP 4 - l =str.length()
STEP 5 - INPUT look
STEP 6 - flag = -1
STEP 7 - IF (st.hasMoreElements()) REPEAT STEP 8
STEP 8 - IF (look.equals(st.nextElement())) THEN flag =1
STEP 9 - IF flag = - 1 GOTO STEP 10 OTHERWISE STEP 11
STEP 10 - PRINT "word not found"
STEP 11 - PRINT "word found"
STEP 12 – END

55
PROGRAM 20
To Decode the Entered String

Solution
import java.io.*;
import java.util.Scanner ;
class Decode
{
public void compute()
{
Scanner sc = new Scanner(System.in);
System.out.println(“Enter name:”);
String name= sc.nextLine();
System.out.println(“Enter number:”);
int n= sc.nextInt();
int j,i,l,c=0,y,n1;
l=name.length();
System.out.println("original string is "+name);
for(i=0;i<l;i++) {
char c1=name.charAt(i);
try {
c=(int)c1 ;
}
catch(NumberFormatException e)
{
}
if(n>0) {
if((c+n)<=90)
System.out.print((char)(c+n));
else {c=c+n;
c=c%10;
c=65+(c-1);
System.out.print((char)(c));
}
}
else if(n<0) {
n1=Math.abs(n);
if((c-n1) >=65)

56
System.out.print((char) (c-n1));
else {if(c>65)
c=c-65;
else c=n1;
System.out.print((char)(90-(c-1)));
}
}
else if (n==0) {
System.out.println("no change "+name);
break;
}
}
}
}

Output

Variable Description Table

57
Algorithm
STEP 1 - START
STEP 2 - INPUT name, n
STEP 3 - l=name.length()
STEP 4 - PRINT original string is "+name
STEP 5 - IF i=0 THEN GOTO STEP 6
STEP 6 - char c1=name.charAt(i)
STEP 7 - c=(int)c1
STEP 8 - IF n>0 THEN GOTO STEP 9 THERWISE GOTO STEP 12
STEP 9 - IF (c+n)<=90 THEN GOTO STEP 10 OTHERWISE GOTO
STEP 11
STEP 10 - PRINT (char)(c+n)
STEP 11 - c=c+n;c=c%10,c=65+(c-1) & PRINT (char)(c)
STEP 12 - ELSE IF n<0 THEN GOTO STEP 13 OTHERWISE GOTO
STEP 19
STEP 13 - n1=Math.abs(n)
STEP 14 - IF (c-n1) >=65 THEN GOTO STEP 15 OTHERWISE
GOTO STEP 16
STEP 15 - DISPLAY (char) (c-n1)
STEP 16 - IF c>65 THEN GOTO STEP 17 OTHERWISE GOTO STEP
18
STEP 17 - c=c-65,
STEP 18 - c=n1 & PRINT (char)(90-(c-1))
STEP 19 - ELSE IF n==0
STEP 20 - DISPLAY "no change "+name
STEP 21 - END

58
PROGRAM 21
To Display the Entered String in Alphabetical
Order
Solution
import java.io.*;
import java.util.Scanner ;
class Alpha
{
String str;
int l;
char c[] = new char[100];
public Alpha() {
str = "";
l =0;
}
public void readword() {
System.out.println("enter word - ");
Scanner sc = new Scanner(System.in);
str = sc.nextLine();
l = str.length();
}
public void arrange() {
int i,j;
char temp;
for(i=0;i<l;i++) {
c[i]= str.charAt(i);
}
for(i=0;i<l-1;i++) {
for(j=0;j<l-1-i;j++) {
if(c[j] > c[j+1]) {
temp = c[j];
c[j] = c[j+1];
c[j+1] = temp;
}
}
}
}
public void display() {

59
System.out.println();
for(int i=0;i<l;i++) {
System.out.print(c[i]);
}
}
public static void main(String args[]) {
Alpha obj = new Alpha();
obj.readword();
obj.arrange();
obj.display();
}
}

Output

Variable Description Table

Algorithm
STEP 1 - START
STEP 2 - str = "" , l = 0
STEP 3 - INPUT string str
STEP 4 - l =str.length()
STEP 5 - FROM i=0 to i<l REPEAT STEP 6
STEP 6 - c[i] = str.charAt(i)
STEP 7 - FROM i=0 to i<l-1 REPEAT STEP 8

60
STEP 8 - FROM j=0 to i<l-1 REPEAT STEP 9
STEP 9 - temp =c[j], c[j] = c[j+1] , c[j+1] = temp
STEP 10 - FROM i=0 to i<l REPEAT STEP 11
STEP 11 - PRINT c[i]
STEP 12 – END

61
PROGRAM 22
To Create a String and Count Number of
Vowels and Consonants

Solution
import java.io.*;
import java.util.Scanner ;
class Vowels
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter a string");
String a=sc.nextLine();
int z=a.length(),y,x=0,b=0;
for(y=0;y<z;y++){
if(a.charAt(y)=='a'||a.charAt(y)=='e'||a.charAt(y)=='i'||
a.charAt(y)=='o'||a.charAt(y)=='u')
x++;
else b++;
}
System.out.println("Number of vowels in string ="+x);
System.out.println("Number of consonants in string ="+b);
}
}

Output

62
63
Variable Description Table

Algorithm
STEP 1 - START
STEP 2 - a = "Computer Applications"
STEP 3 - z = a.length()
STEP 4 - x= 0 , b= 0
STEP 5 - FROM y =0 to y<z REPEAT STEP 6
STEP 6 – IF (a.charAt(y) =='a'||a.charAt(y)=='e' ||
a.charAt(y)=='i' || a.charAt(y)=='o' ||a.charAt(y)=='u') THEN x
=x +1 OTHERWISE b = b+1
STEP 7 - PRINT x
STEP 8 - PRINT b
STEP 9 – END

64
PROGRAM 23
To Create a String and Count Number of
Words

Solution
import java.io.*;
import java.util.Scanner ;
class NoOfWords
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println("Enter Sentence");
String a=sc.nextLine();
System.out.println("The string is -"+a);
int z=a.length(),y,x=0;
for(y=0;y<z;y++)
{
if(a.charAt(y)==' ')
x=x+1;
}
System.out.println("Number of words in string ="+(x+1));
}
}

Output

65
66
Variable Description Table

Algorithm
STEP 1 - START
STEP 2 - a = "Computer Applications"
STEP 3 - z = a.length()
STEP 4 - x= 0
STEP 5 - FROM y =0 to y<z REPEAT STEP 6
STEP 6 - IF (a.charAt(y)==' ' ) then x =x+1
STEP 7 - PRINT "Number of words in string ="+(x+1)
STEP 8 – END

67
PROGRAM 24
To create a string and replace all vowels with
*

Solution
import java.io.*;
import java.util.Scanner ;
class VowelReplace
{
public static void main(String args[])
{
Scanner sc = new Scanner(System.in);
System.out.println(“Enter a String”);
String a=sc.nextLine();
System.out.println("Original String -"+a);
int z=0;
for(z=0;z<a.length();z++)
{
if(a.charAt(z)=='a'||a.charAt(z)=='e'||a.charAt(z)=='i'||
a.charAt(z)=='o'||a.charAt(z)=='u')
a.setCharAt(z,'*');
}
System.out.println("New String -"+a);
}
}

Output

68
Variable Description Table

Algorithm
STEP 1 - START
STEP 2 - a = "Computer Applications"
STEP 3 - x= 0
STEP 4 - FROM z =0 to z<a.length() REPEAT STEP 5
STEP 5 – if (a.charAt(z)=='a' ||a.charAt(z)=='e' ||
a.charAt(z)=='i' || a.charAt(z)=='o'||a.charAt(z)=='u’) THEN
a.setCharAt(z,'*')
STEP 6 - PRINT "New String -"+a
STEP 7 – END

69
PROGRAM 25
To Generate Sum of All Elements of a Double
Dimensional Array of 5*5 Subscripts

Solution
import java.io.*;
import java.util.Scanner ;
class MatrixSum
{
public static void main(String args[])
{
int a[][]=new int[5][5];
Scanner sc = new Scanner(System.in);
int x,y,z,Sum=0;
System.out.println("Enter the array");
for(x=0;x<5;x++) {
for(y=0;y<5;y++) {
z=sc.nextInt();
a[x][y]=z;
}
}
System.out.println("Array -");
for(x=0;x<5;x++){
for(y=0;y<5;y++){
System.out.print(a[x][y]+" ");
}
System.out.print("\n");
}
for(x=0;x<5;x++) {
for(y=0;y<5;y++) {
Sum=Sum+a[x][y];
}
}
System.out.println("Sum of Array
elements="+Sum);
}
}

70
Output

Variable Description Table

Algorithm
STEP 1 START -
STEP 2 - INPUT a[]
STEP 3 - FROM x = 0 to x < 5 REPEAT STEP 4
STEP 4 - FROM y = 0 to Y < 5 REPEAT STEP 5
STEP 5 - PRINT (a[x][y]+""
STEP 6 - FROM x = 0 to x < 5 REPEAT STEP 7
STEP 7 - FROM y = 0 to y < 5 REPEAT STEP 8
STEP 8 - Sum=Sum+a[x][y]
STEP 9 - PRINT Sum
STEP10 - END

71
PROGRAM 26
To Find Sum of Each Column of a Double
Dimensional Array

Solution
import java.io.*;
import java.util.Scanner ;
class ColoumnSum{
public static void main(String args[]){
int a[][]=new int[4][4];
Scanner sc=new Scanner(System.in);
int x,y,z,Sum=0;
System.out.println("Enter the array");
for(x=0;x<4;x++){
for(y=0;y<4;y++){
z=sc.nextLine();
a[x][y]=z;
System.out.println("Array -");
for(x=0;x<4;x++){
for(y=0;y<4;y++){
System.out.print(a[x][y]+" ");
}
System.out.print("\n");
}
for(y=0;y<4;y++){
for(x=0;x<4;x++){
Sum=Sum+a[x][y];
}
System.out.println("Sum of column "+(y+1)+" is "+Sum);
Sum=0;
}
}
}

72
Output

Variable Description Table

Algorithm
STEP 1 - START
STEP 2 - INPUT a[]
STEP 3 - FROM x =0 to x<4 REPEAT STEP 4
STEP 4 - FROM y =0 to y<4 REPEAT STEP 5
STEP 5 - PRINT (a[x][y]+" "
STEP 6 - FROM x =0 to x<4 REPEAT STEP 7 , STEP 9 and STEP
10
STEP 7 - FROM y =0 to y<4 REPEAT STEP 8
STEP 8 - Sum=Sum+a[x][y] ,
STEP 9 - PRINT Sum
STEP10 - Sum = 0
STEP11 – END

73
PROGRAM 27
To Find Sum of Diagonal of a Double
Dimensional Array of 4*4 Subscripts

Solution
import java.io.*;
import java.util.Scanner ;
class DiagonalSum
{
public static void main(String args[])
Scanner sc=new Scanner (System.in);
int x,y,z,Sum=0;
System.out.println("Enter the array");
for(x=0;x<4;x++){
for(y=0;y<4;y++){
z=sc.nextLine();
a[x][y]=z;
}
}
System.out.println("Array -");
for(x=0;x<4;x++){
for(y=0;y<4;y++){
System.out.print(a[x][y]+" ");
}
System.out.print("\n");
}
y=0;
for(x=0;x<4;x++){
Sum=Sum+a[x][y]; y=y+1;
}
System.out.println("Sum of diagonal is "+Sum);
}
}

74
Output

Variable Description Table

Algorithm
STEP 1- START
STEP 2- INPUT a[]
STEP 3- FROM x =0 to x<4 REPEAT STEP 4
STEP 4- FROM y =0 to y<4 REPEAT STEP 5
STEP 5- PRINT (a[x][y]+" "
STEP 6- FROM x =0 to x<4 REPEAT STEP 7
STEP 7 - Sum=Sum+a[x][y] , y=y+1
STEP 9- PRINT Sum
STEP 10 - Sum = 0
STEP11- END

75
PROGRAM 28
To Calculate the Commission of a Salesman
as per the Following Data –

Sales Commission-
>=100000 25% of sales
80000-99999 22.5% of sales
60000-79999 20% of sales
40000-59999 15% of sales
<40000 12.5% of sales

Solution
import java.io.*;
import java.util.Scanner ;
class SalesComission
{
public static void main(String args[])
{
double sales,comm;
Scanner sc=new Scanner (System.in);
System. out.println(“Enter sales”);
sales=sc.nextLine();
if(sales>=100000)
comm=0.25*sales;
else if(sales>=80000)
comm=0.225*sales;
else if(sales>=60000)
comm=0.2*sales;
else if(sales>=40000)
comm=0.15*sales;
else comm=0.125*sales;
System.out.println("Commission of the employee="+comm);
}
}

76
Output

Variable Description Table

Algorithm
STEP 1 - START
STEP 2 - INPUT sales
STEP 3 - IF(sales>=100000) THEN comm=0.25 *sales
OTHERWISE GOTO STEP 4
STEP 4 - IF(sales>=80000) THEN comm=0.225*sales
OTHERWISE GOTO STEP 5
STEP 5 - IF(sales>=60000) THEN comm=0.2 *sales OTHERWISE
GOTO STEP 6
STEP 6 - IF sales>=40000) THEN comm=0.15 *sales
OTHERWISE GOTO STEP 7
STEP 7 - comm=0.125*sales
STEP 8 - PRINT "Commission of the employee="+comm
STEP 9 – END

77
PROGRAM 29
To Convert a Decimal Number to a Roman
Numeral

Solution
import java.io.*;
import java.util.Scanner ;
public class Dec2Roman
{
public static void main()
{
Scanner sc= new Scanner (System.in);
System.out.print("Enter Number : ");
int num=sc.nextLine();
String
hund[]={"","C","CC","CCC","CD","D","DC","DCC","DCCC","CM"}
;
String
ten[]={"","X","XX","XXX","XL","L","LX","LXX","LXXX","XC"};
String unit[]={"","I","II","III","IV","V","VI","VII","VIII","IX"};
System.out.println("Roman Equivalent=
"+hund[num/100]+ten[(num/10)%10]+unit[num%10]);
}
}

Output

78
79
Variable Description Table

Algorithm
STEP 1 – START
STEP 2 – Enter number num
STEP 3 --
hund[]={"","C","CC","CCC","CD","D","DC","DCC","DCCC","CM"}
STEP 4 --
ten[]={"","X","XX","XXX","XL","L","LX","LXX","LXXX","XC"};
STEP 5 -- unit[]={"","I","II","III","IV","V","VI","VII","VIII","IX"};
STEP 6 – Display hund[num/100] and ten[(num/10)%10] and
unit[num%10]
STEP 7 – END

80
PROGRAM 30
To Convert Celsius into Fahrenheit Using
Inheritence

Solution
import java.io.*;
import java.util.Scanner ;
class C2F
{
public static void main(String args[])
{
Temperature ob= new Temperature();
Scanner sc = new Scanner(System.in);
System.out.println("Enter temperature in Celsius");
double temp=ob.convert(sc.nextDouble());
System.out.println("The temperature in fahrenheit is =
"+temp);
}
}
class Temperature extends C2F
{
double convert(double celsius)
{
double far=1.8*celcius+32.0;
return far;
}
}

Output

81
82
Variable Description Table

Algorithm
STEP 1 – START
STEP 2 -- Input temperature ‘celcius’ in celcius
STEP 3 – far=1.8*celcius + 32
STEP 4 – Display farenhite
STEP 5 -- END

83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98