1) Introduction Need ADT
1) Introduction Need ADT
Unit No. 1
Introduction to Data structure
2. Information :-
When data is process it becomes information
3. Data Elements
Data elements are data items are basic types of data.
This data elements are arranged in different ways depending on logical
relationship between them
Definition of Data structure
? Data Structure is a way of arranging data elements along with the logical
relationship between them.
? Data Structure consists of objects, their properties and set of legal operations
which may be applied to the elements of data objects.
? A Data structure is a set of Domains “D”, Set of Functions “F”, and Set of
Axiom “A”
? .’. The set of (D, F, A) denotes the data structure
? D -: denotes the data objects
? F :- denotes the set of operations that can be applied on data objects
? A :- denotes the properties and rules of operation
Need of Data structure
1. To identify a solution for data processing problem we need data structure.
2. In modern days computing problems are large and complex to reduce these
problems we need data structure
5. If data is large in size then searching operations become complex to handle the
situation we need to organise the data by using data structure.
1. Correctness
Data Structure implementation should perform its operations correctly
2. Time Complexity
Running time or execution time of operations of data structure must be as
small as possible
3. Space Complexity
Memory usage of data structure should be as small as possible.
Advantages of Data Structure
1. Structured data is easier to access and manipulate as compared to
unstructured data.
? 1. Abstraction-:
? ADT hides implementation details
? 2. Encapsulation
? Data object, operations and rules are grouped into single logical unit.
? 3. Generalization
? ADT is a general specification of data structure
? 4. Reliability
? ADT hides the details so our actual logic is available to developers only
Example of ADT