Need of Data Structure & Abstract Data Type
Download as PPTX, PDF2 likes34 views
Sanjivani K. B. P. Polytechnic, Kopargaon offers NBA accredited programs and is recognized by the Government of Maharashtra. The document discusses the importance of data structures in organizing, storing, retrieving, and manipulating data efficiently, highlighting the necessity for appropriate data types. It also covers the concept of Abstract Data Types (ADT), which encapsulate implementation details from the user, facilitating smoother data operations.
![Topics to be Covered
Need of Data Structure
Why Data Structure?
Abstract Data Type [ADT]
Sanjivani K. B. P. Polytechnic Kopargaon Department of Computer Technology Prof. Vaibhav A. Parjane 2](https://image.slidesharecdn.com/unit1second-240502083114-e7a64a72/85/Need-of-Data-Structure-Abstract-Data-Type-2-320.jpg)
![Abstract Data Type [ADT]
• Abstract data types (often written ADT for short) are data types
whose implementation details are hidden from user view for the
data structure.
• The abstract data type is special kind of datatype, whose behaviour
is defined by a set of values and set of operations.
Abstraction in case of Data:
1. Abstraction for primitive data type ( int, char, float) is provided by
the compiler.
2. Eg: we use integer type of data and perform various operations
on them without knowing -
1. Representation.
2. How various operations are performed on them.
Eg: int x , y , z; x = -13
Constant -13 is converted to 2’s complement and then stored in ‘x’ .
Representation is handled by the compiler.
x = y + z ; meaning of ‘+’ is defined by the compiler and its
implementation details remain hidden from the user.
5
Sanjivani K. B. P. Polytechnic Kopargaon Department of Computer Technology Prof. Vaibhav A. Parjane](https://image.slidesharecdn.com/unit1second-240502083114-e7a64a72/85/Need-of-Data-Structure-Abstract-Data-Type-5-320.jpg)
Need of Data Structure & Abstract Data Type
- 1. SANJIVANI K. B. P. POLYTECHNIC, KOPARGAON With NBA ACCREDIATED programs , Approved by AICTE, New Delhi, Recognized by Govt. of Maharashtra, Affiliated to Maharashtra State Board of Technical Education, Mumbai, ISO 9001:2015 Certified Institute Name of Faculty: Prof. Vaibhav A. Parjane 1
- 2. Topics to be Covered Need of Data Structure Why Data Structure? Abstract Data Type [ADT] Sanjivani K. B. P. Polytechnic Kopargaon Department of Computer Technology Prof. Vaibhav A. Parjane 2
- 3. Need of Data Structure Goal: To Organise data Criteria: To facilitate efficient Storage of data Retrieval of data Manipulation of data Design Issue: Select and design appropriate data types 3 Sanjivani K. B. P. Polytechnic Kopargaon Department of Computer Technology Prof. Vaibhav A. Parjane
- 4. Why Data Structure? 1. Data Search: If data is not organized then it will be very difficult to search an element each time, which will create a complexity. 2. Process Speed: Large data processing takes time, so if we know what to find and where to find make the process fast. 3. Multiple Request: As the database is used to store data and provide information as required by different users at the same time. So to handle these requests organization of data and request prioritization is required. 4. Efficiency: Data structure increases the efficiency by providing the data in the correct format and in a quicker way. 4 Sanjivani K. B. P. Polytechnic Kopargaon Department of Computer Technology Prof. Vaibhav A. Parjane
- 5. Abstract Data Type [ADT] • Abstract data types (often written ADT for short) are data types whose implementation details are hidden from user view for the data structure. • The abstract data type is special kind of datatype, whose behaviour is defined by a set of values and set of operations. Abstraction in case of Data: 1. Abstraction for primitive data type ( int, char, float) is provided by the compiler. 2. Eg: we use integer type of data and perform various operations on them without knowing - 1. Representation. 2. How various operations are performed on them. Eg: int x , y , z; x = -13 Constant -13 is converted to 2’s complement and then stored in ‘x’ . Representation is handled by the compiler. x = y + z ; meaning of ‘+’ is defined by the compiler and its implementation details remain hidden from the user. 5 Sanjivani K. B. P. Polytechnic Kopargaon Department of Computer Technology Prof. Vaibhav A. Parjane