Scribd
Upload
27 views3 pages

Lab - 03 Task On 2D Array

The document describes various operations that can be performed on 2D arrays: 1. Summing all elements of a 2D array. 2. Summing corresponding elements of two 2D arrays and storing the result in a third array. 3. Summing elements on the boundary of a 2D array. 4. Summing elements on the main diagonal of a 2D array. 5. Transposing a 2D array by swapping rows and columns. 6. Taking input for two 3x3 matrices from the user and calculating their matrix multiplication.

Uploaded by

Shanto
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
27 views3 pages

Lab - 03 Task On 2D Array

The document describes various operations that can be performed on 2D arrays: 1. Summing all elements of a 2D array. 2. Summing corresponding elements of two 2D arrays and storing the result in a third array. 3. Summing elements on the boundary of a 2D array. 4. Summing elements on the main diagonal of a 2D array. 5. Transposing a 2D array by swapping rows and columns. 6. Taking input for two 3x3 matrices from the user and calculating their matrix multiplication.

Uploaded by

Shanto
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 3

Task on 2D Array

(a) Find the summation of the elements of a 2D array.

0 1 2

0 12 5 8 sum 71
1 6 7 4
2 18 9 2

Input (Declarations and Initializations): int arr[3][3], int sum = 0;

Process:
1. Start from the row with row-value r=0.
2. Start from the column with column-value c= 0.
3. Add the value of sum with the element in arr[r][c] index.
4. Store the summation of the add operation in (3) in sum.
5. Increase the value of c by 1.
6. Repeat (3), (4) and (5) for all the columns.
7. Increase the value of r by 1.
8. Repeat (2), (3), (4), (5), (6), (7) for all the rows.

Output: Print the value of sum.

(b) Find the summation of two 2D arrays and store the result in another 2D array.

0 1 2 0 1 2 0 1 2

0 12 5 8 0 2 8 18 0 14 13 26
1 6 7 4 + 1 16 14 5 = 1 22 21 9
2 18 9 2 2 8 19 12 2 26 28 24

Input (Declarations and Initializations): int A[3][3], int B[3][3], int S[3][3];

Process:
1. Start from the row with row-value r=0.
2. Start from the column with column-value c= 0.
3. Add the value of A[r][c] with B[r][c] and store the summation in S[r][c].
4. Increase the value of c by 1.
5. Repeat (3) and (4) for all the columns.
6. Increase the value of r by 1.
7. Repeat (2), (3), (4), (5) and (6) for all the rows.

Output: Print the array S.


(c) Find the Summation of the boundary elements of a 2D array.

0 1 2 3
0 12 5 8 10
1 6 7 4 11
2 18 9 2 1
3 20 3 15 13

Input (Declarations and Initializations): int arr[4][4], int sum = 0;

Process:
1. Start from the row with row-value r=0.
2. Start from the column with column-value c= 0.
3. If the value of r is 0 or r is (4-1) or c is 0 or c is (4-1), go to (4), else go to (6).
4. Add the value of sum with the element in arr[r][c] index.
5. Store the summation of add operation in (4) in sum.
6. Increase the value of c by 1.
7. Repeat (3), (4), (5) and (6) for all the columns.
8. Increase the value of r by 1.
9. Repeat (2), (3), (4), (5), (6), (7) and (8) for all the rows.

Output: Print the value of sum.

(d) Find the summation of the diagonal elements of a 2D array.

0 1 2 3 0 1 2 3 4
0 12 5 8 10 0 12 5 8 10 18
1 6 7 4 11 1 6 7 4 11 21
2 18 9 2 1 2 18 9 2 1 31
3 20 3 15 13 3 20 3 15 13 28
4 30 3 35 23 29

Input (Declarations and Initializations): int arr[n][n], int sum = 0;

Process:
1. Start from the row with row-value r=0.
2. Start from the column with column-value c= 0.
3. If the value of r is equal to c or (r+c) is equal to (n-1), go to (4), else go to (6).
4. Add the value of sum with the element in arr[r][c] index.
5. Store the summation of add operation in (4) in sum.
6. Increase the value of c by 1.
7. Repeat (3), (4), (5) and (6) for all the columns.
8. Increase the value of r by 1.
9. Repeat (2), (3), (4), (5), (6), (7) and (8) for all the rows.

Output: Print the value of sum.


(e) Find the transpose matrix of a 2D Array.

0 1 2 3 0 1 2 3 4

0 12 5 8 10 0 12 6 18 20 30
1 6 7 4 11 1 5 7 9 3 21
2 18 9 2 1 ---Transpose---> 2 8 4 2 15 35
3 20 3 15 13 3 10 11 1 3 23
4 30 21 35 23

Input (Declarations and Initializations): int A[5][4], int A_Tr[4][5];

Process:
1. Start from the row with row-value r=0.
2. Start from the column with column-value c= 0.
3. Store the element of A[r][c] in A_Tr[c][r].
4. Increase the value of c by 1.
5. Repeat (3) and (4) for all the columns.
6. Increase the value of r by 1.
7. Repeat (2), (3), (4), (5) and (6) for all the rows.

Output: Print the array A_Tr.

(f) Write a Program in C++ to take two 3X3 Square matrix input from user and find the matrix
multiplication.

You might also like