Algorithm and Flowcharts Menu

1. Credits

2. Flowchart Intro & Method of Problem Solving

3. 5 Steps using computer as tool and Algorithm Definition

4. Basic and Additional Symbols

5. Examples of:
   • Simple Sequential

   • Selection/Branching structures

   • Repetition/Looping structures

   • Combination of structures

6. Back to the Engineering 161 menu

• Lecture written by Prof. Martha Selby

• Authored for presentation by Mark Sobek

• Revised by John Even

• Written for HTML by Matt Robinson

Remember a computer is only a problem-solving tool! (one of the many different tools engineers use in solving problems)

1. Recognize and understand the problem.

2. Accumulate facts.

3. Select appropriate theory.

4. Make necessary assumptions.

5. Solve the problem.

6. Verify results.

Preforming step 5 (Solve the problem) may involve a computer.

1. Develop an Algorithm and a Flowchart.

2. Write the program in a computer language. (i.e. Fortran, C)

3. Enter the program into the computer.

4. Test and debug the program.

5. Run the program, input data, and get the results from the computer.

• An Algorithm is just a detailed sequence of simple steps that are needed to solve a problem.

• A Flowchart is a graphical representation of an algorithm.

Start/Stop

Question,Decision (Use in Branching)

Input/Output

Connector (connect one part of the flowchart to another)

Process, Instruction

Comments, Explanations, Definitions.

Preparation (may be used with "do loops" explained later)

Refers to separate flowchart ("Subprograms"(explained later) are shown in separate flowcharts).

Sequential structure

Given the radius and height for a cylinder find the volume and surface area.

Selection/Branching Structure

Repetition/Looping Structure

Combination of Structures

Back to Engineering 161 menu