Module 1: Pointers &Dynamic Memory

Allocations

Dr. Maya B S
Assistant Professor
Department of CSE
BIT
 Introduction

• A pointer is a variable that represents the

location (rather than the value) of a data item.
• They have a number of useful applications.
– Enables us to access a variable that is defined
outside the function.
– Can be used to pass information back and forth
between a function and its reference point.
– More efficient in handling data tables.
– Reduces the length and complexity of a program.
– Sometimes also increases the execution speed.

9 May 2024 Dr.Maya B.S, Assistant Professor, 2

Dept.of CSE,BIT
 Basic Concept

• Within the computer memory, every stored data

item occupies one or more contiguous memory
cells.
– The number of memory cells required to store a data
item depends on its type (char, int, double, etc.).
• Whenever we declare a variable, the system
allocates memory location(s) to hold the value of
the variable.
– Since every byte in memory has a unique address, this
location will also have its own (unique) address.

9 May 2024 Dr.Maya B.S, Assistant Professor, 3

Dept.of CSE,BIT
 Contd.

• Consider the statement

int xyz = 50;
– This statement instructs the compiler to allocate a
location for the integer variable xyz, and put the
value 50 in that location.
– Suppose that the address location chosen is 1380.

xyz  variable
50  value
1380  address

9 May 2024 Dr.Maya B.S, Assistant Professor, 4

Dept.of CSE,BIT
 Contd.
• During execution of the program, the system
always associates the name xyz with the
address 1380.
– The value 50 can be accessed by using either the
name xyz or the address 1380.
• Since memory addresses are simply numbers,
they can be assigned to some variables which
can be stored in memory.
– Such variables that hold memory addresses are
called pointers.
– Since a pointer is a variable, its value is also stored
in some memory location.
9 May 2024 Dr.Maya B.S, Assistant Professor, 5
Dept.of CSE,BIT
 Contd.

• Suppose we assign the address of xyz to a

variable p.
– p is said to point to the variable xyz.

Variable Value Address

xyz 50 1380 p = &xyz;
p 1380 2545

2545 1380 1380 50

p xyz
9 May 2024 Dr.Maya B.S, Assistant Professor, 6
Dept.of CSE,BIT
 Accessing the Address of a Variable
• The address of a variable can be determined
using the ‘&’ operator.
– The operator ‘&’ immediately preceding a variable
returns the address of the variable.
• Example:
p = &xyz;
– The address of xyz (1380) is assigned to p.
• The ‘&’ operator can be used only with a
simple variable or an array element.
&distance
&x[0]
&x[i-2]
9 May 2024 Dr.Maya B.S, Assistant Professor, 7
Dept.of CSE,BIT
 Contd.

• Following usages are illegal:

&235
• Pointing at constant.

int arr[20];
:
&arr;
• Pointing at array name.

&(a+b)
• Pointing at expression.

9 May 2024 Dr.Maya B.S, Assistant Professor, 8

Dept.of CSE,BIT
 Example

#include <stdio.h>
main()
{
int a;
float b, c;
double d;
char ch;

a = 10; b = 2.5; c = 12.36; d = 12345.66; ch = ‘A’;

printf (“%d is stored in location %u \n”, a, &a) ;
printf (“%f is stored in location %u \n”, b, &b) ;
printf (“%f is stored in location %u \n”, c, &c) ;
printf (“%ld is stored in location %u \n”, d, &d) ;
printf (“%c is stored in location %u \n”, ch, &ch) ;
}

9 May 2024 Dr.Maya B.S, Assistant Professor, 9

Dept.of CSE,BIT
Output:

10 is stored in location 3221224908 a

2.500000 is stored in location 3221224904 b
12.360000 is stored in location 3221224900 c
12345.660000 is stored in location 3221224892 d
A is stored in location 3221224891 ch

Incidentally variables a,b,c,d and ch are allocated

to contiguous memory locations.

9 May 2024 Dr.Maya B.S, Assistant Professor, 10

Dept.of CSE,BIT
 Pointer Declarations

• Pointer variables must be declared before we

use them.
• General form:
data_type *pointer_name;
Three things are specified in the above
declaration:
1. The asterisk (*) tells that the variable pointer_name is a
pointer variable.
2. pointer_name needs a memory location.
3. pointer_name points to a variable of type data_type.

9 May 2024 Dr.Maya B.S, Assistant Professor, 11

Dept.of CSE,BIT
 Contd.

• Example:
int *count;
float *speed;
• Once a pointer variable has been declared, it
can be made to point to a variable using an
assignment statement like:
int *p, xyz;
:
p = &xyz;
– This is called pointer initialization.

9 May 2024 Dr.Maya B.S, Assistant Professor, 12

Dept.of CSE,BIT
 Things to Remember

• Pointer variables must always point to a data

item of the same type.
float x;
int *p;
:  will result in erroneous output
p = &x;
• Assigning an absolute address to a pointer
variable is prohibited.
int *count;
:
count = 1268;
9 May 2024 Dr.Maya B.S, Assistant Professor, 13
Dept.of CSE,BIT
 Accessing a Variable Through its Pointer

• Once a pointer has been assigned the address of

a variable, the value of the variable can be
accessed using the indirection operator (*).
int a, b;
int *p;
: Equivalent to b=a
p = &a;
b = *p;

9 May 2024 Dr.Maya B.S, Assistant Professor, 14

Dept.of CSE,BIT
 Example 1

#include <stdio.h>
main()
{
int a, b;
int c = 5;
Equivalent
int *p;

a = 4 * (c + 5) ;

p = &c;
b = 4 * (*p + 5) ;
printf (“a=%d b=%d \n”, a, b) ;
}

9 May 2024 Dr.Maya B.S, Assistant Professor, 15

Dept.of CSE,BIT
 Example 2
#include <stdio.h>
main()
{
int x, y; *&xx
int *ptr;

x = 10 ;
ptr=&x;
ptr = &x ; &x&*ptr
y = *ptr ;
printf (“%d is stored in location %u \n”, x, &x) ;
printf (“%d is stored in location %u \n”, *&x, &x) ;
printf (“%d is stored in location %u \n”, *ptr, ptr) ;
printf (“%d is stored in location %u \n”, y, &*ptr) ;
printf (“%u is stored in location %u \n”, ptr, &ptr) ;
printf (“%d is stored in location %u \n”, y, &y) ;

*ptr = 25;
printf (“\nNow x = %d \n”, x);
}
9 May 2024 Dr.Maya B.S, Assistant Professor, 16
Dept.of CSE,BIT
 Address of x: 3221224908
Output:
Address of y: 3221224904

10 is stored in location 3221224908 Address of ptr: 3221224900

10 is stored in location 3221224908
10 is stored in location 3221224908
10 is stored in location 3221224908
3221224908 is stored in location 3221224900
10 is stored in location 3221224904

Now x = 25

9 May 2024 Dr.Maya B.S, Assistant Professor, 17

Dept.of CSE,BIT
 Pointer Expressions

• Like other variables, pointer variables can be

used in expressions.
• If p1 and p2 are two pointers, the following
statements are valid:
sum = *p1 + *p2 ;
prod = *p1 * *p2 ;
prod = (*p1) * (*p2) ;
*p1 = *p1 + 2;
x = *p1 / *p2 + 5 ;

9 May 2024 Dr.Maya B.S, Assistant Professor, 18

Dept.of CSE,BIT
 Contd.
• What are allowed in C?
– Add an integer to a pointer.
– Subtract an integer from a pointer.
– Subtract one pointer from another (related).
• If p1 and p2 are both pointers to the same array, them
p2–p1 gives the number of elements between p1 and p2.
• What are not allowed?
– Add two pointers.
p1 = p1 + p2 ;
– Multiply / divide a pointer in an expression.
p1 = p2 / 5 ;
p1 = p1 – p2 * 10 ;

9 May 2024 Dr.Maya B.S, Assistant Professor, 19

Dept.of CSE,BIT
 Scale Factor
• We have seen that an integer value can be
added to or subtracted from a pointer variable.
int *p1, *p2 ;
int i, j;
:
p1 = p1 + 1 ;
p2 = p1 + j ;
p2++ ;
p2 = p2 – (i + j) ;
• In reality, it is not the integer value which is
added/subtracted, but rather the scale factor
times the value.
9 May 2024 Dr.Maya B.S, Assistant Professor, 20
Dept.of CSE,BIT
 Contd.

Data Type Scale Factor

char 1
int 4
float 4
double 8

– If p1 is an integer pointer, then

p1++
will increment the value of p1 by 4.

9 May 2024 Dr.Maya B.S, Assistant Professor, 21

Dept.of CSE,BIT
 Example:
Returns to required
no. of bytes find theforscale factors
data type representation
#include <stdio.h>
main()
{
printf (“Number of bytes occupied by int is %d \n”, sizeof(int));
printf (“Number of bytes occupied by float is %d \n”, sizeof(float));
printf (“Number of bytes occupied by double is %d \n”, sizeof(double));
printf (“Number of bytes occupied by char is %d \n”, sizeof(char));
}

Output:

Number of bytes occupied by int is 4

Number of bytes occupied by float is 4
Number of bytes occupied by double is 8
Number of bytes occupied by char is 1

9 May 2024 Dr.Maya B.S, Assistant Professor, 22

Dept.of CSE,BIT
 Passing Pointers to a Function
• Pointers are often passed to a function as
arguments.
– Allows data items within the calling program to be
accessed by the function, altered, and then returned
to the calling program in altered form.
– Called call-by-reference (or by address or by
location).
• Normally, arguments are passed to a function
by value.
– The data items are copied to the function.
– Changes are not reflected in the calling program.

9 May 2024 Dr.Maya B.S, Assistant Professor, 23

Dept.of CSE,BIT
 Example: passing arguments by value
#include <stdio.h>
main()
{ a and b
int a, b; do not
a = 5 ; b = 20 ; swap
swap (a, b) ; Output
printf (“\n a = %d, b = %d”, a, b);
} a = 5, b = 20

void swap (int x, int y)

{
int t ;
t=x;
x=y; x and y swap
y=t;
}
9 May 2024 Dr.Maya B.S, Assistant Professor, 24
Dept.of CSE,BIT
 Example: passing arguments by reference
#include <stdio.h>
main()
{ *(&a) and *(&b)
int a, b; swap
a = 5 ; b = 20 ;
swap (&a, &b) ; Output
printf (“\n a = %d, b = %d”, a, b);
} a = 20, b = 5

void swap (int *x, int *y)

{
int t ;
t = *x ; *x and *y
*x = *y ; swap
*y = t ;
}
9 May 2024 Dr.Maya B.S, Assistant Professor, 25
Dept.of CSE,BIT
 scanf Revisited

int x, y ;
printf (“%d %d %d”, x, y, x+y) ;

• What about scanf ?

scanf (“%d %d %d”, x, y, x+y) ; NO

scanf (“%d %d”, &x, &y) ; YES

9 May 2024 Dr.Maya B.S, Assistant Professor, 26

Dept.of CSE,BIT
 Example: Sort 3 integers

• Three-step algorithm:
1. Read in three integers x, y and z
2. Put smallest in x
• Swap x, y if necessary; then swap x, z if necessary.
3. Put second smallest in y
• Swap y, z if necessary.

9 May 2024 Dr.Maya B.S, Assistant Professor, 27

Dept.of CSE,BIT
 Contd.

#include <stdio.h>
main()
{
int x, y, z ;
………..
scanf (“%d %d %d”, &x, &y, &z) ;
if (x > y) swap (&x, &y);
if (x > z) swap (&x, &z);
if (y > z) swap (&y, &z) ;
………..
}

9 May 2024 Dr.Maya B.S, Assistant Professor, 28

Dept.of CSE,BIT
 sort3 as a function
#include <stdio.h>
main()
{
int x, y, z ;
………..
scanf (“%d %d %d”, &x, &y, &z) ;
sort3 (&x, &y, &z) ;
………..
}

void sort3 (int *xp, int *yp, int *zp)

{ xp/yp/zp
if (*xp > *yp) swap (xp, yp); are
if (*xp > *zp) swap (xp, zp); pointers
if (*yp > *zp) swap (yp, zp);
}
9 May 2024 Dr.Maya B.S, Assistant Professor, 29
Dept.of CSE,BIT
 Contd.

• Why no ‘&’ in swap call?

– Because xp, yp and zp are already pointers that
point to the variables that we want to swap.

9 May 2024 Dr.Maya B.S, Assistant Professor, 30

Dept.of CSE,BIT
 Pointers and Arrays

• When an array is declared,

– The compiler allocates a base address and sufficient
amount of storage to contain all the elements of the
array in contiguous memory locations.
– The base address is the location of the first element
(index 0) of the array.
– The compiler also defines the array name as a
constant pointer to the first element.

9 May 2024 Dr.Maya B.S, Assistant Professor, 31

Dept.of CSE,BIT
 Example
• Consider the declaration:
int x[5] = {1, 2, 3, 4, 5} ;
– Suppose that the base address of x is 2500, and each
integer requires 4 bytes.
Element Value Address
x[0] 1 2500
x[1] 2 2504
x[2] 3 2508
x[3] 4 2512
x[4] 5 2516

9 May 2024 Dr.Maya B.S, Assistant Professor, 32

Dept.of CSE,BIT
 Contd.

x  &x[0]  2500 ;

– p = x; and p = &x[0]; are equivalent.

– We can access successive values of x by using p++ or
p- - to move from one element to another.
• Relationship between p and x:
p = &x[0] = 2500
p+1 = &x[1] = 2504
p+2 = &x[2] = 2508 *(p+i) gives the
p+3 = &x[3] = 2512 value of x[i]
p+4 = &x[4] = 2516

9 May 2024 Dr.Maya B.S, Assistant Professor, 33

Dept.of CSE,BIT
 Example: function to find average
int *array
#include <stdio.h> float avg (int array[ ],int size)
main() {
{ int *p, i , sum = 0;
int x[100], k, n ;
p = array ; p[i]
scanf (“%d”, &n) ;
for (i=0; i<size; i++)
for (k=0; k<n; k++) sum = sum + *(p+i);
scanf (“%d”, &x[k]) ;
return ((float) sum / size);
printf (“\nAverage is %f”, }
avg (x, n));
}

9 May 2024 Dr.Maya B.S, Assistant Professor, 34

Dept.of CSE,BIT
 Structures Revisited

• Recall that a structure can be declared as:

struct stud {
int roll;
char dept_code[25];
float cgpa;
};
struct stud a, b, c;
• And the individual structure elements can be
accessed as:
a.roll , b.roll , c.cgpa , etc.

9 May 2024 Dr.Maya B.S, Assistant Professor, 35

Dept.of CSE,BIT
 Arrays of Structures

• We can define an array of structure records as

struct stud class[100] ;

• The structure elements of the individual

records can be accessed as:
class[i].roll
class[20].dept_code
class[k++].cgpa

9 May 2024 Dr.Maya B.S, Assistant Professor, 36

Dept.of CSE,BIT
 Example: Sorting by Roll Numbers
#include <stdio.h> for (k=0; k<n; k++)
struct stud scanf (“%d %s %f”, &class[k].roll,
{ class[k].dept_code, &class[k].cgpa);
int roll; for (j=0; j<n-1; j++)
char dept_code[25]; for (k=j+1; k<n; k++)
float cgpa; {
}; if (class[j].roll > class[k].roll)
{
main() t = class[j] ;
{ class[j] = class[k] ;
struc stud class[100], t; class[k] = t
int j, k, n; }
}
scanf (“%d”, &n); <<<< PRINT THE RECORDS >>>>
/* no. of students */ }

9 May 2024 Dr.Maya B.S, Assistant Professor, 37

Dept.of CSE,BIT
 Pointers and Structures

• You may recall that the name of an array

stands for the address of its zero-th element.
– Also true for the names of arrays of structure
variables.
• Consider the declaration:
struct stud {
int roll;
char dept_code[25];
float cgpa;
} class[100], *ptr ;

9 May 2024 Dr.Maya B.S, Assistant Professor, 38

Dept.of CSE,BIT
 – The name class represents the address of the zero-th
element of the structure array.
– ptr is a pointer to data objects of the type struct stud.
• The assignment
ptr = class ;
will assign the address of class[0] to ptr.
• When the pointer ptr is incremented by one
(ptr++) :
– The value of ptr is actually increased by sizeof(stud).
– It is made to point to the next record.

9 May 2024 Dr.Maya B.S, Assistant Professor, 39

Dept.of CSE,BIT
• Once ptr points to a structure variable, the
members can be accessed as:
ptr –> roll ;
ptr –> dept_code ;
ptr –> cgpa ;

– The symbol “–>” is called the arrow operator.

9 May 2024 Dr.Maya B.S, Assistant Professor, 40

Dept.of CSE,BIT
 Example
#include <stdio.h> swap_ref(_COMPLEX *a, _COMPLEX *b)
{
typedef struct { _COMPLEX tmp;
float real; tmp=*a;
float imag; *a=*b;
} _COMPLEX; *b=tmp;
}
main()
print(_COMPLEX *a)
{
{
_COMPLEX x={10.0,3.0}, y={-20.0,4.0};
printf("(%f,%f)\n",a->real,a->imag);
}
(10.000000,3.000000) print(&x); print(&y);
(-20.000000,4.000000) swap_ref(&x,&y);
(-20.000000,4.000000) print(&x); print(&y);
9(10.000000,3.000000)
May 2024 } Professor,
Dr.Maya B.S, Assistant 41
Dept.of CSE,BIT
 A Warning

• When using structure pointers, we should take

care of operator precedence.
– Member operator “.” has higher precedence than “*”.
• ptr –> roll and (*ptr).roll mean the same thing.
• *ptr.roll will lead to error.

– The operator “–>” enjoys the highest priority among

operators.
• ++ptr –> roll will increment roll, not ptr.
• (++ptr) –> roll will do the intended thing.

9 May 2024 Dr.Maya B.S, Assistant Professor, 42

Dept.of CSE,BIT
 Structures and Functions

• A structure can be passed as argument to a

function.
• A function can also return a structure.
• The process shall be illustrated with the help of
an example.
– A function to add two complex numbers.

9 May 2024 Dr.Maya B.S, Assistant Professor, 43

Dept.of CSE,BIT
 Example: complex number addition
#include <stdio.h> struct complex add (x, y)
struct complex { struct complex x, y;
float re; {
float im; struct complex t;
};
t.re = x.re + y.re ;
main() t.im = x.im + y.im ;
{ return (t) ;
struct complex a, b, c; }
scanf (“%f %f”, &a.re, &a.im);
scanf (“%f %f”, &b.re, &b.im);
c = add (a, b) ;
printf (“\n %f %f”, c.re, c.im);
}

9 May 2024 Dr.Maya B.S, Assistant Professor, 44

Dept.of CSE,BIT
 Example: Alternative way using pointers
#include <stdio.h> void add (x, y, t)
struct complex { struct complex *x, *y, *t;
float re; {
float im; t->re = x->re + y->re ;
}; t->im = x->im + y->im ;
}
main()
{
struct complex a, b, c;
scanf (“%f %f”, &a.re, &a.im);
scanf (“%f %f”, &b.re, &b.im);
add (&a, &b, &c) ;
printf (“\n %f %f”, c,re, c.im);
}

9 May 2024 Dr.Maya B.S, Assistant Professor, 45

Dept.of CSE,BIT
Dynamic Memory Allocation
 Basic Idea

• Many a time we face situations where data is

dynamic in nature.
– Amount of data cannot be predicted beforehand.
– Number of data item keeps changing during
program execution.
• Such situations can be handled more easily and
effectively using dynamic memory management
techniques.

9 May 2024 Dr.Maya B.S, Assistant Professor, 47

Dept.of CSE,BIT
 Contd.

• C language requires the number of elements in

an array to be specified at compile time.
– Often leads to wastage or memory space or program
failure.
• Dynamic Memory Allocation
– Memory space required can be specified at the time
of execution.
– C supports allocating and freeing memory
dynamically using library routines.

9 May 2024 Dr.Maya B.S, Assistant Professor, 48

Dept.of CSE,BIT
 Memory Allocation Process in C

Local variables Stack

Free memory Heap

Global variables Permanent storage

area
Instructions

9 May 2024 Dr.Maya B.S, Assistant Professor, 49

Dept.of CSE,BIT
 Contd.

• The program instructions and the global

variables are stored in a region known as
permanent storage area.
• The local variables are stored in another area
called stack.
• The memory space between these two areas is
available for dynamic allocation during
execution of the program.
– This free region is called the heap.
– The size of the heap keeps changing

9 May 2024 Dr.Maya B.S, Assistant Professor, 50

Dept.of CSE,BIT
 Memory Allocation Functions

• malloc
– Allocates requested number of bytes and returns a
pointer to the first byte of the allocated space.
• calloc
– Allocates space for an array of elements, initializes
them to zero and then returns a pointer to the
memory.
• free
Frees previously allocated space.
• realloc
– Modifies the size of previously allocated space.

9 May 2024 Dr.Maya B.S, Assistant Professor, 51

Dept.of CSE,BIT
 Allocating a Block of Memory

• A block of memory can be allocated using the

function malloc.
– Reserves a block of memory of specified size and
returns a pointer of type void.
– The return pointer can be assigned to any pointer
type.
• General format:
ptr = (type *) malloc (byte_size) ;

9 May 2024 Dr.Maya B.S, Assistant Professor, 52

Dept.of CSE,BIT
 Contd.

• Examples
p = (int *) malloc (100 * sizeof (int)) ;
• A memory space equivalent to “100 times the size of an int”
bytes is reserved.
• The address of the first byte of the allocated memory is
assigned to the pointer p of type int.
p

400 bytes of space

9 May 2024 Dr.Maya B.S, Assistant Professor, 53

Dept.of CSE,BIT
 Contd.

cptr = (char *) malloc (20) ;

• Allocates 10 bytes of space for the pointer cptr of type char.

sptr = (struct stud *) malloc (10 *

sizeof (struct stud));

9 May 2024 Dr.Maya B.S, Assistant Professor, 54

Dept.of CSE,BIT
 Points to Note

• malloc always allocates a block of contiguous

bytes.
– The allocation can fail if sufficient contiguous
memory space is not available.
– If it fails, malloc returns NULL.

9 May 2024 Dr.Maya B.S, Assistant Professor, 55

Dept.of CSE,BIT
 Example
#include <stdio.h> printf("Input heights for %d
Input the number of students. students \n",N);
main() for(i=0;i<N;i++)
5
{ scanf("%f",&height[i]);
Input heights for 5 students
int i,N;
23 24 25 26 27
float *height; for(i=0;i<N;i++)
Average height= 25.000000
float sum=0,avg; sum+=height[i];

printf("Input the number of students. \n"); avg=sum/(float) N;

scanf("%d",&N);
printf("Average height= %f \n",
height=(float *) malloc(N * sizeof(float)); avg);
}

9 May 2024 Dr.Maya B.S, Assistant Professor, 56

Dept.of CSE,BIT
 Releasing the Used Space

• When we no longer need the data stored in a

block of memory, we may release the block for
future use.
• How?
– By using the free function.
• General format:
free (ptr) ;
where ptr is a pointer to a memory block which
has been already created using malloc.

9 May 2024 Dr.Maya B.S, Assistant Professor, 57

Dept.of CSE,BIT
 Altering the Size of a Block

• Sometimes we need to alter the size of some

previously allocated memory block.
– More memory needed.
– Memory allocated is larger than necessary.
• How?
– By using the realloc function.
• If the original allocation is done by the statement
ptr = malloc (size) ;
then reallocation of space may be done as
ptr = realloc (ptr, newsize) ;

9 May 2024 Dr.Maya B.S, Assistant Professor, 58

Dept.of CSE,BIT
 Contd.

– The new memory block may or may not begin at the

same place as the old one.
• If it does not find space, it will create it in an entirely
different region and move the contents of the old block into
the new block.
– The function guarantees that the old data remains
intact.
– If it is unable to allocate, it returns NULL and frees
the original block.

9 May 2024 Dr.Maya B.S, Assistant Professor, 59

Dept.of CSE,BIT
 Pointer to Pointer

• Example:
int **p;
p=(int **) malloc(3 * sizeof(int *));

p[0]
p int ** int *
p[1] int *
int *

p[2]

9 May 2024 Dr.Maya B.S, Assistant Professor, 60

Dept.of CSE,BIT
 2-D Array Allocation
#include <stdio.h> void read_data(int **p,int h,int w)
#include <stdlib.h> {
int i,j;
int **allocate(int h, int w) for(i=0;i<h;i++)
{ for(j=0;j<w;j++)
int **p; Allocate array scanf ("%d",&p[i][j]);
int i,j; of pointers }

Elements accessed
p=(int **) calloc(h, sizeof (int *) );
like 2-D array elements.
for(i=0;i<h;i++)
p[i]=(int *) calloc(w,sizeof (int));
return(p);
} Allocate array of
integers for each
9 May 2024 Dr.Maya B.S, Assistant Professor, 61
row Dept.of CSE,BIT
 2-D Array: Contd.
void print_data(int **p,int h,int w) main()
{ {
int i,j; int **p;
for(i=0;i<h;i++) int M,N;
{
for(j=0;j<w;j++) printf("Give M and N \n");
printf("%5d ",p[i][j]); scanf("%d%d",&M,&N);
printf("\n"); p=allocate(M,N);
} read_data(p,M,N);
} printf("\n The array read as \n");
print_data(p,M,N);
}

9 May 2024 Dr.Maya B.S, Assistant Professor, 62

Dept.of CSE,BIT
 • Give M and N
33
123
456
789
The array read as
1 2 3
4 5 6
7 8 9

9 May 2024 Dr.Maya B.S, Assistant Professor, 63

Dept.of CSE,BIT
 THANK YOU

9 May 2024 Dr.Maya B.S, Assistant Professor, 64

Dept.of CSE,BIT