DA02 - Exactly unsolvable problem or slow exact algorithm....

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon
B.B. Karki, LSU 2.1 CSC 3102 Fundamentals of Algorithmic Problem Solving
Background image of page 1

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

View Full DocumentRight Arrow Icon
B.B. Karki, LSU 2.2 CSC 3102 Algorithmic Design and Analysis Process One should go through a sequence of interrelated actions (steps) in designing and analyzing an algorithm A creative activity A good algorithm is usually a result of repeated efforts and rework Understand the problem Prove correctness Analyze the algorithm Code the algorithm Design an algorithm Decide on: computational devices; exact vs approx. solving; data structure; algorithm design technique
Background image of page 2
B.B. Karki, LSU 2.3 CSC 3102 Sequence of Steps Understand completely the problem: Do some examples by hand, think about special cases, ask questions if needed. May be you can use a known algorithm for solving it. Ascertaining the capabilities of a computational device: Sequential (serial) algorithms versus parallel algorithms. Choosing between exact and approximate problem solving:
Background image of page 3

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

View Full DocumentRight Arrow Icon
Background image of page 4
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Exactly unsolvable problem or slow exact algorithm. Deciding on appropriate data structures: Structuring or restructuring data specifying a problems instance is important. B.B. Karki, LSU 2.4 CSC 3102 Sequence of Steps (Contd.) Algorithm design techniques: Select a general approach to solving problem algorithmically. Methods of specifying an algorithm: Pseudocode is a mixture of a natural language and a programming language-like constructs. Providing an algorithms correctness: Use mathematic induction considering selected inputs. Analyzing an algorithm: Time and space efficiencies; and simplicity and generality Coding an algorithm: Implement it as computer program with test and debugging for its validation....
View Full Document

This note was uploaded on 10/06/2009 for the course CSC 3102 taught by Professor Kraft,d during the Fall '08 term at LSU.

Page1 / 4

DA02 - Exactly unsolvable problem or slow exact algorithm....

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online