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
Data represents a single value or a set of values assigned to entities. Data item refers a single or group of values with in the data
An entity is a thing that has some properties which can take values. Processed or meaning full data is called information. This is used for taking some action.These Datastructures do not allow any specific instructions to be performed on the Data items directly.
When working with certain data structures you need to know how to insert new data, search for a specified item, and deleting a specific item.
Commonly used algorithms include are useful for: Searching for a particular data item (or record). Sorting the data. There are many ways to sort data. Simple sorting, Advanced sortingIterating through all the items in a data structure. (Visiting each item in turn so as to display it or perform some other action on these items)