2 D A R R AY S

L20-L21

04/28/2023 CSE 1001 Department of CSE 1

Objectives

To learn and appreciate the following concepts

• 2D Array declaration, initialization
• Programs using 2D arrays

04/28/2023 CSE 1001 Department of CSE 2

Session outcome

At the end of session student will be able to

Declare, initialize and access 2D array
Write programs using 2D array

04/28/2023 CSE 1001 Department of CSE 3

2 dimensional Array

It is an ordered table of homogeneous elements.

It can be imagined as a two dimensional table made

of elements, all of them of a same uniform data type.
It is generally referred to as matrix, of some rows
and some columns.
It is also called as a two-subscripted variable.

04/28/2023 CSE 1001 Department of CSE 4

2 dimensional Arrays
For example
int marks[5][3];
float matrix[3][3];
char page[25][80];

The first example tells that marks is a 2-D array of 5 rows

and 3 columns.
The second example tells that matrix is a 2-D array of 3 rows
and 3 columns.
Similarly, the third example tells that page is a 2-D array of
25 rows and 80 columns.

04/28/2023 CSE 1001 Department of CSE 5

2 dimensional Arrays
Declaration
type array_name[row_size][column_size];
For example,
int arr [3][5];

arr represents a two dimensional array or table having

3 rows and 5 columns and it can store 15 integer
values.

04/28/2023 CSE 1001 Department of CSE 6

2 Dimensional Arrays
Initialization of two dimensional arrays
type array-name [row size] [col size ] ={list of values};
int table [2][3]={0,0,0,1,1,1};
 initializes the elements of the first row to zero and the
second row to 1.
Initialization is always done row by row.
The above statement can be equivalently written as
int table [2][3]={{0,0,0},{1,1,1}};
OR in matrix form it can be written as
int table [2][3]= { {0,0,0},
{1,1,1} };

04/28/2023 CSE 1001 Department of CSE 7

2 Dimensional Arrays
When array is completely initialized with all values, need not
necessarily specify the first dimension.

int table [][3]= { {0,0,0},

{1,1,1 }
};
If the values are missing in an initializer, they are set to zero
int table [2][3]= { {1,1},
{2}
};
will initialize the first two elements of the first row to 1, the first
element of the second row to two, and all other elements to zero.
To set all elements to zero
int table [3][3]={{0},{0},{0}};

04/28/2023 CSE 1001 Department of CSE 8

Read a matrix and display it
int main()
{ for(i=0;i<m;i++)
int i, j, m, n, a[100][100]; {
for(j=0;j<n;j++)
printf("enter dimension for printf(“%d\t”,a[i][j]);
a:“); printf(“\n”);
scanf(“%d %d”,&m,&n); }

printf("\n enter elements\n“); return 0;

for(i=0;i<m;i++) }
{
for(j=0;j<n;j++)
scanf(“%d”, &a[i][j]);
}
04/28/2023 CSE 1001 Department of CSE 9
Addition of two Matrices
#include<stdio.h> if (m!=p||n!=q)
#include<stdlib.h> {
int main() printf("cannot add \n“);
{ exit(0); }
int i, j, m, n, p, q, a[10][10], b[10] //Reading the elements
[10], c[10][10]; printf("enter elements for a \n“);
printf("enter dimension for a \n“); for (i=0;i<m;i++)
scanf(“%d %d”,&m,&n); for(j=0;j<n;j++)
printf("enter dimension for b\n“); scanf(“%d”,&a[i][j]);
scanf(“%d %d”,&p,&q);

04/28/2023 CSE 1001 Department of CSE 10

Matrix Addition

printf("\n enter elements for b\n)"; //Display

for(i=0;i<p;i++) printf("\n final matrix is \n“);
for(j=0;j<q;j++) for(i=0;i<m;i++)
scanf(“%d”, &b[i][j]); {
//Addition for(j=0;j<n;j++)
for(i=0;i<m;i++) printf(“%d”,c[i][j]);
for(j=0;j<n;j++) printf("\n“);
c[i][j]=a[i][j]+b[i][j]; }

04/28/2023 CSE 1001 Department of CSE 11

Row Sum & Column Sum of a matrix
//Row sum
int a[10][10];
for(i=0;i<m;i++)
int rowsum[10], colsum[10]; {
printf("enter dimension for a \ rowsum[i]=0;

n“); for(j=0;j<n;j++)
rowsum[i]=rowsum[i]+a[i][j];
scanf(“%d %d”,&m, &n);
}
//Reading
printf("\n“);
printf("enter elements for a \n“);
for (i=0;i<m;i++){
for(j=0;j<n;j++)
scanf(“%d”, &a[i][j]);
04/28/2023 CSE 1001 Department of CSE 12
Row Sum & Column Sum of a matrix
//Display
//Column sum
for(i=0;i<m;i++)
for(j=0;j<n;j++)
{
{
for(j=0;j<n;j++)
colsum[j]=0;
printf("\t %d“,a[i][j]);
for(i=0;i<m;i++)
printf(“->“)
colsum[j]=colsum[j]+a[i][j];
printf(“%d\n”,rowsum[i]);
}
}
printf("\n“);

for(i=0;i<n;i++)
printf("\t %d”,colsum[i]);
04/28/2023 CSE 1001 Department of CSE 13
Row Sum & Column Sum of a matrix

04/28/2023 CSE 1001 Department of CSE 14

Multiplication of two Matrices
printf("enter elements for a \
#include <stdlib.h>
n“);
int main(){ int i, j, m, n, p, q;
for (i=0;i<m;i++)
int a[10][10], b[10][10],c[10][10];
{
printf("enter dimension for a \n“);
for(j=0;j<n;j++)
scanf(“%d %d”,&m,&n);
scanf(“%d”,&a[i][j]);
printf("\n enter dimension for b\
}
n“);
printf("\n enter elements for b\
scanf(“%d %d”, &p,&q);
n“);
if(n!=p){
for(i=0;i<p;i++)
printf("not multiplicable \n“);
CSE 1001 Department of CSE { for(j=0;j<q;j++)
04/28/2023 15
Multiplication of two Matrices
for(i=0;i<m;i++) {
for(j=0;j<q;j++) {
c[i][j]=0;
for(k=0;k<n;k++)
printf("\n The product matrix is \n“);
c[i][j]=c[i][j]+a[i][k]*b[k][j];
for(i=0;i<m;i++){
}
for(j=0;j<q;j++)
}
printf(“%d\t“,c[i][j]);
printf("\n“);
}

CSE 1001 Department of CSE 04/28/2023 16

 Trace and Norm of a Matrix
Trace is sum of principal diagonal elements of a square matrix.
Norm is Square Root of sum of squares of elements of a matrix.

int trace=0, sum=0,i,j,norm;

int m=3,n=3; for(i=0;i<m;i++)
printf(“enter elements for a \n“); {
for (i=0;i<m;i++){ for(j=0;j<n;j++)
for(j=0;j<n;j++) sum=sum+a[ i ][ j]*a[ i ][ j ];
}
scanf(“%d”,&a[i][j]); norm=sqrt(sum);
}
printf(“ trace is %d”, trace );
for(i=0;i<m;i++) printf(“ norm is %d”, norm );
trace=trace + a[i][i];

04/28/2023 CSE 1001 Department of CSE 17

Check whether a given Matrix is Symmetric or not

printf("enter dimension \ for(i=0;i<m;i++){

n“); for(j=0;j<n;j++){

scanf(“%d %d”,&m,&n); if (a[ i ][ j ]!=a[ j ][ i ]){

if(m!=n) printf("\n matrix is not

printf("it is not a square \

n“); symmetric \n“);

else getch(); exit(0); }

{ printf("enter elements \ } }
n“); printf("\n matrix is
for(i=0;i<m;i++)
04/28/2023 CSE 1001
symmetric“);
Department of CSE 18
Extra problem: To be solved …
Write program to check the given matrix is a magic square or
not
A magic square of order n is an arrangement of n²
numbers, usually distinct integers, in a square, such
that the n numbers in all rows, all columns, and
both diagonals sum to the same constant.

A normal magic square contains the integers from

1 to n².

04/28/2023 CSE 1001 Department of CSE 19

 Magic Square

816 618
//Matrix is Magic square or not 357 753
void main() 492 294
{
int mag[10][10], i, j, row, col, rowsum[10], colsum[10];
int pd=0, sd=0, k, x=0, b[100];
clrscr();
printf("enter dimension \n“);
scanf(“%d %d”,&row,&col);
if(row!=col) // checking for square matrix
{
printf(“matrix is not square”);
getch(); exit(0);}

04/28/2023 CSE 1001 Department of CSE 20

Magic Square

//inputting elements to the array //copying elements to 1D

printf("\n enter elements for a \ for(k=0;k<x-1;k++)
n“); for(j=k+1;j<x;j++)
for(i=0;i<row;i++) if(b[k]==b[j])
{ {
for(j=0;j<col;j++) printf(“elements are no distinct\n”);
scanf(“%d”,&mag[i][j]); printf(“matrix is not magic”); getch();
} exit(0);
//checking for uniqueness }
for(i=0;i<row;i++)
for(j=0;j<col;j++)
b[x++]=mag[i][j];
04/28/2023 CSE 1001 Department of CSE 21
Magic Square
//Finding sum of elements on principal Diagonal
for(i=0; i<row; i++)
pd=pd + mag[i][i];
//Row sum
for(i=0; i<row; i++)
{
rowsum[i]=0;
for(j=0;j< col; j++)
rowsum[i]=rowsum[i]+mag[i][j];
//comparing rowsum and principal diagonal sum
if(rowsum[i]!=pd)
{
printf(“matrix is not magic”);
getch(); exit(0);
}
}
04/28/2023 CSE 1001 Department of CSE 22
Magic Square
//Finding column sum
for(i=0;i<col;i++)
{ colsum[i]=0;
for(j=0;j<row;j++)
colsum[i]=colsum[i]+mag[j][i];

//comparing Columnsum and principal diagonal sum

if(colsum[i]!=pd){ printf(“matrix is not magic”); getch(); exit(0); }
}

04/28/2023 CSE 1001 Department of CSE 23

Magic Square

//finding secondary diagonal sum

i=row-1;
k=i;
for(j=col-1;j>=0;j--,i--)
sd=sd+mag[i][k-j];
if(sd!=pd)
{ printf(“matrix is not magic”);
getch(); exit(0); }
printf(“Matrix is magic\n”);
getch();
}

04/28/2023 CSE 1001 Department of CSE 24

Exchange the elements of principal diagonal with secondary diagonal
in an N dimensional Square matrix
for(i=0;i<n;i++)
for(j=0;j<n;j++)
if(i==j){
temp=arr[i][j];
arr[i][j]=arr[i][n-i-1];
arr[i][n-i-1]=temp;
int main(){ }
int i, j, temp, arr[4][4],n; printf("\nModified Matrix:\n“);
for(i=0;i<n;i++){
printf("\nEnter dimension: “); for(j=0;j<n;j++)
scanf(“%d”,&n); printf(" “);
Printf(“%d”,arr[i][j]);
printf(“\nEnter elements:\n"); printf("\n“);
for(i=0;i<n;i++) }
for(j=0;j<n;j++) return 0;
printf(“%d”,arr[i][j]); }
04/28/2023 CSE 1001 Department of CSE 25
Exchange the Rows and Columns of a ‘mxn’ matrix
/*read ‘mxn’ matrix */
printf("\nEnter the rows to exchange:
“);
scanf(“%d %d”,&r1,&r2);
/*Row exchange r1  r2 */
for(j=0;j<n;j++) {
temp=arr[r1-1][j];
arr[r1-1][j]=arr[r2-1][j];
arr[r2-1][j]=temp; }
printf(“\nEnter the cols to exchange: “);
scanf(“%d %d”,&c1,&c2);
/*Column exchange : c1  c2 */
for(i=0;i<m;i++) {
temp=arr[i][c1-1];
arr[i][c1-1]=arr[i][c2-1];
arr[i][c2-1]=temp; }
04/28/2023 CSE 1001 Department of CSE 26
Summary

• 2 Dimensional Arrays

04/28/2023 CSE 1001 Department of CSE 27

Syntax
Declaration:
data-type array_name[row_size][column_size];
Initialization of two dimensional arrays:
type array-name [row size] [col size ] ={list of values};

Display a Matrix:
Reading a Matrix: int a[100][100];
int a[100][100]; for(i=0;i<m;i++)
for(i=0;i<m;i++) {
{ for(j=0;j<n;j++)
for(j=0;j<n;j++) printf(“%d”,a[i][j]);
scanf(“%d”,&a[i][j]); printf(“ “);
} printf(“\n”);
}
04/28/2023 CSE 1001 Department of CSE 28
Tutorials

• Write a program to check whether the given matrix is

sparse matrix or not.

• Write a program to find the sum of the elements above

and below diagonal elements in a matrix.

• Write a program to find the determinant of a matrix.

04/28/2023 CSE 1001 Department of CSE 29