Ass 3
Ass 3
Ass 3
Q1
#include <iostream>;
int main()
cin>>n;
cin>>a[i];
count=0;
if(a[j]==a[i]){
count++;
if(count>max){
max=count;
t=a[i];
return 0;
Q2
#include <iostream>
int main()
cin>>n;
cin>>a[i];
}
f=0;
f=f+a[j];
s[i]=f;
cout<<s[i]<<" ";
Q3)
#include<iostream>
int main()
int a[10],l,b[10],i,j,k,x,y;
cin>>x>>y;
for(i=0;i<x;i++)
cin>>a[i];
for(j=0;j<y;j++)
cin>>b[j];
for(k=x;k<x+y;k++)
a[k] = b[k-x];
cout<<a[k];
for(int m=0;m<x+y-1-l;m++)
int k=a[m];
a[m]=a[m+1];
a[m+1]=k;
for(int o=0;o<x+y;o++)
int loc = o;
for(int p=1+o;p<x+y;p++)
search = a[p];
loc = p;
// swap(a[o],a[loc]);
swap(a[o],a[loc]);
for(int n =0;n<x+y;n++)
cout<<a[n]<<endl;
return 0;
Q 4)
#include <iostream>
int main()
int a[100], k, i, t, n;
cout<<"Enter array size "<<endl;
cin>>n;
cin>>a[i];
cin>>k;
if (a[j]>a[j+1])
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
Q7
#include <iostream>
int main()
{
cin>>r>>c;
cin>>a[i][j];
b[j][i]=a[i][j];
if(a==b){
else {
return 0;
Q8
#include <iostream>
using namespace std;
int main()
int a[100][100], r, c, i, j, x;
cin>>r>>c;
cin>>a[i][j];
cin>>x;
if(a[i][j]==x){
}
}
Q9)
#include <iostream>
int main()
cin>>r;
cin>>a[i][j];
if(i==j){
s=s+a[i][j];
}
}
10)
#include<iostream>
int main()
cin>>a[i];
{
c = j*4 + k;
b[j][k] = a[c];
cout<<b[j][k]<<" ";
cout<<endl;
return 0;
1)
#include<iostream>
int main()
int a[10],b,c,d,e,n,i,j,k,search;
cin>>n;
cout<<"enter elements"<<endl;
for(i=0;i<10;i++)
cin>>a[i];
for(j=0;j<n;j++)
{ search = a[j];
d = 1;
for(k=j+1;k<n;k++)
if(search == a[k])
count++;
if(d>>e)
e = d;
b = a[j];
return 0;
11)
#include<iostream>
{ cout<<"22chb0a01 vaidikkumar"<<endl;
char a[100];
int b,c,d,e,i;
cout<<"enter string"<<endl;
cin.getline(a,100);
i = 0;
b,c,d,e = 0;
while(a[i]!='\0')
switch (a[i])
break;
break;
break;
break;
default : d++;
i++;
}
cout<<"number of alphabets in string = "<<b<<endl;
return 0;
6)
#include<iostream>
int main()
int a[10][10],i,j,n,k,l,m,o,p,q,sum_r,sum_c;
cout<<"enter n"<<endl;
cin>>n;
for(i=0;i<n;i++)
for(j=0;j<n;j++)
cin>>a[i][j];
cout<<endl;
cout<<"required martix"<<endl;
for(k=0;k<n;k++)
{
for(l=0;l<n;l++)
cout<<a[k][l]<<" ";
cout<<endl;
for(m=0;m<n;m++)
{ sum_r = 0;
for(o=0;o<n;o++)
for(p=0;p<n;p++)
{ sum_c = 0;
for(q=0;q<n;q++)
return 0;
}
Q13)
#include <iostream>
#include <cstring>
int main()
int l;
cin>>l;
char c[100][100];
for(int i=0;i<l;i++)
cin>>c[i];
// for(int i=0;i<l;i++)
// cout<<c[i]<<endl;
char t[100];
for(int i=0;i<l;i++)
for(int j=0;j<l-1;j++)
if(strcmp(c[j],c[j+1])>0)
strcpy(t,c[j]);
strcpy(c[j],c[j+1]);
strcpy(c[j+1],t);
cout<<"Sorted names::"<<endl;
for(int i=0;i<l;i++)
cout<<c[i]<<" ";
14)
#include<iostream>
int main()
char s[100];
int a,i,j;
a = 0;
cout<<"enter string"<<endl;
cin.getline(s,100);
for(j=1;s[j]!='\0';j++);
for(i=0;i<=j/2;i++)
{
if(s[i]!=s[j-i-1])
a++;
if(a==0)
else
return 0;