Scribd
Upload
6 views18 pages

Assignment 1

The document contains multiple programming assignments in C++, including checking if a matrix is a magic square, implementing call by value and call by reference, and swapping variables without a third variable. It also includes recursive implementations for factorial, Fibonacci series, greatest common divisor, linear search, binary search, and the Tower of Hanoi problem. Each section provides code examples and prompts for user input.

Uploaded by

avinashchandel223
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
6 views18 pages

Assignment 1

The document contains multiple programming assignments in C++, including checking if a matrix is a magic square, implementing call by value and call by reference, and swapping variables without a third variable. It also includes recursive implementations for factorial, Fibonacci series, greatest common divisor, linear search, binary search, and the Tower of Hanoi problem. Each section provides code examples and prompts for user input.

Uploaded by

avinashchandel223
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 18

Assignment-1

1. WAP to check whether a given matrix is Magic


Square or not?
Code
#include<iostream>
using namespace std;
int main(){
int n;
cout<<"enter side of square:";
cin>>n;
int a[n][n];
cout<<"enter elements of square:\n";
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
cin>>a[i][j];
}
}
int k=0;
for(int i=0;i<n;i++){
k+=a[i][0];
}
bool flag=true;
//checking row vise
for(int i=0;i<n;i++){
int x=k;
for(int j=0;j<n;j++){
x-=a[i][j];
}
if(x!=0)flag=false;
}
//checking column vise
for(int i=0;i<n;i++){
int x=k;
for(int j=0;j<n;j++){
x-=a[j][i];
}
if(x!=0)flag=false;
}
//checking for diagonal
for(int i=0;i<n;i++){
k-=a[i][i];
}
if(k!=0)flag=false;
if(flag)cout<<"yes,it is magic square";
else cout<<"not a magic square";
}
Output
2. WAP to implement Call by Value and Call by
Reference mechanisms.
Code
#include<iostream>
using namespace std;
void triple(int n){
n*=3;
}
void triple1(int *k){
*k=*k*3;
}
int main(){
int n;
cout<<"----call by reference----\n";
cout<<"enter the number to be tripled:";
cin>>n;
triple(n);
cout<<"new value of number is:"<<n<<"\n\n\
n\n";
cout<<"----call by value----\n";
int k;
cout<<"enter the number to be tripled:";
cin>>k;
triple1(&k);
cout<<"new value of number is:"<<k<<"\n";
}

Output
3. WAP to implement three different ways to
swap two variables without using a third
variable.
Code
#include<iostream>
using namespace std;
void way1(int n,int m){
n=n*m;
m=n/m;
n=n/m;
cout<<"now the value of first number
is:"<<n<<"\n";
cout<<"now the value of second number
is:"<<m<<"\n";
}
void way2(int n,int m){
n=n+m;
m=n-m;
n=n-m;
cout<<"now the value of first number
is:"<<n<<"\n";
cout<<"now the value of second number
is:"<<m<<"\n";
}
void way3(int n,int m){
n=n^m;
m=n^m;
n=n^m;
cout<<"now the value of first number
is:"<<n<<"\n";
cout<<"now the value of second number
is:"<<m<<"\n";
}
int main(){
cout<<"enter the first number:";
int n,m;
cin>>n;
cout<<"enter the second number:";
cin>>m;
cout<<"--way1--\n\n";
way1(n,m);
cout<<"\n\n--way2--\n\n";
way2(n,m);
cout<<"\n\n--way3--\n\n";
way3(n,m);}
Output
4.WAP to implement the following programs using
recursion.
a. Factorial
code
#include<iostream>
using namespace std;
int fac(int n){
if(n==1||n==0)return 1;
return n*fac(n-1);}
int main(){
int n;
cout<<"enter the number:";
cin>>n;
cout<<"factorial of "<<n<<" is:"<<fac(n);}
Output
b.fibonacci
code
#include<iostream>
using namespace std;
int fib(int n){
if(n==1||n==2)return 1;
return fib(n-1)+fib(n-2);
}
int main(){
cout<<"enter no. of terms:";
int n;
cin>>n;
for(int i=1;i<=n;i++){
cout<<fib(i)<<" ";}}
Output
c. Greatest Common Divisor
code
#include<bits/stdc++.h>
using namespace std;
int gcd(int p,int q,int k){
if(p%k==0&&q%k==0)return k;
return gcd(p,q,k-1);
}
int main(){
int p,q;
cout<<"enter the numbers:";
cin>>p>>q;
int k=min(p,q);
cout<<"the gcd is: "<<gcd(p,q,k);
}
Output
d. linear search
code
#include<iostream>
using namespace std;
int ls(int a[],int i,int x){
if(i<0)return -1;
if(a[i]==x)return i;
return ls(a,i-1,x);
}
int main(){
cout<<"enter number of terms in array:";
int n;
cin>>n;
int a[n];
cout<<"enter elements of array:";
for(int i=0;i<n;i++){
cin>>a[i];
}
cout<<"enter number to be searched:";
int x;
cin>>x;
int ind=ls(a,n-1,x);
if(ind==-1)cout<<"not present\n";
else cout<<"the index of given number
is:"<<ind;
}
Output
e. binary search
code
#include <bits/stdc++.h>
using namespace std;

int bin(int arr[], int n, int x) {


int low = 0;
int high = n - 1;

while (low <= high) {


int mid = (low + high) / 2;
if (arr[mid] == x) {
return mid;
} else if (arr[mid] > x) {
high = mid - 1;
} else {
low = mid + 1;
}
}

return -1;
}

int main() {
int n, x;
cout << "Enter the number of elements in the
array: ";
cin >> n;
int arr[n];
cout << "Enter the elements of the array in
sorted order: ";
for (int i = 0; i < n; i++) {
cin >> arr[i];
}

cout << "Enter the element to search for: ";


cin >> x;

int result = bin(arr, n, x);


cout<<"element found at index is
"<<result<<endl;
}
Output

f. Tower of hanoi
code
#include <iostream>
using namespace std;

void TowerOfHanoi(int n, int a, int b, int c) {


if (n > 0) {
TowerOfHanoi(n - 1, a, c, b);
cout << "Move disk " << n << " from rod " << a << "
to rod " << c <<
endl;
TowerOfHanoi(n - 1, b, a, c);
}
}
int main() {
int n = 4;
TowerOfHanoi(n, 1, 2, 3);
}

Output

You might also like