Data structure is representation of the logical relationship existing between individual elements of data • In other words, a data structure is a way of
Basic concepts: Introduction to data structures, classification of data structures, operations on data structures, abstract data type, algorithms,
Figure 1 1shows the different classifications of data structures From the above definition, it is clear that the operations in data structure
CLASSIFICATION OF DATA STRUCTURES Data structures are generally The common examples of linear data structure are Arrays, Queues, Stacks, Linked lists
Definition ? Data structure is representation of the logical Classification of Data Structure ? Data structure are normally divided into two
The functional definition of a data structure is known as ADT (Abstract Data Type) which is independent of [Fig 1 1 Classification of Data Structures]
structure for that algorithm Therefore, algorithm and its associated data structures form a program • Classification of Data Structure:
Data, Entity and Information ? Primitive data types ? Non primitive data Types ? Data structure ? Definition ? Classification
We will typically use = in its mathematical meaning, unless it is written as part of code or pseudocode We say that the individual items a[i] in the array a
Definition Data Structure is a representation of the logical relationship existing Classification of Data Structure Data Structure Primitive Data Structure
1 1 shows the classification of data structures An array is an example of a contiguous structure example of a two-dimensional non-contiguous structure
Records may also be classified according to length A file can have The common examples of linear data structure are Arrays, Queues, Stacks, Linked lists 2
Data, Entity and Information ▫ Primitive data types ▫ Non primitive data Types ▫ Data structure ▫ Definition ▫ Classification ▫ Data structure operations