Data Structure with C -Part-2 ADT,Array, Strucure and Union

1 Prof. A. Syed Mustafa (Ph.D)

2 Prof. A. Syed Mustafa (Ph.D)

Unit -2

Prof. A. Syed Mustafa (Ph.D)

3

ARRAYS AND STRUCTURES


4

Topics :

Arrays

Dynamically Allocated Arrays

Structures and Unions

Polynomials

Sparse Matrices

Representation of Multidimensional Arrays



5


Arrays


6


Arrays


7


Arrays


8


Arrays


9


Arrays


10


Arrays


11


Structures


12


Structures


13


Structures


14


Structures


15


Structures


16


Structures


17


Structures


18


Structures


19


Structures

• Structure variables may be initialized:struct {

char name[25];

int id, age;

char sex;

} s1 = { "Smith, John", 2813, 25, 'M'},

s2 = { "Smith, Mary", 4692, 23, 'F'};


20


Structures• A structure can be given a name (a structure tag) for later use:struct student {

char name[25];

int id, age;

char sex;

};

struct student s1, s2;

The two declarations can be combined if desired, with the same effect:struct student {

char name[25];

int id, age;

char sex;

} s1, s2;


21


Structures

• As an alternative, we can use typedef to name a structure:

typedef struct {

char name[25];

int id, age;

char sex;

} Student;

Student s1, s2;


22


Structures


23


Structures

• The members of a structure are accessed by writing first

the name of the structure, then a period, then the name of

the member:

struct student {

char name[25];

int id, age;

char sex;

} s;

strcpy(s.name, “Syed");

s.id = 18193;

s.age = 18;

s.sex = 'M';


24


Unions


25


Unions


26


UnionsSimilar to struct, but only one field is active.

Example: Add fields for male and female.

typedef struct sex_type {

enum tag_field {female, male} sex;

union {

int children;

int beard;

} u;

};

typedef struct human_being {

char name[10];

int age;

float salary;

date dob;

sex_type sex_info;

}


27


Unions


28


Polynomials


29


Polynomials

30

Some of the problems require lot of zeros to be stored

as a part of solution.

Hence storing more number of zeros is a waste of

memory.

Matrices with relatively high proportion of zero entries

are called sparse matrices.

Matrix that contains more number of zero elements are

called sparse matrices.

Sparse matrix is used in almost all areas of the natural

sciences Prof. A. Syed Mustafa (Ph.D)


Sparse Matrix

31



Sparse Matrix

32



Sparse Matrix

33



Sparse Matrix

Data Structure with C -Part-2 ADT,Array, Strucure and Union

Engineering

Transcript of Data Structure with C -Part-2 ADT,Array, Strucure and Union