1 / 7

Analysis of Algorithms

Analysis of Algorithms. Design & Analysis of Algorithms ?. D & A of Algorithms. CMSC 441 Section 0201 Design & Analysis of Algorithms. Instructor: Dr. Lomonaco. Grading Policy:. Course Grade = (25% Ex1)+(25% Ex2)+(25% Hwk)+ (25% Fin). There are no make-up exams !!!.

rigg
Download Presentation

Analysis 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 ofAlgorithms

  2. Design & Analysisof Algorithms ? D & A ofAlgorithms

  3. CMSC 441 Section 0201Design & Analysis of Algorithms Instructor: Dr. Lomonaco Grading Policy: Course Grade = (25% Ex1)+(25% Ex2)+(25% Hwk)+ (25% Fin) There are no make-up exams !!! Hwk Avg for wkly hwk =Lowest 1 (or 2) hwks dropped, and remaining hwks averaged Late homework will not be accepted !!! http://www.csee.umbc.edu/~lomonaco/

  4. The Big Picture The Software Challenge: Create even larger more efficient algorithms:Design & Analysis of Algorithms Create programs that meet design specs:Program Verification Create readable & understandable programs:Program Documentation Create platform independent programs:Portability

  5. The Big Picture To be and to stay competitive, we need learn to “think ahead of the curve” This means continually learning how to use more sophisticated approaches to the software challenge. High Level Mathematics High Level Physics Shudder !!! High Level Analytical Thinking Those who choose not to continue learning newmore sophisticated approaches to programmingwill quickly become obsolete, and be easily “Out Sourced !!!”

  6. ProblemInstance Solution Input Output AlgorithmA Course Objectives Our course objectives are to learn how to: Design efficient algorithms Analyze the efficiency of algorithms Consider an algorithm A for solving a problem P : How efficient is the algorithm ? What do we mean by efficiency ?

  7. Asymptotic Notation AsymptoticLower Bound Tight Asymptotic Bound AsymptoticUpper Bound Big-W Notation Big-QNotation Big-O Notation

More Related