# Data Structure and Algorithm

Embed code:

## Data Structure and Algorithm

Download Presentation - The PPT/PDF document "Data Structure and Algorithm" is the property of its rightful owner. Permission is granted to download and print the materials on this web site for personal, non-commercial use only, and to display it on your personal computer provided you do not modify the materials and that you retain all copyright notices contained in the materials. By downloading content from our website, you accept the terms of this agreement.

### Presentations text content in Data Structure and Algorithm

Slide1

Data Structure and Algorithm

Introduction

Slide2

Introduction

The manner in which computer program is being developed is not as simple as you may possibly think.

It comprises a lot of study, test, and recording to complete a first-rate outcome.

Sequence of steps are used to organized a large activities needed to build a program.

Slide3

Planning

Analysis

Design

(DSA)

Implementation

Evolution

Slide4

What is Data Structure?

It is an arrangement of data in a computer’s memory or disk storage space.

Example:

Arrays

Queues

Stacks

Binary trees

Slide5

Name

Relationship

Bhilly

Brother-in-Law

BJ

Nephew

Carmela

Myself

Celeste

Sister

Celine

Niece

Ianne

Niece

Imee

Sister-in-Law

Issah

Niece

Jhun

Brother-in-Law

JJ

Nephew

Joey

Brother

Jomar

Nephew

Jose

Father

Margarita

Mother

Mhillet

Sister

Rochie

Sister

Slide6

Celeste Jhun

Jose Margarita

Joey

Imee

Mhillet

Bhilly

Rochie

Carmela

Celine & BJ

JJ &

Jomar

Issah

&

Ianne

Slide7

Significance of DSA

The use of DSA is the essential working components used by programmers to store and manipulate data.

For programmers to easily understand on how they work and which algorithm or data structure is best fit for a particular condition were provided.

Slide8

Data Structure Taxonomy

Slide9

Linear VS Non-Linear

In linear there is a unique first and last element and every other element has a unique predecessor and unique successor, except for the first and last elements.

This type of data structure performs insert, delete, search, update operations sequentially or in order.

Non-Linear data structure performs traversing, Inserting, delete, search and update operation randomly.

Slide10

Sequential VS Direct

In Direct access, elements can be accessed at random, in any order. Any element can be accessed without accessing its predecessor or successor.

In Sequential access, elements must be accessed in some specified order. To access the nth element you must access the preceding n-1 elements.

Slide11

Homogeneous VS Heterogeneous

In homogeneous, all elements in the structure are

of same

data types.

In

heterogeneous

, all elements in the structure are of different data types.

Slide12

Slide13

Slide14

Slide15

Slide16

Slide17

Slide18

Slide19

Slide20

Slide21