Name :- Ranjan Kumar

Roll no.- 14484

Computer Science code-output file

Code:-

//1. Calculator
#include <iostream>
using namespace std;

int main()
{
int num1,num2;
cout<<"Enter 1st no.=";
cin>>num1;
cout<<"Enter 2nd no.=";
cin>>num2;
cout<<"Sum is="<<num1+num2<<'\n';
cout<<"Subtraction is="<<num1-num2<<'\n';
cout<<"Multiplication is="<<num1*num2<<'\n';
cout<<"division is="<<num1/num2<<'\n';

return 0;

Output:-

Code:-
//2. Odd or Even
#include <iostream>
using namespace std;

int main()
{

int num;
cout<<"Enter no.=";
cin>>num;

if (num%2==0)
cout<<"No. is even"<<'\n';
 else
cout<<"No. is odd"<<'\n';

return 0;
}

Output:-

Code:-
//3. Pattern no. Triangle
#include <iostream>
using namespace std;

int main()
{
int i,j;
int row;
cout<<"Enter no. of rows=";
cin>>row;
for (i=1;i<=row;i++)
{for (j=1;j<=i;j++)
cout<<j<<'\t';
cout<<'\n';}

return 0;

Output:-

Code:-
//4. Pattern Right-hand Triangle
#include <iostream>
using namespace std;

int main() {

int n,k;
cout<<"Enter value =";
cin>>n;
 k = n;
for(int i=1;i<=n;i++) {
for(int j=1;j<=n;j++) {
if(j>=k) {
cout<<'*';
}
else{
cout<<' ';}
}
k--;

cout<<'\n';
}

Output:-

Code:-
//5. Pattern Down Right-hand Triangle
#include <iostream>
using namespace std;

int main() {

int n;
cout<<"Enter value =";
cin>>n;
for(int i=1;i<=n;i++) {
for(int j=1;j<=n;j++) {
if(j<i) {
cout<<' ';}
else {
cout<<'*';}
}
cout<<'\n';
}
}

Output:-
Code:-
//6. Pattern Complete Triangle
#include <iostream>
using namespace std;

int main() {

int n;
cout<<"Enter value=";
cin>>n;
for(int i=0;i<n;i++) {
int space = i;
for(int j=0;j<2*n-i-1;j++) {
if(space) {
cout<<' ';
space--;}
else{
cout<<'*';}
}
cout<<'\n';
}
}

Output:-

Code:-
//7. Pattern Down Right-hand Triangle
#include <iostream>
using namespace std;

int main() {

int n;
cout<<"Enter the value =";
cin>>n;

for(int i=n;i>=1;i--) {
for(int j=0;j<n-i;j++){
cout<<' ';}

for(int j=0;j<i;j++) {
cout<<'*';}
 cout<<'\n';}
}

Output:-

Code:-
//8. Pattern Down Left-hand Triangle
#include <iostream>
using namespace std;

int main() {

int n;
cout<<"Enter Value=";
cin>>n;
for(int i=n;i>0;i--) {
for(int j=0;j<i;j++)
cout<<'*';
cout<<'\n';}
}

Output:-

Code:-
//9. Prime no.
#include <iostream>
using namespace std;

int main() {

int n;
cout<<"Enter no. =";
cin>>n;
if(n>1) {
for(int i=2;i<=n/2;i++) {
if(n%i==0){
 cout<<"number is not a prime no."<<'\n';
break;}
else {
cout<<"number is a prime no."<<'\n';}}
}
else
cout<<"no. is smaller than 1"<<'\n';

Output:-

Code:-
//10. Fibonacci
#include <iostream>
using namespace std;

int main() {

int n;
int fibo[n];
fibo[0]=0;
fibo[1]=1;
cout<<"Enter no. of terms=";
cin>>n;
for(int i=2;i<n;i++)
fibo[i] = fibo[i-2] + fibo[i-1];

for(int i=0;i<n;i++)
cout<<fibo[i]<<'\t';
cout<<'\n';
}

Output:-

Code:-
//11. Matrix Element addition
#include <iostream>
using namespace std;

int main() {

int r,c;
cout<<"Enter no. of rows=";
 cin>>r;
cout<<"Enter no. of coulmns=";
cin>>c;
int mat1[r][c],mat2[r][c],mat3[r][c] ;
cout<<"Enter 1st matrix elements=";
for(int i=0;i<r; i++) {
for (int j=0;j<c;j++)
cin>>mat1[i][j];}

cout<<"Enter 2nd matrix elements=";

for(int i=0;i<r;i++) {
for (int j=0;j<c;j++)
cin>>mat2[i][j];}

cout<<"Addition of both the matrices are "<< '\n';

for(int i=0;i<r;i++) {
for (int j=0;j<c;j++)
mat3[i][j]=mat1[i][j] + mat2[i][j]; }

for(int i=0;i<r;i++) {
for(int j=0;j<c;j++)
cout<<mat3[i][j]<< '\t'; cout<<'\n';}

Output:-

Code:-
//12. Matrix Multiplication
#include <iostream>
using namespace std;

int main() {
 int r1,r2,c1,c2;
cout<<"Enter rows of 1st matrix=";
cin>>r1;
cout<<"Enter coulmn of 1st matrix=";
cin>>c1;
r2=c1;
cout<<"Enter coulmn of 2nd matrix=";
cin>>c2;

int a[r1][c1] , b[r2][c2] ,c[r1][c2];

cout<<"Enter 1st matrix element=";

for(int i=0;i<r1;i++) {
for(int j=0;j<c1;j++)
cin>>a[i][j];}

cout<<"Enter 2nd matrix element=";

for(int i=0;i<r2;i++) {
for(int j=0;j<c2;j++)
cin>>b[i][j];}

cout<<"Multiplication of the matrices is="<<'\n';

//main code
for(int i=0;i<r1;i++) {
for(int j=0;j<c2;j++) {
c[i][j] = 0;
for(int k=0;k<c1;k++)
c[i][j] += a[i][k]*b[k][j];}
}

//matrix printing
for(int i=0;i<r1;i++) {
for(int j=0;j<c2;j++)
cout<<c[i][j]<<'\t';
cout<<'\n';}
}
Output:-
Code:-
//13. Reverse no.
#include <iostream>
using namespace std;

int main() {
int rev,rev_num,num,ori_num;
cout<<"Enter no. to be reversed=";
cin>>num;
rev_num=0;
ori_num=num;
while(num!=0) {
rev=num%10;
rev_num=rev_num*10+rev;
num=num/10;}

cout<<"Reversed form of"<<' '<<ori_num<<' '<<"is="<<rev_num<<'\n';

}

Output:-

Code:-
//14. Swap no.
#include <iostream>
using namespace std;

int swap(int a,int b) {

int c;
c=a;
a=b;
b=c;
cout<<"No. after swaping"<<endl;
cout<<"1st no.="<<a<<endl;
cout<<"2nd no.="<<b<<endl;
return 0;
}

int main() {
int a,b;
cout<<"Enter 1st no.=";
cin>>a;
cout<<"Enter 2nd no.=";
cin>>b;
cout<<swap(a,b);

}
Output:-

Code:-
//15. Factorial
#include <iostream>
using namespace std;

int main() {
int fact,n;
fact =1;
cout<<"Enter no. of terms=";
cin>>n;
for(int i=1;i<=n;i++)
fact = fact*i;
cout<<"Factorial is ="<<fact<<'\n';
}

Output:-

Code:-
//16. Sinx expansion series
#include <iostream>
#include <cmath>
using namespace std;

int facto(int a) {
int fact =1;
for(int i=1;i<=a;i++)
fact = fact*i;
return fact;
}

int main() {
int x,n,sum;
sum=0;
cout<<"Enter value of x=";
cin>>x;
cout<<"Enter no. of terms=";
cin>>n;
for(int i=1;i<=n;i+=2)
sum = sum + (pow(-1,i-1)*(pow(x,2*i-1)/facto(2*i-1)));
cout<<"sum is="<<sum<<'\n';
}

Output:-

Code:-
//17. cox expansion
#include <iostream>
#include <cmath>
using namespace std;

int facto(int a) {
int fact =1;
for(int i=1;i<=a;i++)
fact = fact*i;
return fact;
}

int main() {
int x,n,sum;
sum=0;
cout<<"Enter value of x=";
cin>>x;
cout<<"Enter no. of terms=";
cin>>n;
for(int i=1;i<=n;i+=2)
sum = sum + (pow(-1,i-1)*(pow(x,2*i)/facto(2*i)));
cout<<"sum is ="<<sum<<'\n';
}

Output:-

Code:-
//18. series 1^n - 2^n + 3^n - 4^n.......
#include <iostream>
#include <cmath>
using namespace std;

int main() {
int n,sum;
sum=0;
cout<<"Enter no. of terms=";
 cin>>n;
for(int i =1;i<=n;i++)
sum += (pow(-1,i-1)*(pow(i,n)));
cout<<"Sum is ="<<sum<<'\n';
}

Output:-

Code:-
//19. Permutation
#include <iostream>
using namespace std;

int facto(int a) {
int fact =1;
for(int i=1;i<=a;i++)
fact = fact*i;
return fact;
}

int main() {
int n,r,perm;
perm=1;
cout<<"Enter no. of terms=";
cin>>n;
cout<<"Enter no. of ways=";
cin>>r;
if(n>=r) {
perm=facto(n)/facto(n-r);
cout<<"Permutation is="<<perm<<'\n';}

else
cout<<"No. of ways could not be greater than no. of terms"<<’\n’;

Output:-

Code:-
//20. Combination
#include <iostream>
using namespace std;
int facto(int a) {
int fact =1;
for(int i=1;i<=a;i++)
fact = fact*i;
return fact;
}

int main() {
int n,r,comb;
comb=1;
cout<<"Enter no. of terms=";
cin>>n;
cout<<"Enter no. of ways=";
cin>>r;
if(n>=r) {
comb=facto(n)/(facto(n-r)*facto(r));
cout<<"Combination is="<<comb<<'\n';}

else
cout<<"No. of ways could not be greater than no. of terms"<<'\n';

Output:-