INTRODUCTION

AND IMPORTANCE OF DATA

STRUCTURE AND ALGORITHMS

PREPARED BY:-
Abiral Joshi &
Binayak Kattel
Introduction to Data Structure and
Algorithms
• A data structure is a particular way of
organizing data in a computer so that it can be
used effectively.
• For example, we can store a list of items having
the same data-type using the array data structure.
• An algorithm is defined as a step-by-step
procedure or method for solving a problem by a
computer in a finite number of steps. Steps of
an algorithm definition may include branching
or repetition depending upon what problem
the algorithm is being developed for.
Types of Data Structures
• Primitive Data Structures
• Non-primitive Structures
Primitive Data Structures
Primitive Data Structures are the basic data
structures that directly operate upon the machine
instructions.
hey have different representations on different
computers.

Integers, Floating point numbers, Character

constants, String constants and Pointers come under
this category.
Non-primitive Data Structures
• Non-primitive data structures are more
complicated data structures and are derived
from primitive data structures.

• They emphasize on grouping same or different

data items with relationship between each data
item.
Arrays, Lists and Files come under this category.
Properties of Algorithm
• 1) Input
There are more quantities that are extremely supplied.
• 2) Output
At least one quantity is produced.
• 3) Definiteness
Each instruction of the algorithm should be clear and
unambiguous.
• 4) Finiteness
The process should be terminated after a finite number of steps.
• 5) Effectiveness
Every instruction must be basic enough to be carried out
theoretically or by using paper and pencil.
Why do we need data structure?