FUNDAMENTALS OF DATA STRUCTURES AND ALGORITHMS

PRESENTATION

Data Structures and Algorithms

Start

Index

Data Structures

Abstract data type

Types of data structure

Data structure

Benefits of ADT

Abstarct data type

Parts of ADT

Algorithm

Characteristics

Algorithm

Elements

Design paradigms

Fundamentals of Data Structures and Algorithms

Data Structures

DATA STRUCTURES

A data structure is a special format for storing and organizing data.

Two (2) types of data structure

Non-Linear

Linear

Elements are accessed in a sequential order but may be stored unsystematically.

Elements are stored and accessed in a non-sequential order.

abstract data type (ADT)

• An abstract data type (ADT) is a logical description of how data is viewed as well as the operations that are allowed without regard to how they will be implemented.

Benefits of using ADT

Code is easier to understand.

ADTs can be used in future programs.

Implementations of ADTs can be changed without requiring changes to the program that uses the ADTs.

Two (2) parts of ADT

Private or internal

Public or external

– The data and the operations

- The representation and the implementation

Abstract data types

Linked list - is used for storing elements where each isa separate object

Tree - represents a hierarchical nature of a structure in agraphical form.

Stack - is an ordered list in which insertion and deletionare done at one (1) end

Queue - is an ordered list in which insertion and deletionare done at separate ends

Priority queue - is used for retrieving and removingeither the minimum or maximum element

Abstract data types

Heap - is a partially sorted binary tree.

Set - represents a collection of elements that do not haveto be in order

Map - is a set of ordered pairs with elements known askey and value

Graph - consists of a set of points/nodes (vertices) andset of links (edges) which

The four (4) main operations that could be defined for eachADT are initializing, adding, accessing, and removing of data.

Algorithm

Algorithm

An algorithm is a step-by-step set of instructions to beexecuted in sequence for solving a problem.

Characteristic of Algorithm

Finiteness: An algorithm must terminate after aspecified number of steps.

Definiteness: Each instruction has to be clear andunambiguous.

Input: An algorithm should have zero or more well-defined data given before the algorithm begins.

Output: An algorithm must have one (1) or moreresults, with specified relation to the input.

Uniqueness: The result of each step depends on theinput and/or the result of the previous step.

 Elements of an algorithm:

Recursion – when a function calls itself once ormultiple times to solve a problem

Iteration – repeating an action multiple times

Sequential operations

Actions based on the state of a data structure

Algorithm design paradigms

Dynamic Programming

Greedy Algorithms

Divide and Conquer

similar to divide andconquer except that the results of the subproblems arereused for overlapping subproblem

– breaking a problem into smaller subproblems

always chooses the optimalapproach in solving a problem

Group 2

Illeana bacus

NIkko casaba

Jonathan damayo

Angeline maala

jOJOR SITOHANG

irene eulin

jerome dela cruz

Aira awing

JULIAN INTILA

eugene dulanas

Ryan Cristi

Mark edcel hipol

lestat alcomendras

THANKS!