1 / 5

Analysis and Design of Algorithms

Analysis and Design of Algorithms. An algorithm is a method of solving problem (on a computer) Problem example: given a set of points on the plane find the closest pair Algorithm: find distance between all pairs Can we do it faster?. Combinatorial Problems. Closest pair

howell
Download Presentation

Analysis and Design of Algorithms

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Analysis and Design of Algorithms • An algorithm is a method of solving problem (on a computer) • Problem example: • given a set of points on the plane • find the closest pair • Algorithm: • find distance between all pairs • Can we do it faster?

  2. Combinatorial Problems • Closest pair • O(n^2) algorithm • Give O(nlog(n)) algorithm • TSP • O(n!) algorithm • too slow • difficult problem • MST • O(n^2) data structure Binary Heap -> O(nlog(n))

  3. Course Overview • General algorithmic methods • divide and conquer, greedy algorithms, dynamic programming • Data structures • hashing, priority queues, binary search trees, binomial heaps • Combinatorial problems • MST, TSP, Vertex/Set Cover, Matrix • Computational Complexity • NP-completeness, reducibility, approximation • Cormen-Leiserson-Rivest Introduction to Algorithms

  4. Grading • Home work • problems from the book 20% • two programming assignments 20% • extra credit problems 1p = +1% • 4520/6520 Midterm 30% • 4520 Final / 6520 Project 30%

  5. Home Work • Problem sets • weekly • handed in/out Tuesdays (usually) • Questions on Thursday • Extra-credit problems! • Due next Tuesday • 1.2-2 p.13 • 1.2-2 p.13

More Related