1

Welcome To Our Presentation

2

Algorithm DesignAlgorithm Design

Presented by :Name ID1.Sakib Hossain 142-15-37502.Md.Mahfuzul Haque 142-15-37473.Md.Ashiquzzaman Khondaker 142-15-

37064.Md.Masiur Rahman 142-15-

41025.Samia Rahaman 142-15-

3676

3

Algorithm Design

What is Algorithm ? What is Algorithm Design ? Importance of Algorithm Design How to Design an Algorithm ? Advantages of designing an

Algorithm

4

What is Algorithm ?

An algorithm (pronounced AL-go-rith-um) is a procedure or formula for solving a problem.

5

What is Algorithm Design ?

It is a specific method to create a mathematical process in solving problems .

6

Importance of Algorithm Design It 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 .

7

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

8

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."

 

9

Basic Elements of Dynamic Programming

1. Substructure2. Table-Structure3. Bottom-up Computation

10

Graph Algorithm

A graph algorithm is an algorithm that takes more graph as input .

11

Types of Graph algorithm Directed graph

Undirected graph

12

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 these3. Appropriately combining their answers

13

Unsorted sequence

Sorted sequence

14

Back Tracking

Backtracking is a general algorithm for finding all (or some) solutions to some computational problem.

15

Greedy Algorithm

Components of greedy algorithm Candidate Set Selection Function Feasibility Function Objective Function Solution Function

16

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.

17

18

Advantages of designing Algorithm Ease of use Performance Scalability Stability

19

Do You Have Any Questions?

20

Thank You

21