ISC Class XII-COMPUTER PROJECT

1
ISC COMPUTER SCIENCE PROJECT
Program:1
To Find a Word in Entered String
Algoritum
STEP 1- START
STEP 2- INPUT string s
STEP 3- String Tokenizer st = s
STEP 4- I=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
STEP10- PRINT “word not found”
STEP 11- PRINT “ word found”
STEP 12- END
1
2
Solution:
import java.util.StringTokenizer;
import java.io.*;
public class word_search
public static void main(String[]args) throws IOException
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
System.out.println("enter the string=");
String s= br.readLine();
StringTokenizer st = new StringTokenizer(s,"");
System.out.println("enter the word to be searched =");
String look = br.readLine();
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");
}
2
3
Variable description
No. Name Type Method Description
1 br BufferedReader main() BufferedReader object
2 s String main() input string
3 st StringTokenizer main() StringTokenizer object
4 look String main() word to be searched
5 flag int main() flag
Output:
3
4
Program:2
To decode the entered string
Algoritum
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
4
5
Solution:
class Decode
public void compute(String name,int n)
int j,i,l,c=0,y,n1;
l=name.length();
System.out.println("orignal 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));
}
5
6
else if(n<0)
n1=Math.abs(n);
if((c-n1)>=65)
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;
6
7
1 br BufferedReader compute() BufferedReader object
2 name String compute() input string
3 n int compute() decode number
4 j int compute() loop variable
5 i int compute() loop variable
6 l int compute() length of string
7 c int compute() ASCII of c1
8 y int compute()
9 n1 int compute()
10 c1 char compute() character at index i

11 e NumberFormatException compute() NumberFOrmatException object
Output:
7
8
Program:3
To display the entered string in
alphabetical order
Algoritum
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
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
8
9
Solution:
import java.io.*;
class Alpha
String str;
int l;
char c[]=new char[100];
public Alpha()
str = "";
l=0;
public void readword() throws IOException
System.out.println("enter word-");
BufferedReader br =new BufferedReader(new InputStreamReader(System.in));
str = br.readLine();
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++)
9
10
if(c[j]>c[j+1])
temp=c[j];
c[j]=c[j+1];
c[j+1]=temp;
public void display()
System.out.println();
for(int i=0;i<l;i++)
System.out.print(c[i]);
public static void main(String args[]) throws IOException
Alpha obj=new Alpha();
obj.readword();
obj.arrange();
obj.display();
10
11
1 br BufferedReader readword() BufferedReader object
2 str String - input string
3 l int - length
4 c char[] - character array
5 i int readword() loop variable
6 j int readword() loop variable
7 temp char readword() temporary storage
8 obj Alpha main() Alpha object
Output:
11
12
Program:4
To Check if Entered String is
Palindrome or Not
Algoritum
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
12
13
Solution:
import java.io.*;
class Palindrome
System.out.println("enter the string=");
String s = br.readLine();
StringBuffer sb = new StringBuffer(s);
sb.reverse();
String rev = new String(sb);
if(s.equals(rev))
System.out.println("palindrome");
else
System.out.println("Not Palindrome");
13
14
2 s String main() input string
3 sb StringBuffer main() StringBuffer object of s
4 rev String main() revese string
Output:
14
15
Program:5
To create a string and replace all
vowels with *
Algoritum
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
15
16
Solution:
import java.io.*;
class VowelReplace
public static void main(String args[])
StringBuffer a=new StringBuffer("Computer Applications");
System.out.println("Original String-"+a);
int z=0;
for(z=0;z<a.length();z++)//loop for replacing vowels with "*"
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);
2 a StringBuffer main() StringBuffer object of input string
3 z int main() loop variable
16
17
Output:
17
18
Program:6
To Convert Celsius into
Fahrenheit Using Inheritence
Algoritum
STEP 1 – START
STEP 2 -- Input temperature ‘celcius’ in celcius
STEP 3 – far=1.8*celcius + 32
STEP 4 – Display far
STEP 5 -- END
Solution:
import java.io.*;
class C2F
public static void main(String args[])throws IOException
18
19
Temperature ob=new Temperature();
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
System.out.println("Enter temperature in Celsius");
double temp=ob.convert(Double.parseDouble(br.readLine()));
System.out.println("The temperature in fahrenheit is="+temp);
class Temperature extends C2F
double convert(double celcius)
double far=1.8*celcius+32.0;
return far;
2 ob C2F main() C2F object
3 temp double main() calculated Fahrenheit temperature
4 celcius double convert() input temperature in Celsius
5 far double convert() Calculated Fahrenheit temperature
19
20
Output:
20
21
Program:7
To Generate Sum of All Elements
of a Double Dimensional Array of
5*5 Subscripts
Algoritum
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 8 - Sum=Sum+a[x][y]
STEP 9 - PRINT Sum
STEP10 – END
21
22
Solution:
import java.io.*;
class MatrixSum
int a[][]=new int[5][5];
BufferedReader aa=new BufferedReader(new InputStreamReader(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=Integer.parseInt(aa.readLine()); //accepting array element
a[x][y]=z;
System.out.println("Array -");
for(x=0;x<5;x++) //loop for printing array
for(y=0;y<5;y++)
System.out.print(a[x][y]+" ");
22
23
System.out.print("\n");
for(x=0;x<5;x++)//loop for printing sum of array elements
for(y=0;y<5;y++)
Sum=Sum+a[x][y];
System.out.println("Sum of Array elements="+Sum);
1 aa BufferedReader main() BufferedReader object
2 a int[][] main() input array
3 x int main() loop variable
4 y int main() loop variable
5 z int main() input element
6 Sum main() main() Sum of all elements
23
24
Output:
24
25
Program:8
To find sum of each column of a
double dimensional array
Algoritum
STEP 1 - START
STEP 2 - INPUT a[]
STEP 5 - PRINT (a[x][y]+" "
STEP 6 - FROM x =0 to x<4 REPEAT STEP 7 , STEP 9 and STEP 10
STEP 8 - Sum=Sum+a[x][y] ,
STEP 9 - PRINT Sum
STEP 10 - Sum = 0
STEP11 – END
25
26
Solution:
import java.io.*;
class ColoumnSum
BufferedReader aa=new BufferedReader(new InputStreamReader(System.in));
int x,y,z,Sum=0;
System.out.println("Enter the array");//reading array
for(x=0;x<4;x++)
for(y=0;y<4;y++)
z=Integer.parseInt(aa.readLine());
a[x][y]=z;
System.out.println("Array -");//printing the array in matrix form
for(x=0;x<4;x++)
for(y=0;y<4;y++)
26
27
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);//printing sum of coloumn
Sum=0;
2 a int[][] main() input array
6 Sum int main() Sum of each couloumn
27
28
Output:
28
29
Program:9
To find sum of diagonal of a
double dimensional array of 4*4
subscripts
Algoritum
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
29
30
Solution:
import java.io.*;
class DiagonalSum
public static void main(String args[])throws IOException//main function
int x,y,z,Sum=0;
System.out.println("Enter the array");
for(x=0;x<4;x++)//Reading array
for(y=0;y<4;y++)
z=Integer.parseInt(aa.readLine());
a[x][y]=z;
System.out.println("Array -");
for(x=0;x<4;x++) //displaying array
for(y=0;y<4;y++)
30
31
y=0;
for(x=0;x<4;x++)
Sum=Sum+a[x][y];
y=y+1;
}
System.out.println("Sum of diagonal is "+Sum); //displaying the sum of diagonal
Sum=0;
2 a int[][] main() input matrix
5 Sum int main() Sum of diagonals
31
32
Output:
32
33
Program:10
To convert a decimal no into it
binary equivalent
Algoritum
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
33
34
Solution:
import java.io.*;
class Dec2Bin
int n,i;
int a[] = new int[100];
static BufferedReader br =new BufferedReader(new InputStreamReader(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[]) throws IOException //main function
34
35
Dec2Bin obj = new Dec2Bin(30); System.out.println("enter decimal no -");
int no = Integer.parseInt(br.readLine()); obj.dectobin(no);
1 br BufferedReader BufferedReader object
2 n int - array length

3 i int - loop variable
4 a[] int[] - array storing binary no.
5 nn int Dec2Bin() parameter in constructor
6 no int main(), dectobin() input number
7 temp int dectobin() temporary storage
8 c int dectobin() counter
9 obj Dec2Bin main() Dec2Bin object
35
36
Output:
36
37
Program:11
To display date from entered day
number
Algoritum
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
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
37
38
Solution:
import java.io.*;
class Day2Date
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);
38
39
if( d == 3|| d == 23 )
System.out.println( d + "rd" + m[s] + " , "+yr);
else {System.out.println( d + "th" + m[s] + " , "+yr);
Day2Date obj = new Day2Date();
System.out.println( "Enter day no = ");
int n=Integer.parseInt(br.readLine());
System.out.println( "Enter year = ");
int yr=Integer.parseInt(br.readLine());
obj.calc(n,yr);
1 br BufferedReader - BufferedReader object
2 n int calc(), main() Day number
3 yr int calc(), main() year
4 a int[] calc() array storing day
5 m int[] calc() array storing month
6 t int calc() array index
7 s int calc() array index
8 d int calc() n+a[--s]+t
9 obj Day2Date main() Day2Date object
39
40
Output:
40
41
Program:12
To display spiral matrix
Algoritum
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++
41
42
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
STEP 28 – END
Solution:
import java.io.*;
class SpiralMatrix
public static void main(String[] args) throws IOException
int a[][],r,c,k1=2,k2=3,p=0,co=0,re=0;
System.out.println("enter the dimension of matrix A x A =");
int l = Integer.parseInt(br.readLine()); //accepting dimension of square spiral matrix
a=new int[l][l];
r=l/2;c=r-1;
if(l%2==0)
System.out.println("wrong entry for spiral path");
42
43
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++)
p++;r--;a[r][c]=p;
k1=k1+2; k2=k2+2;
co++;
for(int y=0;y<l;y++)
43
44
for(int yy=0;yy<l;yy++)
System.out.print("\t"+a[y][yy]);
2 a int[][] main() spiral matrix
3 r int main() l/2
4 c int main() r-1
5 k1 int main() stores 2
6 k2 int main() stores 3
7 p int main() loop gate
8 co int main() coloumn index
9 re int main() row index
10 l int main() dimensions of thr matrix
11 ri int main() right side matrix loop variable
12 le int main() left side matrix loop variable
13 dw int main() down side matrix loop variable
14 up int main() up side matrix loop variable
15 y int main() loop variable to print matrix
16 yy int main() loop variable to print matrix
44
45
Output:
45
46
Program:13
To display magical square
Algoritum
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
46
47
Solution:
import java.io.*;
class MagicSquare
public static void main(String args[])throws Exception
System.out.println("enter the dimension of magical square=");
int n = Integer.parseInt(br.readLine());
int arr[][]=new int[n][n],c=n/2-1,r=1,num;
for(num=1;num<=n*n;num++)
r--;
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;
47
48
if(c==n-1&&r==0)
arr[++r][c]=++num;
for(r=0;r<n;r++)
for(c=0;c<n;c++)
System.out.print(arr[r][c]+" ");
2 n int main() input dimensions
3 arr int[][] main() magic square matrix
4 num int main() loop variable for magic square
5 r int main() row
6 c int main() coloumn
48
49
Output:
49
50
Program:14
To sort an array using Selection
Sort
Algoritum
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
50
51
Solution:
import java.io.*;
class SelectionSort
int n,i;
public SelectionSort(int nn)
n=nn;
public void input() throws IOException
System.out.println("enter elements");
for(i=0;i<n;i++)
a[i] = Integer.parseInt(br.readLine());
for(i=0;i<n;i++)
System.out.print(a[i]+" ");
51
52
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;
if(min!=i)
temp = a[i]; a[i] =a[min]; a[min] = temp;
SelectionSort x = new SelectionSort(5);
x.input();
System.out.print("Before sorting - ");
x.display();
System.out.print("After sorting - ");
x.sort();
x.display();
52
53
1 br BufferedReader input() BufferedReader object
4 a[] int[] - input array
5 nn int SelectionSort() parameter in constructor
6 j int sort() sort index
7 temp int sort() temporary storage
8 min int sort() minimum value
9 x SelectionSort main() SelectioSort object
Output:
53
54
Program:15
To sort an array using Bubble Sort
Algoritum
STEP 1 - START
STEP 2 - INPUT a[]
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
54
55
Solution:
import java.io.*;
class BubbleSort
int n,i;
public BubbleSort(int nn)
n=nn;
for(i=0;i<n;i++)
{System.out.println();
for(i=0;i<n;i++)
55
56
public void sort()
{int j,temp;
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;
BubbleSort x = new BubbleSort(5);
x.input();
System.out.print("Before sorting - ");
x.display();
System.out.print("After sorting - ");
x.sort();
x.display();
56
57
1 br BufferedReader input BufferedReader object
5 nn int BubbleSort() parameter in constructor
6 j int sort() sort index
7 temp int sort() temporary storage
8 x SelectionSort main() SelectionSort object
Output:
57
58
Program:16
To display a frequency of each
character in entered string
Algoritum
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
58
59
Solution:
import java.io.*;
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;
59
60
System.out.println("enter string");
String str = br.readLine();
Frequency x = new Frequency();
x.count(str);
3 a1 int - instance variable
4 l int - length of string
5 p int - instance variable
6 freq int - frequency of characters
7 ii int count() loop variable
8 a char count() character at index i
9 b char count() character at index ii
10 str String main() input string
11 x Frequency main() Frequency object
60
61
Output:
61
62
Program:17
To create a string and count
number of vowels and consonants
Algoritum
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
62
63
Solution:
import java.io.*;
class Vowels
System.out.println("Enter a string");
String a= br.readLine();
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);
63
64
2 a String main() input string
3 z int main() length of string
5 b int main() no. of consonants
6 x int main() no. of vowels
Output:
64
65
Program:18
To search an array using Linear
Search
Algoritum
STEP 1 - START
STEP 2 - INPUT a[]

STEP 5 - flag=-1
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
65
66
Solution:
import java.io.*;
class LinearSearch
int n,i;
public LinearSearch(int nn)
n=nn;
{System.out.println("enter elements");
for(i=0;i<n;i++)
for(i=0;i<n;i++)
66
67
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);
LinearSearch obj = new LinearSearch(10);
obj.input();
obj.display();
System.out.println("enter no. to be searched -");
int v = Integer.parseInt(br.readLine());
obj.search(v);
67
68
5 nn int LinearSearch() parameter in constructor
6 v int search(), main() search element
7 flag int search() flag
8 obj LinearSearch main() LinearSearch object
Output:
68
69
Program:19
To search an array using Binary
Search
Algoritum
STEP 1 - START
STEP 2 - INPUT a[]
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
69
70
Solution:
import java.io.*;
class BinarySearch
int n,i;
public BinarySearch(int nn)
n=nn;
for(i=0;i<n;i++)
for(i=0;i<n;i++)
70
71
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;
if(flag== -1 )
System.out.println("not found");
else
System.out.println(v+" found at position - "+flag);
BinarySearch
obj = new BinarySearch(10);
obj.input();
obj.display();
System.out.println("enter no. to be searched -");
int v = Integer.parseInt(br.readLine());
obj.search(v);
71
72
5 nn int BinarySearch() parameter in constructor
6 v int search(), main() search element
7 flag int search() flag
8 l int search() lower limit
9 u int search() upper limit
10 m int search() middle index
11 obj BinarySearch main() BinarySearch object
Output:
72
73
Program:20
To display Fibonacci series using
recursion
Algoritum
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
Solution:
import java.io.*;
class Fibonacci
Fibonacci obj = new Fibonacci();
System.out.println("enter no of term =");
73
74
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));
2 obj Fibonacci main() Fibonacci object
3 n int main() input number
4 i int main() loop variable for Fibonacci element
5 f int main() Fibonacci element
6 n int fib() recursive function fib() parameter
74
75
Output:
75
76
Program:21
To calculate GCD using recursion
Algoritum
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
Solution:
import java.io.*;
class GCD
System.out.println("enter the numbers =");
int p = Integer.parseInt(br.readLine());
76
77
int q = Integer.parseInt(br.readLine());
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);
2 p int main() ,calc() input number
3 q int main() ,calc() input number
4 obj GCD main() GCD object
5 g int main() variable storing the GCD
77
78
Output:
78
79
Program:22
To calculate factorial using
recursion
Algoritum
STEP 1 - START
STEP 2 - INPUT n
STEP 3 - IF(n<2) THEN return 1 OTHERWISE return (n * fact(n-1))
STEP 4 – END
Solution:
import java.io.*;
class Factorial
System.out.println("enter no =");
79
80
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));
2 n int main() input number
3 obj Factorial main() Factorial object
4 f long main() variable storing factorial
5 n int fact() parameter in recursive function fact()
80
81
Output:
81
82
Program:23
To display calendar of any month
of any year
Algoritum
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 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")
82
83
STEP 18 - count--
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
Solution:
import java.io.*;
class Calendar
{
public void dee(int month,int year)
{
int i,count=0,b,d=1;
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","July","August","September","Octob
er","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++)
count+=days[i];
count+=1;
83
84
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(" ");
}
}
}
1 br BufferedReader dee() BufferedReader object
2 i int dee() loop variable
3 count int dee() counter
4 b int dee() week counter
5 d int dee() day counter
6 month int dee() input month
7 year int dee() input year
8 w String dee() week days
9 days String[] dee() array storing days
10 month1 String[] dee() array storing months
84
85
Output:
85
86
Program:24
To display entered number in
words
Algoritum
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
86
87
Solution:
import java.io.*;
class Num2Words
String x3;
System.out.println("Enter any Number(less than 99)");
int amt=Integer.parseInt(br.readLine());
int a,b,c,y,z,g;
String
x[]={"","Ten","Eleven","Twelve","Thirteen","Fourteen","Fifteen","Sixteen","Seventeen","E
ighteen","Nineteen"};
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]);
87
88
2 z int main() amt%10
3 g int main() amt/10
4 x String[] main() String array storing no.in words
5 x1 String[] main() String array storing no.in words
6 x2 String[] main() String array storing no.in words
7 amt int main() input number
Output:
88
89
Program:25
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
Algoritum
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 7 - comm=0.125*sales
STEP 8 - PRINT "Commission of the employee="+comm
STEP 9 – END
89
90
Solution:
import java.io.*;
class SalesComission
double sales,comm;
System.out.println("Enter sales");
sales=Double.parseDouble(aa.readLine());
if(sales>=100000)
comm=0.25*sales;
else if(sales>=80000)
comm=0.225*sales;
comm=0.2*sales;
comm=0.15*sales;
else
comm=0.125*sales;
System.out.println("Commission of the employee="+comm);
90
91
2 sales double main() sales
3 comm. double main() commision
Output:
91

ISC Class XII-COMPUTER PROJECT

Uploaded by

Document Information

Original Description:

Copyright

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

ISC Class XII-COMPUTER PROJECT

Uploaded by

Copyright:

1

ISC COMPUTER SCIENCE PROJECT

STEP 2- INPUT string s

STEP 3- String Tokenizer st = s

STEP 5- INPUT look

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

STEP10- PRINT “word not found”

STEP 11- PRINT “ word found”

STEP 12- END

public class word_search

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

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

System.out.println("enter the string=");

StringTokenizer st = new StringTokenizer(s,"");

System.out.println("enter the word to be searched =");

String look = br.readLine();

int flag = -1;

System.out.println("the word not found");

System.out.println("the word found");

1 br BufferedReader main() BufferedReader object

2 s String main() input string

3 st StringTokenizer main() StringTokenizer object

4 look String main() word to be searched

5 flag int main() flag

public void compute(String name,int n)

System.out.println("orignal string is"+name);

10 c1 char compute() character at index i

char c[]=new char[100];

public void readword() throws IOException

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

public void arrange()

public void display()

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

Alpha obj=new Alpha();

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

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

System.out.println("enter the string=");

StringBuffer sb = new StringBuffer(s);

String rev = new String(sb);

1 br BufferedReader main() BufferedReader object

2 s String main() input string

3 sb StringBuffer main() StringBuffer object of s

4 rev String main() revese string

public static void main(String args[])

StringBuffer a=new StringBuffer("Computer Applications");

for(z=0;z<a.length();z++)//loop for replacing vowels with "*"

1 br BufferedReader main() BufferedReader object

2 a StringBuffer main() StringBuffer object of input string

3 z int main() loop variable

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

Temperature ob=new Temperature();

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

System.out.println("Enter temperature in Celsius");

System.out.println("The temperature in fahrenheit is="+temp);

class Temperature extends C2F

double convert(double celcius)

1 br BufferedReader main() BufferedReader object

2 ob C2F main() C2F object

3 temp double main() calculated Fahrenheit temperature

4 celcius double convert() input temperature in Celsius

5 far double convert() Calculated Fahrenheit temperature

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

int a[][]=new int[5][5];

BufferedReader aa=new BufferedReader(new InputStreamReader(System.in)); int