#include   using namespace std;   const int ROWS = 10; const int COLS = 10; int generateRND(int MIN, int MAX) { return rand() % (MAX - MIN + 1) + MIN;   } void initializeArray(int C[][COLS], int min, int max) { for (size_t i = 0; i < ROWS; i++) { for (size_t j = 0; j < COLS; j++) { C[i][j] = generateRND(min, max);   } } } void swap(int A[][COLS], int B[][COLS]) { int temp; for (size_t j = 0; j < COLS; j += 2) { for (size_t j = 0 ; j< COLS; j +=) } } void printArray(int C[][COLS]) { for (size_t i = 0; i < ROWS; i++) { for (size_t j = 0; j < COLS; j++) { cout << C[i][j] << " "; } cout << endl; } }   int main() { srand((unsigned)time(0)); int A[ROWS][COLS] = { 0 }; int B[ROWS][COLS] = { 0 }; const int MIN = 2; const int MAX = 50; initializeArray(A, 2, 50);   } Declares two 10X10 Two-dimensional arrays A and B of type integer. Each array consists of 100 random integers between 2 and 50. 1.       Swaps (exchange) the elements of A with the elements of B in reverse order i.e., first element of A swap with last element of B and so on. 2.       Swaps (exchange) the elements of even columns of A with the elements of even columns of B 3.       Swaps (exchange) the elements of odd columns of A with the elements of odd columns of B 4.       Swaps (exchange) the elements of even rows of A with the elements of even rows of B 5.       Swaps (exchange) the elements of odd rows of A with the elements of odd rows of B 6.       Swaps (exchange) the elements of A with the elements of B in reverse order i.e., first element of A swap with last element of B and so on. C++

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter12: Points, Classes, Virtual Functions And Abstract Classes
Section: Chapter Questions
Problem 3PE
icon
Related questions
Question

#include <iostream>

 

using namespace std;

 

const int ROWS = 10;

const int COLS = 10;

int generateRND(int MIN, int MAX) {

return rand() % (MAX - MIN + 1) + MIN;

 

}

void initializeArray(int C[][COLS], int min, int max)

{

for (size_t i = 0; i < ROWS; i++)

{

for (size_t j = 0; j < COLS; j++) {

C[i][j] = generateRND(min, max);

 

}

}

}

void swap(int A[][COLS], int B[][COLS]) {

int temp;

for (size_t j = 0; j < COLS; j += 2) {

for (size_t j = 0 ; j< COLS; j +=)

}

}

void printArray(int C[][COLS]) {

for (size_t i = 0; i < ROWS; i++)

{

for (size_t j = 0; j < COLS; j++) {

cout << C[i][j] << " ";

}

cout << endl;

}

}

 

int main() {

srand((unsigned)time(0));

int A[ROWS][COLS] = { 0 };

int B[ROWS][COLS] = { 0 };

const int MIN = 2;

const int MAX = 50;

initializeArray(A, 2, 50);

 

}


Declares two 10X10 Two-dimensional arrays A and B of type integer. Each array consists of 100 random integers between 2 and 50.

1.       Swaps (exchange) the elements of A with the elements of B in reverse order i.e., first element of A swap with last element of B and so on.

2.       Swaps (exchange) the elements of even columns of A with the elements of even columns of B

3.       Swaps (exchange) the elements of odd columns of A with the elements of odd columns of B

4.       Swaps (exchange) the elements of even rows of A with the elements of even rows of B

5.       Swaps (exchange) the elements of odd rows of A with the elements of odd rows of B

6.       Swaps (exchange) the elements of A with the elements of B in reverse order i.e., first element of A swap with last element of B and so on.

C++

Expert Solution
steps

Step by step

Solved in 4 steps with 8 images

Blurred answer
Knowledge Booster
Concept of memory addresses in pointers
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
Programming Logic & Design Comprehensive
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
New Perspectives on HTML5, CSS3, and JavaScript
New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:
9781305503922
Author:
Patrick M. Carey
Publisher:
Cengage Learning