MODULE 1 - ARRAYS AND SEARCHING
Polynomial representation using Arrays, Sparse matrix, Stacks, Queues - Circular Queues, Priority
Queues, Double Ended Queues, Evaluation of Expressions, Linear Search and Binary Search
DATA STRUCTURE
It is a representation of logical relationship between individual elements of data. It is also defined
as a mathematical model of particular organization of data items. It is also called building block
of a program.
Classification of data structure
1. Linear data structure
● All the elements form a sequence or maintain a linear ordering.
2. Non linear data structure
● Elements are distributed over a plane.
,1. POLYNOMIAL REPRESENTATION USING ARRAYS
● A polynomial is a sum of terms where each term has the form axe ,
Where x is the variable, a is the coefficient and e is the exponent.
Polynomial representation using Arrays
,Polynomial Addition Example
, S
teps of Polynomial Addition
Polynomial representation using Arrays, Sparse matrix, Stacks, Queues - Circular Queues, Priority
Queues, Double Ended Queues, Evaluation of Expressions, Linear Search and Binary Search
DATA STRUCTURE
It is a representation of logical relationship between individual elements of data. It is also defined
as a mathematical model of particular organization of data items. It is also called building block
of a program.
Classification of data structure
1. Linear data structure
● All the elements form a sequence or maintain a linear ordering.
2. Non linear data structure
● Elements are distributed over a plane.
,1. POLYNOMIAL REPRESENTATION USING ARRAYS
● A polynomial is a sum of terms where each term has the form axe ,
Where x is the variable, a is the coefficient and e is the exponent.
Polynomial representation using Arrays
,Polynomial Addition Example
, S
teps of Polynomial Addition
