Advertisements
Advertisements
प्रश्न
Write a function REVROW(int P[] [5], int N, int M) in C++ to display the content of a two-dimensional array, with each row content in reverse order.
For example, if the content of the array is as follows:
| 15 | 12 | 56 | 45 | 51 |
| 13 | 91 | 92 | 87 | 63 |
| 11 | 23 | 61 | 46 | 81 |
The function should display output as
उत्तर १
void REVROW(int P[][5],int N,int M)
{
for(int I=0; I<N; I++)
{
for(int J=M - 1; J>=0; J)
cout<<P[I][J];
cout<<endl;
}
}उत्तर २
void REVROW(int P[][5],int N,int M)
{
for(int I=0; I<N; I++)
{
for(int J=0; J<M/2; J++)
{
int T = P[I][J];
P[I][J] = P[I][M-J-1];
P[I][M-J-1] = T;
}
}
for(I=0; I<N; I++)
{
for(int J=0; J<M; J++)
cout<<P[I][J];
cout<<endl;
}
}APPEARS IN
संबंधित प्रश्न
Write the definition of a function SumEO(int VALUES[], int N) in C++, which should display the 4 sum of even value and sum of odd values of the array separately.
Example: If the array VALUES contains
| 25 | 20 | 22 | 21 | 53 |
Then the functions should display the output as:
Sum of even values = 42 (i.e., 20+22)
Sum of odd values= 99 (i.e., 25+21+53)
Write a definition for a function UpperHalf(int Mat[4][4]) in C++ which displays the elements in the same way as per the example is shown below.
For example, if the content of the array Mat is as follows:
| 25 | 24 | 23 | 22 |
| 20 | 19 | 18 | 17 |
| 15 | 14 | 13 | 12 |
| 10 | 9 | 8 | 7 |
Thew function should display the content in the following format:
Let us assume Data[20][15] is a two-dimensional array, which is stored in the memory along the row with each of its elements occupying 2 bytes. Find the address of the element Data(10][5], if the element Data[10][l5] is stored at the memory location 15000.
ARR[15] ft:20] is a two-dimensional array, which is stored in the memory along the row with each of its elements occupying 4 .bytes. Find the .address of the element ARR[5)[15], if the element ARR[lO] [5] is stored at the memory location 35000.
A two-dimensional array ARR[50][20] is stored in the memory along the row with each of its elements occupying 4 bytes. Find the address of the element ARR[30] [10], if the element ARR[10] [5] is stored at the memory location 15000.
