ASSIGNMENT NO 1DATA STRUCTURE

TEAM 8

TEAM MEMBERS ANAND. S _ 13MX03 DHIVYA. K. S _ 13MX09 KARTHIK. A.R _ 13MX21 MALATHI. A _ 13MX25 YOGESHWARI _ 13MX54

MULTIPLY LINKED LIST

Linked list

•A Linked representation of data structure is known as a linked list, Which is a collection of nodes.

•Each node is a collection of fields categorized as data items and links.

Merits of linked data structure

•Efficient implementation of insertion and deletion operations.

•Efficient usage of storage memory.

Multiple linked list

•In multiple linked list, each node contains

two or more link fields, each field being

used to connect the same set of data

records in a different order.

•Eg : By name, By department etc, . .

MULTIPLY LINKED LIST

Linked representation with multiple data and link fields.

Multiply linked representation of the list L is a network of nodes which are connected to one another based on some associations.

Node structure of a multiply linked list:

…DATA1 DATA2 … DATA X LINK 1

LINK 3

LINK 4

LINK 2LINK m-1

LINK m

EXAMPLE 1: Student details for representation as a multiply linked list

Name of the student

Roll no: No of Credits

Sports Club Membership

Day Student

Department

ARUN MX05 200 YES YES DCA

BABU ME12 210 N0 YES DME

LAKSHMI MX23 210 YES NO DCA

RAM CE40 190 YES NO DCE

GURU CS35 190 NO YES DCS

SREE CE46 220 YES NO DCE

Node structure of the multiply linked list student:

Sports Club Men

Name of Name of the student the Credits

Registered

Roll no

Day Student

Dept Enroll

ARUN MX05 200 YES YES DCA

BABU ME12 210 N0 YES DME

LAKSHMI MX23 210 YES NO DCA

RAM CE40 190 YES NO DCE

SCM - Sports Club Membership

Multiply linked list structure of list student

ARUN MX05 200 YES YES DCA

BABU ME12 210 N0 YES DME

GURU CS35 190 NO YES DCS

DS

DS - DAY STUDENT

LAKSHMI MX23 210 YES NO DCA

SREE CE46 220 YES NO DCE

ARUN MX05 200 YES YES DCA

RAM CE40 190 YES NO DCE

BABU ME12 210 N0 YES DME

D

D- DEPARTMENT NAME

LAKSHMI MX23 210 YES NO DCA

SREE CE46 220 YES NO DCE

GURU CS35 190 NO YES DCS

Insert ALI into the multiply linked list studentALI DCS 200 YES NO DCS

GURU CS35 190 NO YES DCS

ARUN MX05 200 YES YES DCA

BABU ME12 210 N0 YES DME

ALI DCS 200 YES NO DCS

Delete SREE from the Sports Club Membership list from student:BEFORE DELETING :

SREE CE46 220 YES NO DCE

RAM CE40 190 YES NO DCE

AFTER DELETING :

SREE CE46 220 YES NO DCE

RAM CE40 190 YES NO DCE

Example 2Sparse Matrix

The sparse matrix is a matrix with zeros as the dominating elements.

7 8 5 3 4 6 2 1 5 3 2 9 1 4 9 2

7 0 0 0 0 0 0 0 0 0 1 0 0 2 0 0

Matrix Sparse Matrix

Node structure of the multiply linked list:

ROW COL DATA

RIGHT

DOWN

Each non zero element of the matrix is represented using the node structure. Here ROW, COL and DATA fields record the row , column and values of the non zero elements in the matrix. The RIGHT link points to the node holding the next non zero value in the same row of the matrix. The LEFT link points to the node holding the next non zero value in the same column of the matrix.

Applications of multiply linked list

•Addition of polynomials

•Representation of sparse matrix

•The objective of the addition of polynomial is to perform a symbolic addition of two polynomials.

• p1 :2x^ 6 + x^3+5x+4•P2: 7x^6+8x^5-9x^3+10x^2+14

Be the two polynomials over a variable x.

The objective is to obtain the algebraic sum of p1 and p2 as,

p1+p2=9x^6+8x^5-8x^3+10x^2+5x+18.

0 1 0 0 0 0 0 0 0 0 0 0 2 0 0 1 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1

Sparse matrix in multiply linked list:

7x6

7 6 0 1 0 2 0 4 0 6

1 0

3 0

6 0

7 0

1 2 1

3 1 2 3 4 1

6 2 3

7 6 1

START

THANK YOU