Algorithm Design Presentation
-
Upload
kawsar-ahmed -
Category
Education
-
view
198 -
download
0
description
Transcript of Algorithm Design Presentation
![Page 1: Algorithm Design Presentation](https://reader035.fdocuments.us/reader035/viewer/2022062320/559b7ec61a28abfe758b4656/html5/thumbnails/1.jpg)
Algorithm Design
Presented by :
1. Sumaiya Afrin Tusha 2.Methila BiswasRaya
3. Mahin Sharmin 4. Lamyea AkhterNowrin
![Page 2: Algorithm Design Presentation](https://reader035.fdocuments.us/reader035/viewer/2022062320/559b7ec61a28abfe758b4656/html5/thumbnails/2.jpg)
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](https://reader035.fdocuments.us/reader035/viewer/2022062320/559b7ec61a28abfe758b4656/html5/thumbnails/3.jpg)
What is Algorithm ?
An algorithm (pronounced AL-go-rith-
um) is a procedure or formula for
solving a problem.
![Page 4: Algorithm Design Presentation](https://reader035.fdocuments.us/reader035/viewer/2022062320/559b7ec61a28abfe758b4656/html5/thumbnails/4.jpg)
What is Algorithm Design ?
It is a specific method to create a
mathematical process in solving
problems .
![Page 5: Algorithm Design Presentation](https://reader035.fdocuments.us/reader035/viewer/2022062320/559b7ec61a28abfe758b4656/html5/thumbnails/5.jpg)
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](https://reader035.fdocuments.us/reader035/viewer/2022062320/559b7ec61a28abfe758b4656/html5/thumbnails/6.jpg)
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](https://reader035.fdocuments.us/reader035/viewer/2022062320/559b7ec61a28abfe758b4656/html5/thumbnails/7.jpg)
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](https://reader035.fdocuments.us/reader035/viewer/2022062320/559b7ec61a28abfe758b4656/html5/thumbnails/8.jpg)
Basic Elements of Dynamic
Programming
1. Substructure
2. Table-Structure
3. Bottom-up Computation
![Page 9: Algorithm Design Presentation](https://reader035.fdocuments.us/reader035/viewer/2022062320/559b7ec61a28abfe758b4656/html5/thumbnails/9.jpg)
Graph Algorithm
A graph algorithm is an algorithm that
takes more graph as input .
![Page 10: Algorithm Design Presentation](https://reader035.fdocuments.us/reader035/viewer/2022062320/559b7ec61a28abfe758b4656/html5/thumbnails/10.jpg)
Types of Graph algorithm
Directed graph
Undirected graph
![Page 11: Algorithm Design Presentation](https://reader035.fdocuments.us/reader035/viewer/2022062320/559b7ec61a28abfe758b4656/html5/thumbnails/11.jpg)
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](https://reader035.fdocuments.us/reader035/viewer/2022062320/559b7ec61a28abfe758b4656/html5/thumbnails/12.jpg)
Unsorted sequence
Sorted sequence
![Page 13: Algorithm Design Presentation](https://reader035.fdocuments.us/reader035/viewer/2022062320/559b7ec61a28abfe758b4656/html5/thumbnails/13.jpg)
Back Tracking
Backtracking is a general algorithm
for finding all (or some) solutions to
some computational problem.
![Page 14: Algorithm Design Presentation](https://reader035.fdocuments.us/reader035/viewer/2022062320/559b7ec61a28abfe758b4656/html5/thumbnails/14.jpg)
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](https://reader035.fdocuments.us/reader035/viewer/2022062320/559b7ec61a28abfe758b4656/html5/thumbnails/15.jpg)
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](https://reader035.fdocuments.us/reader035/viewer/2022062320/559b7ec61a28abfe758b4656/html5/thumbnails/16.jpg)
![Page 17: Algorithm Design Presentation](https://reader035.fdocuments.us/reader035/viewer/2022062320/559b7ec61a28abfe758b4656/html5/thumbnails/17.jpg)
Advantages of designing
Algorithm Ease of use
Performance
Scalability
Stability
![Page 18: Algorithm Design Presentation](https://reader035.fdocuments.us/reader035/viewer/2022062320/559b7ec61a28abfe758b4656/html5/thumbnails/18.jpg)
Thank You