Data Structure

2. A presentation on
Introduction and Overview

3. Presented by
 Md Ishtiakur Rahman 24014
 Shahidujjaman Leon 25011
 Marjana Akter Hamna 26019
Presented to
Rajarshee Roy Chakrobarty
Lecturer of CSE Dept.
Sylhet International University

4. Synopsis
1. Data Organization
2. Entity
3. Data Structure
4. Classification of data structure
5. Array
6. Classification of array
7. Trees
8. Stack
9. Queue
10. Data structure operation
Introduction and Overview

5. Data Organization
Collection of data are frequently organized into a hierarchy of fields, records
and files.
Fields: A fields is a single elementary unit of information representing of an
entity
Records: It’s a collection of fields values of a given entity
File: A collection of records of the entities in a given entity set.
Introduction and Overview

6. Entity: An entity is something that has certain attributes or properties which may be assigned
values.
Attributes Name age Sex Student id no.
Values Mr. Ishtiak 21 M 131101014
Data Structure : Data may be organized in different ways; the logical or mathematical model of a
particular organization of data is called a data structure.
Introduction and Overview

7. Classification of data structure:
Data Structure
Primitive data structure Non Primitive data structure
Integer Real character Boolean
Linear data structure
Non linear data
structure
Array
Link list
Stack
Queues
Tree Graph
Introduction and Overview

8. Array: An array is used to store a collection of data a fixed size sequential
collection of elements of the same type.
Ex: int array[5];
Two types of Array
1. Linear array
2. Non linear array
Introduction and Overview

9. Multi dimensional array/Non linear array:
One dimensional array/Linear array:
Golok
Shopnil
Ishtiak
Sujon
Saju
0
1
2
3
4
0
1
2
100 200 300
400 500 600
700 800 900
0 1 2
Introduction and Overview

10. Trees: The data structure which reflects this relationship a called a tree.
Employee
Sec. no. Name Address Age Salary
Last first MI
Street Area
City State ZIP
Introduction and Overview

11. Stack
 Stack: A stack also called a last-in first out (LIFO) system, is a linear list in which
insertions and deletions can take place only at one end, called the top.
 Example of stack is like a dishes.
Introduction and Overview

12. Queue
 Queue: A queue also called a first- in first- out (FIFO) system, is a linear list
in which deletions can take place only at one end of the list, the “front” of the
list, and insertions can take place only at the other end of the list , the rear of
the list.
 Example: waiting for a bus stop.
Introduction and Overview

13. An example of Queue:


 Queues waiting for a bus
Bus Stop
Introduction and Overview

14. Data Structure Operations:
 1) Traversing: Accessing each record exactly once so that certain items in the record may be
processed.
 2) Searching: Finding the location of the record with a given key value or finding the locations of all
records which satisfy one or more conditions.
 3) Inserting: Adding a new record to the structure.
 4) Deleting: Removing a record from the structure.
The following two operations, which are used in special situations.
 1) Sorting: Arranging the records in some logical order(e.g. alphabetically according to some NAME
key, or in numerical order according to some NUMBER key, such as social security number
or account number).
 2) Merging: Combining the records in two different sorted files into a single sorted file.
Introduction and Overview

15. END

16. Questi0n Please???