Top Banner
Algorithm Design Presented by : 1. Sumaiya Afrin Tusha 2.Methila Biswas Raya 3. Mahin Sharmin 4. Lamyea Akhter Nowrin
18
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Page 1: Algorithm Design Presentation

Algorithm Design

Presented by :

1. Sumaiya Afrin Tusha 2.Methila BiswasRaya

3. Mahin Sharmin 4. Lamyea AkhterNowrin

Page 2: Algorithm Design Presentation

Algorithm Design

What is Algorithm ?

What is Algorithm Design ?

Importance of Algorithm Design

How to Design an Algorithm ?

Advantages of designing an Algorithm

Page 3: Algorithm Design Presentation

What is Algorithm ?

An algorithm (pronounced AL-go-rith-

um) is a procedure or formula for

solving a problem.

Page 4: Algorithm Design Presentation

What is Algorithm Design ?

It is a specific method to create a

mathematical process in solving

problems .

Page 5: Algorithm Design Presentation

Importance of Algorithm

DesignIt is important because it allows for

analysis on different ways to compute

things and ultimately come up with the

best way to solve a particular

problems .

Page 6: Algorithm Design Presentation

How to Design an Algorithm ?

For making a design of algorithm we need a technique of :

Dynamic programming

Graph algorithms

Divide and conquer

Back tracking

Greedy Algorithm

Flow chart

Page 7: Algorithm Design Presentation

Dynamic Programming

The dynamic programming is a

paradigm of algorithm design in which

an optimization problem is solved by a

combination of caching subproblem

solutions and appealing to the

"principle of optimality."

Page 8: Algorithm Design Presentation

Basic Elements of Dynamic

Programming

1. Substructure

2. Table-Structure

3. Bottom-up Computation

Page 9: Algorithm Design Presentation

Graph Algorithm

A graph algorithm is an algorithm that

takes more graph as input .

Page 10: Algorithm Design Presentation

Types of Graph algorithm

Directed graph

Undirected graph

Page 11: Algorithm Design Presentation

Divide and Conquer

The divide-and-conquer strategy

solves a Problem by :

1.Breaking it into subproblems that are

themselves smaller instances of the

same type of problem

2.Recursively solving these

3. Appropriately combining their

answers

Page 12: Algorithm Design Presentation

Unsorted sequence

Sorted sequence

Page 13: Algorithm Design Presentation

Back Tracking

Backtracking is a general algorithm

for finding all (or some) solutions to

some computational problem.

Page 14: Algorithm Design Presentation

Greedy Algorithm

1.What is greedy algorithm ?

2. Components of greedy algorithm Candidate Set

Selection Function

Feasibility Function

Objective Function

Solution Function

3.Drawback

Page 15: Algorithm Design Presentation

Flowchart

A flowchart is a type of diagram that

represents algorithm , workflow or

process, showing the steps as boxes

of various kinds, and their order by

connecting them with arrows.

Page 16: Algorithm Design Presentation
Page 17: Algorithm Design Presentation

Advantages of designing

Algorithm Ease of use

Performance

Scalability

Stability

Page 18: Algorithm Design Presentation

Thank You