1. Program Development C# Programming January 30, 2007 Professor J. Sciame

2. Computer Aided Problem Solving Steps for Computer Aided Problem Solving: –Program Analysis and Specification –Algorithm Development –Program Coding –Program Execution and Testing –Program Maintenance

3. Program Analysis & Specification Determine: –Program Input –Program Output Specification = Input & Output Problems Encountered –Changing Values –Being too specific

4. Algorithm Development Algorithm = The formulation of a problem as a detailed sequence of simple steps. Algorithms are designed using three basic methods of control: –Sequential Control –Selection Control –Repetitive Control

5. Pseudocode Pseudocode is a mixture natural language and symbols, which include: –Mathematical Operators –Variable Names –Comments –Keywords –Indentation

6. Flowchart A graphical display of an algorithm. Uses: –Symbols –Flow lines Alternate - Top Down Design

7. Program Coding To express the algorithm in a programming language Concepts: –Syntax –Variables –Data Types Readability

8. Program Execution Write the program with the editor Include preprocessor codes Save and compile the program Link the program Load into memory Execute (Run)

9. Errors Syntax (or Compile Time) Run Time Logic

10. Program Maintenance Responsibilities: –Testing & Validation –Maintenance

11. Software Engineering The study of the use of the techniques used to solve problems Systems Analysts - Help in complex problems

12. Memory Concepts Variable names correspond to locations in memory All variables have: –a name –a type –a size –a value

13. Memory Concepts II The statement cin >> integer1 or x = a + b is called a destructive read-in. The statement cout << x is called a non- destructive read-out

14. Arithmetic Operators Addition + Subtraction - Multiplication * Division / Modulus %

15. Order of Operations Parentheses must be cleared. Exponentiation Multiplication or Division (left to right) Addition or Subtraction (left to right) In nested parentheses, the innermost parentheses are first, working out to the outermost set.

16. Equality and Relational Operators Equality –(x is equal to y) x = = y –(x is not equal to y) x != y Relational –(x is greater than y) x > y –(x is less than y) x < y –(x is greater than or equal to y) x > = y –(x is less than or equal to y) x < = y