Computer Science Practical

You might also like

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 18

COMPUTER SCIENCE

PRACTICAL
1.PROGRM USING FUNCTION TO MAKE A CALCULATOR
#include<iostream.h>
#include<conio.h>
void showchoice();
float add(float,float);
float sub(float,float);
float mul(float,float);
float div(float,float);

void main()
{
clrscr();
float x,y;
int ch;
showchoice();
cin>>ch;
cout<<"\nenter two numbers ";
cin>>x>>y;
cout<<endl;
switch(ch)
{
case 1:
cout<<"sum "<<add(x,y);
break;
case 2:
cout<<"difference "<<sub(x,y);
break;
case 3:
cout<<"product "<<mul(x,y);
break;
case 4:
cout<<"division "<<div(x,y);
break;
case 5:
break;
default:
cout<<"invalid choice";
}

getch();
}

void showchoice()
{
cout<<"\n\nmenu";
cout<<"\n1: addition";
cout<<"\n2: subtraction";
cout<<"\n3: multiplication";
cout<<"\n4: division";
cout<<"\n5: exit";
cout<<"\nenter your choice ";
}
float add(float a, float b)
{
return (a+b);
}
float sub(float a, float b)
{
return a-b;
}
float mul(float a, float b)
{
return a*b;
}
float div(float a,float b)
{
return a/b;
}

2.PROGRAM TO CALCULATE FACTORS OF A NUMBER


#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int fact,num;
cout<<"Enter a number ";
cin>>num;
cout<<"\nFactors of "<<num<<" :";
for(int i=1;i<=num;i++)
{
if(num%i==0)
cout<<i<<" ";
else
continue;
}
getch();
}

3.PROGRAM TO CALCULATE LENGTH OF A STRING


#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
char str[50];
int len;
cout<<"Enter a string ";
cin.getline(str,50);
for(len=0;str[len]!='\0';len++)
{}
cout<<"string length "<<len;

getch();
}

4.LARGEST ELEMENT OF A 2-D MATRIX


#include<iostream.h>
#include<conio.h>
#include<stdio.h>
void main()
{
clrscr();
int a[3][3],i,j,max;
for(i=0;i<3;i++)
{
cout<<"\nenter element at row "<<i+1<<": ";
for(j=0;j<3;j++)
cin>>a[i][j];
}
cout<<"\n\nelements of the matrix are ";
for(i=0;i<3;i++)
{
cout<<endl;
for(j=0;j<3;j++)
cout<<a[i][j]<<'\t';
}
max=a[0][0];
for(i=0;i<3;i++)
for(j=0;j<3;j++)
if(max<a[i][j])
max=a[i][j];
cout<<"\nthe lrgest element of the matrix is "<<max;

getch();
}
5.SMALLEST ELEMENT OF A 2-D MATRIX
CH12@Q13
#include<iostream.h>
#include<conio.h>
#include<stdio.h>
void main()
{
clrscr();
int a[3][3],i,j,min;
for(i=0;i<3;i++)
{
cout<<"\nenter element at row "<<i+1<<": ";
for(j=0;j<3;j++)
cin>>a[i][j];
}
cout<<"\n\nelements of the matrix are ";
for(i=0;i<3;i++)
{
cout<<endl;
for(j=0;j<3;j++)
cout<<a[i][j]<<'\t';
}
min=a[0][0];
for(i=0;i<3;i++)
for(j=0;j<3;j++)
if(min>a[i][j])
min=a[i][j];
cout<<"\nthe smallest element of the matrix is "<<min;

getch();
}
6.SUM OF DIAGONALS OF A 2-D MATRIX
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int a[3][3],i,j,right,left;
left=right=0;
for(i=0;i<3;i++)
{
cout<<"\nenter element at row "<<i+1<<": ";
for(j=0;j<3;j++)
cin>>a[i][j];
}
cout<<"\n\nelements of the matrix are ";
for(i=0;i<3;i++)
{
cout<<endl;
for(j=0;j<3;j++)
cout<<a[i][j]<<'\t';
}
for(i=0,j=0;i<3,j<3;i++,j++)
left+=a[i][j];
for(i=0,j=2;i<3,j>=0;i++,j--)
right+=a[i][j];
cout<<"\nsum of the left diagonal of the matrix "<<left;
cout<<"\nsum of the right diagonal of the matrix "<<right;

getch();
}
7.SUM OF ROWS AND COLUMNS OF A 2-D MATRIX
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int a[3][3],i,j,rsum,csum;
for(i=0;i<3;i++)
{
cout<<"\nenter element at row "<<i+1<<": ";
for(j=0;j<3;j++)
cin>>a[i][j];
}
cout<<"\n\nelements of the matrix are ";
for(i=0;i<3;i++)
{
cout<<endl;
for(j=0;j<3;j++)
cout<<a[i][j]<<'\t';
}
for(i=0;i<3;i++)
{
rsum=0;
for(j=0;j<3;j++)
rsum+=a[i][j];
cout<<"\nsum of row "<<i+1<<" is "<<rsum;
}
for(i=0;i<3;i++)
{
csum=0;
for(j=0;j<3;j++)
csum+=a[j][i];
cout<<"\nsum of column "<<i+1<<" is "<<csum;
}

getch();
}
8.PROGRAM TO COUNT VOWELS, CONSONANTS, DIGITS, SPACES IN A STRING
#include<iostream.h>
#include<string.h>
#include<stdio.h>
#include<conio.h>
int main()
{
clrscr();
char string[150];
int i,v,c,d,s,sp;
v=c=d=s=sp=0;
cout<<"enter a line of strings;"<<endl;
cin.getline(string,150);
for(i=0;string[i]!='\0';++i)
{
if(string[i]=='a'
||string[i]=='e'
||string[i]=='i'
||string[i]=='o'
||string[i]=='u'
||string[i]=='A'
||string[i]=='E'
||string[i]=='I'
||string[i]=='O'
||string[i]=='U')
++v;
else if((string[i]>='a'&&string[i]<='z')||(string[i]>='A'&&string[i]<='Z'))
++c;
else if(string[i]>='0'&&c<='9')
++d;
else if(string[i]==' ')
++s;
else
++sp;
}
cout<<"Vowels:"<<v<<endl;
cout<<"Consonants:"<<c<<endl;
cout<<"Digits:"<<s<<endl;
cout<<"White Spaces:"<<s<<endl;
cout<<"Special Characters"<<sp;

getch();

return 0;
}

9.PROGRAM TO CHECK WHETHWR A STRING IS PALINDROME


OR NOT
#include<iostream.h>
#include<conio.h>
#include<string.h>
void main()
{
clrscr();
char str[50],a[50];
int i,j,len;
char palin='y';
cout<<"enter a string ";
cin>>str;
len=strlen(str);
for(i=len-1,j=0;i>=0;i--,j++)
{
a[j]=str[i];
}
for(int z=0;z<len;z++)
{if(str[z]!=a[z])
palin='n';
break;
}
if (palin=='y')
cout<<"\nit is a palindrome string ";
else
cout<<"\nnot a pallindrome string";

getch();

10.PROGRAM TO REVERSE A STRING


#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int i,j,len=0;
char a[50],temp;
cout<<"enter a string ";
cin>>a;
for(i=0;a[i]!='\0';i++)
len++;
for(i=0,j=len-1;j>i;i++,j--)
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
cout<<"reversed string "<<a;

getch();
}

11.PROGRAM TO SEPARATE EVEN AND ODD ELEMENTS FROM


A ARRAY
#include<iostream.h>
#include<conio.h>
#include<process.h>
void main()
{
clrscr();
int arr[20],even[20],odd[20],i,j=0,k=0,n;
cout<<"enter total number of element ";
cin>>n;
cout<<"\nenter "<<n<<" values ";
for(i=0;i<n;i++)
cin>>arr[i];
for (i=0;i<n;i++)
{
if(arr[i]%2==0)
{
even[j]=arr[i];
j++;
}
else
{
odd[k]=arr[i];
k++;
}
}
cout<<"\neven elements ";
for(i=0;i<j;i++)
cout<<even[i]<<" ";
cout<<"\nodd elements ";
for(i=0;i<k;i++)
cout<<odd[i]<<" ";

getch();
}

12.PROGRAM TO COMPUTE LARGEST AND SMALLEST VALUE


FROM A MATRIX
#include<iostream.h>
#include<conio.h>
#include<process.h>
void main()
{
clrscr();
int a[10],flag,n,num;
int i,max,min;
cout<<"enter total number of elements;";
cin>>n;
if(n>10)
{
cout<<"overflow occurs";
exit(0);
}
cout<<endl<<"enter"<<n<<"values:";
for(i=0;i<n;i++)
cin>>a[i];
max=a[0];
min=a[0];
for(i=0;i<n;i++)
{
if(max<a[i])
max=a[i];
}
for(i=0;i<n;i++)
{
if(min>a[i])
min=a[i];
}
cout<<endl<<"largest valueis:"<<max;
cout<<endl<<"smallest value is:"<<min;

getch();
}

13.PROGRAM ILLUSTRATING LINEAR SEARCH


#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int a[10],flag,n,num,i;
cout<<"\nenter total nuumber of elements ";
cin>>n;
cout<<"enter "<<n<<" elements ";
for(i=0;i<n;i++)
cin>>a[i];
cout<<"enter the number which you want to search ";
cin>>num;
flag=0;
for(i=0;i<n;i++)
{
if (num==a[i])
{
flag=1;
cout<<"\nsearch successful \nelement found at position "<<i+1;
break;
}
}
if(flag==0)
cout<<"search unsuccessful";

getch();
}

14.PROGRAM TO PRINT FIBONACCI SERIES


#include<iostream.h>
#include<conio.h>
void fibonacci();
void main()
{
clrscr();
fibonacci();

getch();
}
void fibonacci()
{
int a,b,s,n;
a=0,b=1,s;
cout<<endl<<"enter total number up to which the series to be generated";
cin>>n;
cout <<"Fibonacci series:"<<a<<","<<b<<",";
for(int i=1;i<=(n-2);i++)
{
s=a+b;
cout<<s<<"," ;
a=b;
b=s;
}
}

15.PROGRAM TO CHECK PALINDROME NUMBERS


#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int num,temp,rev,dig;
char reply;
do
{
cout<<"enter a number ";
cin>>num;
temp=num;
rev=0;
do
{
dig=temp%10;
rev=rev*10+dig;
temp/=10;
}while(temp!=0);
if(num==rev)
cout<<num<<" is a palindrome number";
else
cout<<num<<" is not a palindrome number";
cout<<"\ndo ypu want to continue";
cin>>reply;
}while(reply=='y');

getch();
}

16.PROGRM ILLUSTRATING NESTED LOOP


#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int n;
cout<<"enter number of rows ";
cin>>n;
char ch='*';
for(int i=1;i<=n;i++)
{
for(int j=1;j<=i;j++)
cout<<ch;
cout<<endl;
}

getch();
}

17.PROGRAM TO PRINT MULTIPLICATION TABLE


#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int n;
cout<<"enter a number: ";
cin>>n;
cout<<"multiplication table of "<<n<<endl;
for(int i=1;i<=10;i++)
cout<<n<<"*"<<i<<"="<<n*i<<endl;

getch();
}

18.PROGRAM TO PRINT HCF AND LCM OF A NUMBER


#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int no1,no2,dv,dd,rem,lcm,gcd;
cout<<endl<<"Enter two integer number:";
cin>>no1>>no2;
if(no1>no2)
{
dd=no1;
dv=no2;
}
else
{
dd=no2;
dv=no1;
}
while(1)
{
rem=dd%dv;
if(rem==0)
{
gcd=dv;
break;
}
dd=dv;
dv=rem;
}
lcm=(no1*no2)/gcd;
cout<<"\n greatest common divisor of "<<no1<<" and "<<no2<<" is "<<gcd;
cout<<"\n least common multiple of "<<no1<<" and "<<no2<<" is "<<lcm;

getch();
}

19.PROGRAM ILLUSTRATING SWITCH CASE


#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int choice;
char opt;
cout<<endl<<"enter 1 for rectangle and 2 for square:";
cin>>choice;
switch(choice)
{
case 1:
float l,b,area_rect,peri_rect;
cout<<endl<<"enter length and breadth of a rectangle:";
cin>>l>>b;
cout<<endl<<"A.Area of rectangle";
cout<<endl<<"B.Perimeter of rectangle";
cout<<endl<<"Enter ypur option:";
cin>>opt;
switch(opt)
{
case'A':
area_rect=l*b;
cout<<endl<<"area of rectangle is:"<<area_rect;
break;
case'B':
peri_rect=2*(l+b);
cout<<endl<<"perimeter of a rectangle is:"<<peri_rect;
default:cout<<endl<<"not a valid option";
}
break;
case 2:
float side,area_sq,peri_sq;
cout<<endl<<"enter side of a square:";
cin>>side;
cout<<endl<<"A.area of a square";
cout<<endl<<"B.perimeter of square";
cout<<endl<<"enter your option:";
cin>>opt;
switch(opt)
{
case'A':
area_sq=side*side;
cout<<endl<<"area of square is:"<<area_sq;
break;
case 'B':
peri_sq=4*side;
cout<<endl<<"perimeter of square is :"<<peri_sq;
default:cout<<endl<<"not a valid option";
}
default :
cout<<endl<<"wrong choice entered";
}

getch();
}

20.PROGRAM TO PRINT SUM OF DIGITS OF A NUMBER


#include<iostream.h>
#include<conio.h>
void main()
{
int num,count,rev,sum,temp,digit;
clrscr();
cout<<"\n Enter the number: ";
cin>>num;
temp=num;
sum=rev=count=0;
do{
digit=temp%10;
count++;
rev=rev*10+digit;
sum+=digit;
temp/=10;
}while(temp!=0);
cout<<"\n NUMBER:"<<num;
cout<<"\n NUMBER OF DIGITS:"<<count;
cout<<"\n SUM OF DIGITS:"<<sum;
cout<<"\n REVERSE OF THE NUMBER:"<<rev;
getch();
}

You might also like