INTRODUCTION
TO DATA
STRUCTURES
Presented By: Mr. Kiran K. Awale
DATA, INFORMATION AND
KNOWLEDGE
Data:
Raw facts and figures
Information:
Data that has been processed (in a context) to
give it meaning
Knowledge:
Knowledge is the understanding of rules
needed to interpret information
DATA, INFORMATION AND
KNOWLEDGE (CONT..)
Information = Data + Context + Meaning
Processing
DATA STRUCTURE
DATA: is simply a value or set of values of
different type (which is called data types
like string, integer, char etc.)
STRUCTURE: Way of organizing information,
so that it is easier to use
Particular way of organizing
data in a computer’s memory
DATA so that it can be used
STRUCTUR efficiently.
A data structure is specialized
E format for organizing and
storing data.
WHAT DOES ORGANIZING THE DATA
MEAN?
It means that the data should be arranged in
a way that it is easily accessible.
Suppose the data contains some numbers and
the programmer wants to calculate the average,
standard deviation etc.
May be we have a list of names and want to
search a particular name in it.
To solve such problems, data structures and
algorithm are used.
WHY DATA STRUCTURE ???
Human requirement with computer are going
to complex day by day. To solve the complex
requirements in efficient way we need the
organized approach.
Provide fastest solution of human
requirements.
Provide efficient solution of complex problem.
Space
Time
WHAT DOSE STUDY OF DATA
STRUCTURES INVOLVE???
1. Logical or mathematical description of
the structure.
2. Implementation of structure on a
computer using different computer
languages (C)
3. Quantitative analysis of the structure,
which includes determining the amount
of memory needed to store the structure
and the time required to process the
structure.
CLASSIFICATION OF DATA
STRUCTURE
CLASSIFICATION OF DATA
STRUCTURE (CONT...)
LINEAR DATA STRUCTURE: A data structure is
linear if every item is related (or attached) to
its pervious and next item (e.g Array, Linked
list)
NON-LINEAR DATA STRUCTURE: A data structure
is non-linear if every item is attached to many
other items in specific ways to reflect
relationships (e.g Trees)
A MORE GENERIC
CLASSIFICATION
A MORE GENERIC
CLASSIFICATION (CONT…)
PRIMITIVE DATA STRUCTURE: A primitive
data structure used to represent the
standard data types of any one of the
computer languages (integer, Character,
float etc.).
NON-PRIMITIVE DATA STRUCTURE: A
Non Primitive Data Structure can be
constructed with the help of any one of the
primitive data structure and it is having a
specific functionality. It can be designed by
user.
DATA STRUCTURE
OPERATIONS
The major operations performed on every
data structure are:
1. Inserting
2. Deleting
3. Traversing
4. Searching
Possible additional operation:
Sorting
Merging
DATA STRUCTURE
OPERATIONS (CONT...)
1. INSERTING: Adding new records to the
structure.
2. DELETING: Removing a record from the
structure.
3. TRAVERSING: Accessing each record exactly
once so that certain items in the record may be
processed.
4. SEARCHING: Finding the location of the record
or finding the location of all records, which
satisfy one or more conditions.
DATA STRUCTURE
OPERATIONS (CONT...)
Additional Operation:
SORTING: Arranging the records in some
logical orders.
MERGING: Combining the records in two
different sorted files into a single file.
SELECTING A DATA
STRUCTURE
First of all, we have to analyze the
problem to determine the resources
constraints that a solution must meet.
Secondly, it is necessary to determine
the basic operations that must be
supported. Quantify the resources
constraints for each operations.
Finally, select the data structure that
meets these requirements the
maximum.
THANK YOU…
