# Design and Analysis of Algorithms - PowerPoint PPT Presentation

PPT – Design and Analysis of Algorithms PowerPoint presentation | free to download - id: 6a8182-YjU1N

The Adobe Flash plugin is needed to view this content

Get the plugin now

View by Category
Title:

## Design and Analysis of Algorithms

Description:

### Design and Analysis of Algorithms E-mail: cytang_at_cs.nthu.edu.tw http://algorithm.cs.nthu.edu.tw/~course/ * Algorithm ? – PowerPoint PPT presentation

Number of Views:43
Avg rating:3.0/5.0
Slides: 15
Provided by: CHOIP
Category:
Tags:
Transcript and Presenter's Notes

Title: Design and Analysis of Algorithms

1
?????????
• Design and Analysis of Algorithms
• ???
• E-mail cytang_at_cs.nthu.edu.tw
• http//algorithm.cs.nthu.edu.tw/course/

2
??? Algorithm ?
• A number of rules, which are to be followed in a
prescribed order, for solving a specific type of
problems.
• Computer Algorithm?????
• Finiteness(???steps)
• Definiteness(???step?????)
• Effectiveness(?????????????)
• Input/Output(O.S.??terminate???? computational
procedure)

3
Algorithm is everywhere !
• Operating Systems
• System Programming
• Numerical Applications
• Non-numerical Applications
• ???field???Algorithm????field ???????
• Algorithm Implement???
• Software
• Hardware
• Firmware

4
• ??? Introduction to the Design and Analysis of
Algorithms A STRATEGIC APPROACH(???)
• ???
• 1. Cormen, Leiserson, Rivest Introduction to
Algorithms(??)
• 2. Horowitz and Sahni Fundamentals of Computer
• 3. Brassard Bratley Algorithmics(??)

5
????
• ?? 30
• ?? x 270 (3040)
• ??????10
• (????)
• ???????
• ?????????????? -__-

6
??
• ??????4???,????????7.5,??????????30
• ???????????,???(???)???????
• ?????????????,??????????,??????????
• ?????????
• 3/23(?)?4/15(?)?5/18(?)?6/10(?)

7
??
• ??????????,????????
• ?????????????????,?????????
• ??????????????,???????
• ???????(??)
• 4/27(?)?6/22(?)

8
??????
• Office hour Thu 13101500
• Place ????5F 5-12
• ?????????,??????????
• ????(http//algorithm.cs.nthu.edu.tw/course/),???
???????????

9
Background for learning
• 1. ???????
• 2. Data Structures
• 3. Discrete Mathematics
• 4. ??
• Requirements for researching
• 1. ??papers
• 2. ???????
• 3. ?????????
• ?????

10
?????Algorithm ?
• 1. ????,?????????(Time, Space)?Algorithm ?????
• Life-time Job
• ????????????Algorithm???
• ?????????????paper,update???algorithms??????? ???

11
?????Algorithm ?
• 2. ????,?????NP-Complete?????efficient??
• Life-time Job
• ????????NP-Complete?
• Real Application
• Average Performance??
• ?Approximating??
• TSP
• n 20 771??
• N3log n in average (B B)
• Planar Graph Coloring (Maximum 4 ????)

12
Outline
• 1. Introduction
• 2. Lower Bounds (Complexity)
• 3. NP-Completeness
• 4. Greedy Method
• 5. Divide--Conquer Strategy
• 6. Prune--Search Strategy
• 7. Dynamic Programming Strategy
• 8. Branch--Bound Strategy
• 9. Approximate Algorithms
• 10. Randomized Algorithms
• 11. Amortized Analysis
• 12. On-line Algorithms

13
One can find good papers on algorithms
• Acta Informatica
• Algorithmica
• Annual Symposium on Foundations of Computer
Science
• BIT
• Communications of the ACM
• Computer Journal
• IEEE Transactions on Computers
• Information and Control
• Information Processing Letters
• Information Science

14
One can find good papers on algorithms (Cont.)
• International Journal of Computer and System
Science
• International Journal of Computer Mathematics
• Journal of Algorithms
• Journal of Parallel and Distributed Computing
• Journal of the ACM
• Networks
• Parallel Computing
• SIAM Journal on Computing
• Theoretical Computer Science
• International Journal of Parallel Programming