Scribd
Upload
70 views17 pages

Data Strucure-Intoduction

The document introduces data structures and their classification. It defines data as numeric or alphanumeric values that can be single or sets. Structure refers to the organization and storage of data. A data structure represents the logical relationship between data elements and is a way of storing and organizing data for efficient use. Data structures are classified as primitive like integers and floats, and non-primitive like arrays, lists, trees and graphs. Non-primitive structures are more sophisticated and derived from primitive types. Data structures also differ based on whether elements are the same type (homogeneous) or different types (heterogeneous), whether memory is static or dynamic, and whether the relationship between elements is linear or non-linear. Basic operations on data structures include create, delete,

Uploaded by

Bhishma Brahmbhatt
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
70 views17 pages

Data Strucure-Intoduction

The document introduces data structures and their classification. It defines data as numeric or alphanumeric values that can be single or sets. Structure refers to the organization and storage of data. A data structure represents the logical relationship between data elements and is a way of storing and organizing data for efficient use. Data structures are classified as primitive like integers and floats, and non-primitive like arrays, lists, trees and graphs. Non-primitive structures are more sophisticated and derived from primitive types. Data structures also differ based on whether elements are the same type (homogeneous) or different types (heterogeneous), whether memory is static or dynamic, and whether the relationship between elements is linear or non-linear. Basic operations on data structures include create, delete,

Uploaded by

Bhishma Brahmbhatt
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 17

Introduction to

Data Structure

December 8, 2021 Data Structures and Algorithm 1


What do u mean by data?
It is the basic fact or entity that is utilized
in calculation or manipulation.
Data is either numeric or alphanumeric.
Data may be a single value or may be a
set of values.

December 8, 2021 Data Structures and Algorithm 2


What do u mean by Structure
Formation of data.
Organization of data.
Management of data.
Storage of data in particular fashion.

December 8, 2021 Data Structures and Algorithm 3


Data Structure
 It is a representation of the logical
relationship existing between individual
elements of data.
 A data structure is an arrangement of
data in a computer's memory or
even disk storage.
 A data structure is a particular way of
storing and organizing data in a
computer so that it can be used
efficiently.
December 8, 2021 Data Structures and Algorithm 4
Continue
 Is a way of organizing all data items that
considers not only the elements stored
but also their relationship to each other.
 Is a building blocks of a program.
 An example of several common data
structures are arrays, linked lists, queues,
stacks, binary trees, and hash tables.

December 8, 2021 Data Structures and Algorithm 5


 Data structure is mainly specifies the
four things:

 Organizing of data
 Accessing methods
 Degree of associativity
 Processing alternatives for information

December 8, 2021 Data Structures and Algorithm 6


Algorithm
It is a step by step procedure to solve a
particular function.
It is a set of instructions written to carry
out certain tasks.

December 8, 2021 Data Structures and Algorithm 7


Program= algorithm + data structure

December 8, 2021 Data Structures and Algorithm 8


Classification of Data Structures
Data
Structures

Primitive Non-Primitive

Integer Character Arrays Lists Files

Float Pointer
Linear Non-Linear

Stacks Queues Trees Graphs

December 8, 2021 Data Structures and Algorithm 9


Classification of Data Structure
Primitive
Integer, Float, Pointer, Character.
Non-primitive
 Array
 List
 Linear
Stack ,Queue, Linked list
 Non-linear
Tree and Graph
 Files
December 8, 2021 Data Structures and Algorithm 10
Primitive data structure
These are the basic data structure.
It is directly operated on the machine
instructions.
It has different representations on
different machines.
Integer, Character are the examples of
primitive data structures.

December 8, 2021 Data Structures and Algorithm 11


Non-primitive data structure
These are more sophisticated data
structure.
Abstract data structures that are derived
from primitive data structure.
Emphasize of structuring of group of
same data type of different data type.
Structure, Union, Array are the examples
of Non primitive data structures.

December 8, 2021 Data Structures and Algorithm 12


Homogeneous Data Structures
In a data structure if all the elements are of
same data type, it is called homogeneous
data structure.
For example, an array can contains all the
data elements of same type only, so it is a
homogeneous data structure.

December 8, 2021 Data Structures and Algorithm 13


Heterogeneous Data Structures
A heterogeneous data structure is the one
which can contain data elements of
different types.
For example a record can contain
different fields each of different types.
Similarly a Structure can contain its
elements of different types. Thus, record,
structure are heterogeneous data structure.

December 8, 2021 Data Structures and Algorithm 14


Static / Dynamic Data Structures
A data structure is classified as static or dynamic
considering when the memory is allocated to it.
If memory is allocated to the data structure when
compiling (design time allocation), it is known
as static data structure. Ex. Arrays
On the other hand, if memory for a data structure
is allocated at run time (through functions such
as malloc, calloc, etc.) – run time allocation– it is
 
called dynamic data structure. Ex.Linked List

 
December 8, 2021 Data Structures and Algorithm 15
Linear / non linear Data Structures.
A data structure that maintains a linear
relationship between its elements, it is called
linear data structure. For example, an array
holds the linear relationship between its
elements, it is linear data structure.
 In case of non-linear data structure, they do not
maintain any linear relationship between their
elements. Consider a tree structure. You can’t
define linear relationship between the elements.
It is an example of non-linear data structure.

December 8, 2021 Data Structures and Algorithm 16


Basic operations of DS
CREATE
DELETE or DESTROY
SELECTION
UPDATION

December 8, 2021 Data Structures and Algorithm 17

You might also like