Skip To Content

Athabasca University

Section 2: Algorithm Discovery and Design

This section introduces the key elements of command and code structure, including algorithms, pseudocode, sequential operations, iterations and conditions, and provides examples of algorithmic problem solving.

Section Objectives

After completing this section, you will be able to

  1. Define the terms pseudocode and iteration.
  2. Describe and give examples of the roles of algorithms, pseudocode, and sequential, conditional, and iterative operations in computing.
  3. Describe and discuss examples of algorithmic problem solving.

Required Reading

Chapter 2 in the textbook

Discussion Forum

The topic for Unit One, Section 2 is Challenge Work 3 on page 88 of the text.

The instructions are to write a paper, but for our purposes a brief overview (2–3 paragraphs) is sufficient. Try to choose a subject for your discussion who is not already over-represented in the posts. If you do choose a subject who has already been profiled by other you, review their posts and try to provide new information (i.e. that has not already been presented).

Updated August 26 2015 by FST Course Production Staff