This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full 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 languagelike 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.
 Fall '08
 Kraft,D

Click to edit the document details