must be precise enough to be understood by human beings.

• Algorithm Equation

• Pseudocode

• Algorithm Analysis

• Algorithms

Given an algorithm to solve a particular problem, we are naturally led to ask:

Does it really do what it is supposed to do?

• Verification

• Performance Analysis

• Specification

it is usually easier and clearer to use something that comes somewhere in between formatted English and computer program code, but is not runnable because certain details are omitted.

• Algorithm

• Algorithm Analysis

• Pseudocode

• Flowchart

Algorithm’s running time is not an important issue.

• True

• False

store address of variables or a memory location.

• Arrays

• Loops

• Pointers

• Iteration

The 4th step in Problem Solving

• Implementation

• Algorithm Analysis

• Testing

• Maintenance

The standard approach in most programming languages for repeating a process a

certain number of times,

• Do while Loop

• Arrays

• Loops

• For loop

Given an algorithm to solve a particular problem, we are naturally led to ask:

How efficiently does it do it?

• Efficiency

• Performance Analysis

• Specification

• Verification

a schematic representation of an algorithm or

a process.

• Loops

• Flowchart

• Pseudocode

• Schema

It deals with space and time complexity

• Algorithm Verification

• Algorithm Performance

• Algorithm Analysis

• Algorithm Complexity