Data Structure and Algorithm 4330704

Unit 1: Basics Concepts of Data Structures

 Introduction of Data Structures
 Data Structure: Data structure is a way to storing and
organizing data in a computer so that it can be used
efficiently.
 Data Structure is used in almost all program and software
system.
 Data Structure usually consist of two things:
 The type of structure that we are going to use
store the data.
 How efficiently we perform operations onto
that data stored in structure so we can reduce
execution time and amount of memory space.
 Data: Data is a c o l l e c t i o n o f raw facts (or
i n f o r m a t i o n ) and it may or may not be
meaningful.
 Information: - meaningful data is know as information.
 Types of Data structure
 Primitive data structure
 Integer
 Float
 Character
 Logical
 Pointer
 Linear
 Non-primitive data structure
1 | Page
Data Structure and Algorithm 4330704

 Linear
 Array
 Stack
 Queue
 Linked list
 Non-linear
 Trees
 Graphs

 Primitive Data structure

 The data structures that are directly processed by machine
using its instruction are know as primitive data structure.
 Following are the primitive data structure:

2 | Page