62
Qwertyuiopasdfghjklzxcvbnmq wertyuiopasdfghjklzxcvbnmqw ertyuiopasdfghjklzxcvbnmqwe rtyuiopasdfghjklzxcvbnmqwer tyuiopasdfghjklzxcvbnmqwert yuiopasdfghjklzxcvbnmqwerty uiopasdfghjklzxcvbnmqwertyu iopasdfghjklzxcvbnmqwertyui opasdfghjklzxcvbnmqwertyuio pasdfghjklzxcvbnmqwertyuiop asdfghjklzxcvbnmqwertyuiopa sdfghjklzxcvbnmqwertyuiopas dfghjklzxcvbnmqwertyuiopasd fghjklzxcvbnmqwertyuiop asdfghjklzxcvbnmqwertyuiopa sdfghjklzxcv 1 1 COMPUTER SCEIENCE COMPUTER SCEIENCE PROJECT NAME : TABISH HAIDER RIZVI CLASS : XII B ROLL NO : 25 SCHOOL : LA MARTINIERE COLLEGE

Computer Project For ISC

Embed Size (px)

Citation preview

Page 1: Computer Project For ISC

Qwertyuiopasdfghjklzxcvbnmqwertyuiopasdfghjklzxcvbnmqwertyuiopasdfghjklzxcvbnmqwertyuiopasdfghjklzxcvbnmqwertyuiopasdfghjklzxcvbnmqwertyuiopasdfghjklzxcvbnmqwertyuiopasdfghjklzxcvbnmqwertyuiopasdfghjklzxcvbnmqwertyuiopasdfghjklzxcvbnmqwertyuiopasdfghjklzxcvbnmqwertyuiopasdfghjklzxcvbnmqwertyuiopasdfghjklzxcvbnmqwertyuiopasdfghjklzxcvbnmqwertyuiopasdfghjklzxcvbnmqwertyuiop asdfghjklzxcvbnmqwertyuiopasdfghjklzxcv bnmqwertyuiopasdfghjklzxcvbnmqwertyuiopasdfghjklzxcvbnmrtyuiopasdfghjklzxcvbnmqwertyuiopasdfghjklzxcvbnmqwertyuiopasdfghjklzxcvbnmqwertyuiopasdfghjklzxcvbnmqwertyuiopa

1

1

COMPUTER SCEIENCE

PROJECT

NAME : TABISH HAIDER RIZVI

CLASS : XII B

ROLL NO : 25

SCHOOL : LA MARTINIERE COLLEGE

Page 2: Computer Project For ISC

2

ACKNOWLEDGEMENT

I would like to thank my Computer Science Teacher , Mr. J.V. Nagendra Rao, who guided me in making this project by giving some valuable points.

I would also like to thank my parents who helped me inmaking this project more presentable.

Page 3: Computer Project For ISC

3

TABLE OF CONTENTS

S.No. PROGRAM PAGE No.1 TO create Pascal’s triangle 42 To display entered number in words 53 To display A.P. series and its sum 64 To display calendar of any month of any year 85 To calculate factorial using recursion 106 To display Fibonacci series using recursion 117 To calculate GCD using recursion 128 To display spiral matrix 139 To display magical square 15

10 To search an array using Linear Search 1711 To search an array using Binary Search 2012 To sort an array using Selection sort 2213 To sort an array using Bubble sort 2414 To convert a decimal no into it binary equivalent 2715 To display date from entered day no. 2816 To create a pattern from entered string 3017 To check if entered string is palindrome or not 3118 To display a frequency of each character in entered string 3219 To find a word in entered string 3420 To decode the entered string 3621 To display the entered string in alphabetical order. 3822 To create a string and count number of vowels and consonants. 4023 To create a string and count number of words 4124 To create a string and replace all vowels with * 4225 To create a double-dimensional array of 4*4 subscripts. 43

26To generate sum of all elements of a double dimensional array of 5*5 subscripts

44

27 To generate product of two arrays of 5 subscripts as a third array 4628 To find sum of each column of a double dimensional array 47

29To find sum of diagonal of a double dimensional array of 4*4 subscripts

49

30 To calculate the commission of a salesman 51

Page 4: Computer Project For ISC

4

PROGRAM 1 - TO create Pascal’s triangle

Algorithm:

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

Solution:

class pascal { public void pascalw(int n) {

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];

}}}

Page 5: Computer Project For ISC

5

Output:

n = 5

1 1 1 1 2 1 1 3 3 1 1 4 6 4 1

PROGRAM 2 - To display entered number in words

Algorithm:

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

SOLUTION:

import java.io.*;class eng{ public static void main(String args[])throws IOException { BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); 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","Eighteen","Nineteen"};

Page 6: Computer Project For ISC

6

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: Enter any Number(less than 99)45Fourty Five

PROGRAM 3 - To display A.P. series and its sum

Algorithm :

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

Page 7: Computer Project For ISC

7

SOLUTION:

class APSeries{

private double a,d;APSeries(){

a = d = 0;}APSeries(double a,double d){

this.a = a;this.d = d;

}double nTHTerm(int n){

return (a+(n-1)*d);}double Sum(int n){

return (n*(a+nTHTerm(n))/2);}void showSeries(int n){

System.out.print("\n\tSeries\n\t");for(int i=1;i<=n;i++){

System.out.print(nTHTerm(i)+" ");}System.out.print("\n\tSum : "+Sum(n));

}}

Output:

a = 5d=2n=10

Series5.0 7.0 9.0 11.0 13.0 15.0 17.0 19.0 21.0 23.0 Sum : 140.0

Page 8: Computer Project For ISC

8

PROGRAM 4 - To display calendar of any month of any year

Algorithm :

STEP 1 - STARTSTEP 2 - INPUT int month,int yearSTEP 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]=29STEP 6 - PRINT "================The Calendar of "+month1[month-1]+"

"+year+" is==================") STEP 7 - IF i=0 THEN GOTO STEP 8STEP 8 - PRINT (i)+"\t" & " "STEP 9 - IF i=1 GOTO STEP 10STEP 10 - IF (year%100==0 && year%400==0) || (year%100!=0 && year%4==0)THEN

GOTO STEP 11OTHERWISE GOTO STEP 12STEP 11 - count+=2STEP 12 - count+=1STEP 13 - IF i=0 GOTO STEP 14STEP 14 - count+=days[i] , count+=1, count%=7 & b=7-countSTEP 15 - IF b!=1 || b!=7 GOTO STEP 16STEP 16 - IF count>0 GOTO STEP 17,18STEP 17 - PRINT ' '+"\t")STEP 18 - count--STEP 19 - IF i=1 GOTO STEP 20STEP 20 - IF b>0 && IF d<=days[month-1] GOTO STEP 21,22STEP 21 - PRINT d+"\t"STEP 22 - d++ & b--STEP 23 - b=7STEP 24 - i++ & IF i<MONTH GOTO STEP14STEP 25 - PRINT " "STEP 26 - END

SOLUTION:

class calendar{ public void dee(int month,int year) { int i,count=0,b,c,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","October","November","December"};

Page 9: Computer Project For ISC

9

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; 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:

month = 10year = 2009

Page 10: Computer Project For ISC

10

=====The Calendar of October 2009 is====S M T W T F S 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31

PROGRAM 5 – To calculate factorial using recursion

Algorithm :

STEP 1 - STARTSTEP 2 - INPUT nSTEP 3 - IF(n<2) THEN return 1 OTHERWISE return (n * fact(n-1)) STEP11 - END

SOLUTION:import java.io.*;

class factorial{ public static void main(String args[]) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); System.out.println("enter no ="); int n = Integer.parseInt(br.readLine()); factorial obj = new factorial(); long f = obj.fact(n); System.out.println("factotial ="+f); } public long fact(int n) { if(n<2) return 1; else return (n*fact(n-1)); }}

Page 11: Computer Project For ISC

11

Output:enter no =5factotial =120

PROGRAM 6 - To display Fibonacci series using recursion

Algorithm :

STEP 1 - STARTSTEP 2 - INPUT nSTEP 3 - IF(n<=1) THEN return 1 OTHERWISE return (fib(n-1) +fib(n-2))STEP11 - END

SOLUTION:

import java.io.*;

class fibonacci{ public static void main(String args[]) throws IOException { fibonacci obj = new fibonacci(); BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); System.out.println("enter no of term ="); int n = Integer.parseInt(br.readLine()); System.out.println(); for(int i=1;i<=n;i++) { int f = obj.fib(i); System.out.print(f+" "); } } public int fib(int n) {

Page 12: Computer Project For ISC

12

if(n<=1) return n; else return (fib(n-1) +fib(n-2)); }}

Output:

enter no of term =5

1 1 2 3 5

PROGRAM 7 - T o calculate GCD using recursion

Algorithm :

STEP 1 - STARTSTEP 2 - INPUT p,qSTEP 3 - IF(q=0) THEN return p OTHERWISE return calc(q,p%q)STEP11 - END

SOLUTION:

import java.io.*;

class gcd{ public static void main(String args[]) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); System.out.println("enter the numbers =");

Page 13: Computer Project For ISC

13

int p = Integer.parseInt(br.readLine()); 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); }}

Output :enter the numbers =128GCD =4

PROGRAM 8 - To display spiral matrix.

Algorithm:

STEP 1 - STARTSTEP 2 - INPUT a[][]STEP 3 - IF p!=(int)Math.pow(l,2) GOTO STEP 4STEP 4 - IF co!=0 GOTO STEP 5STEP 5 - re=1STEP 6 - IF ri=1;ri<=k1-re;ri++ GOTO STEP 7STEP 7 - p++,c++STEP 8 - IF c==l GOTO STEP 9STEP 9 - BREAKSTEP 10 - a[r][c]=p STEP 11 - IF c==l GOTO STEP 12STEP 12 - BREAKSTEP 13 - IF dw=1 GOTO STEP 14

Page 14: Computer Project For ISC

14

STEP 14 - p++,r++,a[r][c]=pSTEP 15 - IF le=1 GOTO STEP 16STEP 16 - p++,c--,a[r][c]=pSTEP 17 - IF up=1 GOTO STEP 18STEP 18 - p++,r--,a[r][c]=pSTEP 19 - k1=k1+2, k2=k2+2 & co++STEP 20 - up++ & IF up<=k2-1 GOTO STEP 18STEP 21 - le++ & IF le<=k2-1 GOTO STEP 16STEP 22 - dw++ & IF dw<=k1-1 GOTO STEP 14 STEP 23 - IF y=0 GOTO STEP 24STEP 24 - IF yy=0 GOTO STEP 25STEP 25 - PRINT "\t"+a[y][yy]) & ()STEP 26 - yy++ & IF yy<l GOTO STEP 25STEP 27 - y++ & IF y<l GOTO STEP 24STEP 28 - END

SOLUTION:

import java.io.*;class spiralsm { public static void main(String[] args) throws IOException { int a[][],r,c,k1=2,k2=3,p=0,co=0,re=0; BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); System.out.println("enter the dimension of matrix ="); int l = Integer.parseInt(br.readLine()); 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;}

Page 15: Computer Project For ISC

15

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++) { for(int yy=0;yy<l;yy++) System.out.print("\t"+a[y][yy]); System.out.println(); System.out.println(); } }}

Output:enter the dimension of matrix =5

21 22 23 24 25

20 7 8 9 10

19 6 1 2 11

18 5 4 3 12

17 16 15 14 13

PROGRAM 9 - T o display magical square

Algorithm:

STEP 1 - STARTSTEP 2 - arr[][]=new int[n][n],c=n/2-1,r=1,numSTEP 3 - IF num=1;num<=n*n;num++ GOTO STEP 4

Page 16: Computer Project For ISC

16

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

SOLUTION:

import java.io.*;class magicalsquare{ public static void main(String args[])throws Exception { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); 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--; }

Page 17: Computer Project For ISC

17

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(); } }

}

Output :

enter the dimension of magical square=5

17 24 1 8 15 23 5 7 14 16 4 6 13 20 22 10 12 19 21 3 11 18 25 2 9

PROGRAM 10 - T o search an array using Linear Search

Algorithm:

STEP 1 - STARTSTEP 2 - INPUT a[]STEP 3 - FROM i=0 to i<n REPEAT STEP 4STEP 4 - PRINT a[i]+" "STEP 5 - flag=-1

Page 18: Computer Project For ISC

18

STEP 6 - FROM i=0 to i<n REPEAT STEP 7STEP 7 - IF (a[i] == v) THEN flag =iSTEP 8 - IF (flag=-1) THEN GOTO STEP 9 OTHERWISE GOTO STEP 10STEP 9 - PRINT “ not found”STEP 10 - PRINT v+" found at position - "+flag STEP 11 - END

SOLUTION:

import java.io.*;

class linear_search{ int n,i; int a[] = new int[100]; static BufferedReader br =new BufferedReader(new InputStreamReader(System.in)); public linear_search(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()); } } 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++)

Page 19: Computer Project For ISC

19

{ if(a[i] == v) flag =i; } if(flag== -1 ) System.out.println("not found"); else System.out.println(v+" found at position - "+flag); } public static void main(String args[]) throws IOException { linear_search obj = new linear_search(10); obj.input(); obj.display(); System.out.println("enter no. to be searched -"); int v = Integer.parseInt(br.readLine()); obj.search(v); }}

Output :enter elements5384164795

5 3 8 4 1 6 4 7 9 5 enter no. to be searched -11 found at position - 4

Page 20: Computer Project For ISC

20

PROGRAM 11 - T o search an array using Binary Search

Algorithm:

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

STEP 11 - END SOLUTION:import java.io.*;

class binary_search{ int n,i; int a[] = new int[100]; static BufferedReader br =new BufferedReader(new InputStreamReader(System.in)); public binary_search(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()); } } public void display() { System.out.println();

Page 21: Computer Project For ISC

21

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; } if(flag== -1 ) System.out.println("not found"); else System.out.println(v+" found at position - "+flag); } public static void main(String args[]) throws IOException { binary_search obj = new binary_search(10); obj.input(); obj.display(); System.out.println("enter no. to be searched -"); int v = Integer.parseInt(br.readLine()); obj.search(v); }

Page 22: Computer Project For ISC

22

}

Output :enter elements5384164795

5 3 8 4 1 6 4 7 9 5 enter no. to be searched -11 found at position - 4

PROGRAM 12 - T o sort an array using Selection sort

Algorithm:

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

SOLUTION:import java.io.*;

Page 23: Computer Project For ISC

23

class selection_sort{ int n,i; int a[] = new int[100]; public selection_sort(int nn) { n=nn; } public void input() throws IOException { BufferedReader br =new BufferedReader(new InputStreamReader(System.in)); System.out.println("enter elements"); for(i=0;i<n;i++) { a[i] = Integer.parseInt(br.readLine()); } } 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; } if(min!=i) {

Page 24: Computer Project For ISC

24

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

Output:enter elements46129Before sorting - 4 6 1 2 9 After sorting - 1 2 4 6 9

PROGRAM 13 - T o sort an array using Bubble Sort

Algorithm:

STEP 1 - STARTSTEP 2 - INPUT a[]STEP 3 - FROM i=0 to i<n REPEAT STEP 4STEP 4 - PRINT a[i]+" "STEP 5 - flag=-1STEP 6 - FROM i=0 to i<n-1 REPEAT STEP 7 to STEP 9

Page 25: Computer Project For ISC

25

STEP 7 - FROM j=i+1 to j<n REPEAT STEP 8STEP 8 - IF(a[j] > a[j+1]) THEN GOTO STEP 9STEP 9 - temp = a[i], a[i] =a[min], a[min] = tempSTEP 10 - END

SOLUTION:

import java.io.*;

class bubble_sort{ int n,i; int a[] = new int[100]; public bubble_sort(int nn) { n=nn; } public void input() throws IOException { BufferedReader br =new BufferedReader(new InputStreamReader(System.in)); System.out.println("enter elements"); for(i=0;i<n;i++) { a[i] = Integer.parseInt(br.readLine()); } } public void display() { System.out.println(); for(i=0;i<n;i++) { System.out.print(a[i]+" "); } } public void sort() { int j,temp; for(i=0 ; i<n-1 ; i++) { for(j=0 ; j<n-1-i ; j++)

Page 26: Computer Project For ISC

26

{ if(a[j] > a[j+1]) { temp = a[j]; a[j] =a[j+1]; a[j+1] = temp; } } } } public static void main(String args[]) throws IOException { bubble_sort x = new bubble_sort(5); x.input(); System.out.print("Before sorting - "); x.display(); System.out.print("After sorting - "); x.sort(); x.display(); }}

Output:enter elements46129Before sorting - 4 6 1 2 9 After sorting - 1 2 4 6 9

PROGRAM 14 - To convert a decimal no into it binary equivalent

Page 27: Computer Project For ISC

27

SOLUTION:

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

Program :

import java.io.*;

class dec_bin{ int n,i; int a[] = new int[100]; static BufferedReader br =new BufferedReader(new InputStreamReader(System.in)); public dec_bin(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 ] ); }

Page 28: Computer Project For ISC

28

public static void main(String args[]) throws IOException { dec_bin obj = new dec_bin(30); System.out.println("enter decimal no -"); int no = Integer.parseInt(br.readLine()); obj.dectobin(no); }}

Output :enter decimal no -56Binary eq. of 56 = 111000

PROGRAM 15 - To display date from entered day no.

SOLUTION:

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

OTHERWISE GOTO STEP 12STEP 12 - PRINT d + "th" + m[s] + " , "+yrSTEP 13 - END

import java.io.*;

class daytodate{

Page 29: Computer Project For ISC

29

static BufferedReader br =new BufferedReader(new InputStreamReader(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[]) throws IOException { daytodate obj = new daytodate(); System.out.println( "Enter day no = "); int n = Integer.parseInt(br.readLine());

Page 30: Computer Project For ISC

30

System.out.println( "Enter year = "); int yr = Integer.parseInt(br.readLine()); obj.calc(n,yr); }}

Output:Enter day no = 192Enter year = 200911th Jul , 2009

PROGRAM 16 – To create a pattern from e ntered string

Program :

import java.io.*;

class pattern{ public static void main (String args[]) throws IOException { int i,sp,j,k,l; BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); System.out.println("enter the string ="); String s = br.readLine(); 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++)

Page 31: Computer Project For ISC

31

System.out.print(" "); k++; } System.out.println(" "); } }}

Output:enter the string =india

i i i nnn india iii a a a

PROGRAM 17 - To check if entered string is palindrome or not

Algorithm :

STEP 1 - STARTSTEP 2 - INPUT string sSTEP 3 - StringBuffer sb = sSTEP 4 - sb.reverseSTEP 5 - String rev = sbSTEP 6 - IF rev = s GOTO STEP 7 OTHERWISE GOTO STEP 8STEP 7 - PRINT " Palindrome" STEP 8 - PRINT " Not Palindrome"STEP 9 - END

Solution:

import java.io.*;

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

Page 32: Computer Project For ISC

32

{ BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); 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 " ); }}

Output :

enter the string=aroraPalindrome

PROGRAM 18 - To display a frequency of each character in entered string

Algorithm :

STEP 1 - STARTSTEP 2 - INPUT strSTEP 3 - l=str.length()STEP 4 - PRINT strSTEP 5 - IF i=0 THEN GOTO STEP 4 OTHERWISE GOTO STEP 22STEP 6 - char a=str.charAt(i)STEP 7 - IF ii=0 THEN GOTO STEP 4 OTHERWISE GOTO STEP 22STEP 8 - char b = str.charAt(ii)STEP 9 - IF a==b GOTO STEP 10

Page 33: Computer Project For ISC

33

STEP 10 - freq=freq+1STEP 11 - ii++ & IF ii<1 GOTO STEP 8STEP 12 - i++ & IF i<1 GOTO STEP 6STEP 13 - DISPLAY a+" occurs "+freq+" times"STEP 14 - END

Solution :

import java.io.*;class frequency { private int i,a1,l,p,j,freq; public frequency() { p=0; freq=0;// initialise instance variables } 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[]) throws IOException { BufferedReader br =new BufferedReader(new InputStreamReader(System.in)); System.out.println("enter string"); String str = br.readLine();

Page 34: Computer Project For ISC

34

frequency x = new frequency(); x.count(str); } }

Output:

enter stringschool

s occurs 1 timesc occurs 1 timesh occurs 1 timeso occurs 2 timeso occurs 2 timesl occurs 1 times

PROGRAM 19 - To find a word in entered string

Algorithm :

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

Page 35: Computer Project For ISC

35

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"); } }}

Output:

enter the string=there are 7 days in a week

enter the word to be searched =are

the word found

Page 36: Computer Project For ISC

36

PROGRAM 20 - To decode the entered string

Algorithm :

STEP 1 - STARTSTEP 2 - INPUT name, nSTEP 3 - l=name.length()STEP 4 - PRINT original string is "+nameSTEP 5 - IF i=0 THEN GOTO STEP 6STEP 6 - char c1=name.charAt(i)STEP 7 - c=(int)c1 STEP 8 - IF n>0 THEN GOTO STEP 9 THERWISE GOTO STEP 12STEP 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 16STEP 15 - DISPLAY (char) (c-n1)STEP 16 - IF c>65 THEN GOTO STEP 17 OTHERWISE GOTO STEP 18STEP 17 - c=c-65,STEP 18 - c=n1 & PRINT (char)(90-(c-1))STEP 19 - ELSE IF n==0STEP 20 - DISPLAY "no change "+nameSTEP 21 - END

Solution :class decode { public void compute(String name,int n) { 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);

Page 37: Computer Project For ISC

37

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) 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:original string is ABCDE

Page 38: Computer Project For ISC

38

n = 4decoded string is EFGHI

PROGRAM 21 - To display the entered string in alphabetical order .

Algorithm :

STEP 1 - STARTSTEP 2 - str = "" , l = 0STEP 3 - INPUT string strSTEP 4 - l =str.length()STEP 5 - FROM i=0 to i<l REPEAT STEP 6STEP 6 - c[i] = str.charAt(i)STEP 7 - FROM i=0 to i<l-1 REPEAT STEP 8STEP 8 - FROM j=0 to i<l-1 REPEAT STEP 9STEP 9 - temp =c[j], c[j] = c[j+1] , c[j+1] = tempSTEP 10 - FROM i=0 to i<l REPEAT STEP 11STEP 11 - PRINT c[i]STEP 12 - END

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 {

Page 39: Computer Project For ISC

39

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++) { 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(); }}

Page 40: Computer Project For ISC

40

Output:enter word - window

dinoww

PROGRAM 22 - To create a string and count number of vowels and consonants .

Algorithm :

STEP 1 - STARTSTEP 2 - a = "Computer Applications"STEP 3 - z = a.length() STEP 4 - x= 0 , b= 0STEP 5 - FROM y =0 to y<z REPEAT STEP 6STEP 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+1STEP 7 - PRINT xSTEP 8 - PRINT bSTEP 9 - END

Solution:

class p42{public static void main(String args[]){String a="Computer Applications";//initialising stringint z=a.length(),y,x=0,b=0;for(y=0;y<z;y++)//loop for counting number of vowels{if(a.charAt(y)=='a'||a.charAt(y)=='e'||a.charAt(y)=='i'||a.charAt(y)=='o'||a.charAt(y)=='u')x++;elseb++;

Page 41: Computer Project For ISC

41

}System.out.println("Number of vowels in string ="+x);System.out.println("Number of consonants in string ="+b);}}

Output:Number of vowels in string =7Number of consonants in string =12

PROGRAM 23 - To create a string and count number of words .

Algorithm :

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

Solution:

class p45{public static void main(String args[]){String a="Computer Applications"; //initialising stringSystem.out.println("The string is -"+a);int z=a.length(),y,x=0;for(y=0;y<z;y++)//loop for counting number of spaces{if(a.charAt(y)==' ')x=x+1;}System.out.println("Number of words in string ="+(x+1));}}

Page 42: Computer Project For ISC

42

Output:The string is -Computer ApplicationsNumber of words in string =2

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

Algorithm :

STEP 1 - STARTSTEP 2 - a = "Computer Applications"STEP 3 - x= 0 STEP 4 - FROM z =0 to z<a.length() REPEAT STEP 5STEP 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 -"+aSTEP 7 - END

Solution:

import java.io.*;class p48{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);}}

Output:Original String -Computer ApplicationsNew String -C*mp*t*r Appl*c*t**ns

Page 43: Computer Project For ISC

43

PROGRAM 25 - To create a double-dimensional array of 4*4 subscripts.

Algorithm :

STEP 1- STARTSTEP 2- INPUT a[]STEP 3- FROM x =0 to x<3 REPEAT STEP 4STEP 4- FROM y =0 to y<3 REPEAT STEP 5STEP 5- PRINT (a[x][y]+" "STEP 6- END

Solution:

class p31{public static void main(String args[])throws IOException{ int a[][]=new int[3][3], x,y,z;BufferedReader aa=new BufferedReader(new InputStreamReader(System.in));System.out.println("Enter the array");for(x=0;x<3;x++)//loop for reading the array{for(y=0;y<3;y++){ z=Integer.parseInt(aa.readLine());a[x][y]=z;}}System.out.println("Array -");for(x=0;x<3;x++)//loop for printing the array{for(y=0;y<3;y++){System.out.print(a[x][y]+" ");}System.out.print("\n");}}}

Output:Enter the array

Page 44: Computer Project For ISC

44

123456789Array -1 2 34 5 67 8 9

PROGRAM 26 - To generate sum of all elements of a double dimensional array of 5*5 subscripts

Algorithm :

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

Solution:

class p33{public static void main(String args[])throws IOException{ 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++)//loop for reading array{for(y=0;y<5;y++)

Page 45: Computer Project For ISC

45

{ z=Integer.parseInt(aa.readLine());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]+" ");}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);}}

Output:Enter the array1234567889098765432

Page 46: Computer Project For ISC

46

123456

Array -1 2 3 4 56 7 8 8 90 9 8 7 65 4 3 2 12 3 4 5 6Sum of Array elements=118

PROGRAM 27 - To generate product of two arrays of 5 subscripts as a third array.

Algorithm :

STEP 1 - STARTSTEP 2 - INPUT a[] , b[]STEP 3 - FROM i =0 to i<5 REPEAT STEP 4 and STEP 5STEP 4 - c[i] = a[i] * b[i]STEP 5 - PRINT c[i]STEP 6 - END

Solution:

class p35{public static void y(int a[],int b[]){ int c[]=new int[5];int i;System.out.println("Product of two arrays is-");for(i=0;i<5;i++)//loop for finding product of the two arrays{ c[i]=a[i]*b[i];System.out.print(+c[i]+" ");}}}

Page 47: Computer Project For ISC

47

Output:Product of two arrays is-4 6 21 32 25

PROGRAM 28 - To find sum of each column of a double dimensional array.

Algorithm :

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

Solution:class p39{public static void main(String args[])throws IOException{int a[][]=new int[4][4];BufferedReader aa=new BufferedReader(new InputStreamReader(System.in));int x,y,z,Sum=0;System.out.println("Enter the array");//reading arrayfor(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 formfor(x=0;x<4;x++){for(y=0;y<4;y++)

Page 48: Computer Project For ISC

48

{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);//printing sum ofSum=0; //column}}}

Output:Enter the array1234567890987654Array -1 2 3 45 6 7 89 0 9 87 6 5 4Sum of column 1 is 22Sum of column 2 is 14Sum of column 3 is 24Sum of column 4 is 24

Page 49: Computer Project For ISC

49

PROGRAM 29 - To find sum of diagonal of a double dimensional array of 4*4 subscripts.

Algorithm :

STEP 1- STARTSTEP 2- INPUT a[]STEP 3- FROM x =0 to x<4 REPEAT STEP 4STEP 4- FROM y =0 to y<4 REPEAT STEP 5STEP 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 SumSTEP 10 - Sum = 0STEP11- END

Solution:

class p40{public static void main(String args[])throws IOException{int a[][]=new int[4][4];BufferedReader aa=new BufferedReader(new InputStreamReader(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=Integer.parseInt(aa.readLine());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");

Page 50: Computer Project For ISC

50

}y=0;for(x=0;x<4;x++)//loop for finding sum of diagonal{Sum=Sum+a[x][y];y=y+1;}System.out.println("Sum of diagonal is " +Sum);Sum=0;}}

Output:Enter the array1234567890987654Array -1 2 3 45 6 7 89 0 9 87 6 5 4Sum of diagonal is 20

PROGRAM 30 - To calculate the commission of a salesman as per the following data:

Sales Commission>=100000 25% of sales80000-99999 22.5% of sales

Page 51: Computer Project For ISC

51

60000-79999 20% of sales40000-59999 15% of sales<40000 12.5% of sales

Algorithm :

STEP 1 - STARTSTEP 2 - INPUT salesSTEP 3 - IF (sales>=100000) THEN comm=0.25 *sales OTHERWISE GOTO

STEP 4STEP 4 - IF (sales>=80000) THEN comm=0.225*sales OTHERWISE GOTO

STEP 5STEP 5 - IF (sales>=60000) THEN comm=0.2 *sales OTHERWISE GOTO

STEP 6STEP 6 - IF (sales>=40000) THEN comm=0.15 *sales OTHERWISE GOTO

STEP 7STEP 7 - comm=0.125*salesSTEP 8 - PRINT "Commission of the employee="+commSTEP 9 - END

Solution:

class p14{public static void main(String args[])throws IOException{double sales,comm;BufferedReader aa=new BufferedReader(new InputStreamReader(System.in));System.out.println(“Enter sales”);sales=Double.parseDouble(aa.readLine());//reading sales from the keyboardif(sales>=100000)comm=0.25*sales;elseif(sales>=80000)comm=0.225*sales;elseif(sales>=60000)comm=0.2*sales;elseif(sales>=40000)comm=0.15*sales;elsecomm=0.125*sales;

Page 52: Computer Project For ISC

52

System.out.println("Commission of the employee="+comm);}}

Output:Enter sales60000Commission of employee=12000