lec02-perf analysis

# lec02-perf analysis - PerformanceAnalysis SangYongHan...

This preview shows pages 1–11. Sign up to view the full content.

Performance Analysis                 Sang Yong Han            http://ec.cse.cau.ac.kr/ 1 Chung-Ang University Spring 2011

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Assignment  1. q ª * ( ‚q ·ª ) 2. Data  Structure  ( —• * and/or  h W• * ¬§ = 1. Due Date : 3/14 (Monday, White Day)  2 q (10:00 am)  1. Due date ( 7 @ @ . 2 Chung-Ang University Spring 2011
Tentative  Class Schedule  1. Week 1 – course introduction 2. Week 2 – Performance Analysis  1. Week 3 – Array and Stack  1. Week 4 – Stack  2. Week 5 – Queue  3. Week 6 – Linked List  4. Week 7  -  Review  5. Midterm 3 Chung-Ang University Spring 2011

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Tentative  Class Schedule (Cont.) 1. Week 9 – Tree (binary tree, etc) 2. Week 10 – Tree (Heap, etc)   1. Week 11 – Graph (ADT, etc)   1. Week 12 – Graph (BFS, DFS, etc)   2. Week 13 – Graph 3. Week 14 – Graph   4. Week 15  -  Review  5. Week 16 -   Final Exam  4 Chung-Ang University Spring 2011
Problem Solving: Main Steps 1. Problem definition 2. Algorithm design / Algorithm specification 3. Algorithm analysis 4. Implementation 5. Testing 6. [Maintenance] 5 Chung-Ang University Spring 2011

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
1. Problem Definition What is the task to be accomplished? Calculate the average of the grades for a given  student Understand the talks given out by politicians and  translate them in Chinese What are the time / space / performance  requirements ? 6 Chung-Ang University Spring 2011
2. Algorithm Design /  Specifications Algorithm : Finite set of instructions that, if followed,  accomplishes a particular task. Describe: in natural language / pseudo-code /  diagrams / etc.  Criteria to follow: Input: Zero or more quantities (externally produced) Output: One or more quantities  Definiteness: Clarity, precision of each instruction Finiteness: The algorithm has to stop after a finite (may be  very large) number of steps Effectiveness: Each instruction has to be basic enough and  feasible 7 Chung-Ang University Spring 2011

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
4,5,6: Implementation, Testing,  Maintainance Implementation Decide on the programming language to use • C, C++, Lisp, Java, Perl, Prolog, assembly, etc. , etc. Write clean, well documented code  Test, test, test Integrate feedback from users, fix bugs, ensure  compatibility across different versions   Maintenance 8 Chung-Ang University Spring 2011
3. Algorithm Analysis Space complexity How much space is required Time complexity How much time does it take to run the algorithm Often, we deal with estimates! 9 Chung-Ang University Spring 2011

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Space Complexity Space complexity = The amount of memory required  by an algorithm to run to completion Some algorithms may be more efficient if data  completely loaded into memory  Need to look also at system limitations E.g. Classify 2GB of text in various categories [politics,
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 04/13/2011 for the course DATA STRUC 101 taught by Professor Hansanyong during the Spring '11 term at 한동대학교.

### Page1 / 64

lec02-perf analysis - PerformanceAnalysis SangYongHan...

This preview shows document pages 1 - 11. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online