WeLearn

Grade 10 Information Technology · Unit 6

Fundamentals of Programming

Unit 6 of the Grade 10 Information Technology textbook has 5 lessons: Basics of Algorithms, Definition of an Algorithm, Characteristics of an Algorithm, Algorithm Representation and Integrated Development Environment (IDE).

Lesson 6.1

Basics of Algorithms

Computers cannot think for themselves; they follow instructions exactly. Before writing a program, a programmer must work out a clear method for solving the problem.

AlgorithmProgramIPO modelSequenceSelectionRepetition (loop)Variable

Lesson 6.2

Definition of an Algorithm

An algorithm is a finite, ordered set of well-defined instructions for solving a problem or performing a task, which, when followed from given inputs, produces the required output in a finite amount of time.

AlgorithmAl-KhwarizmiHeuristicEfficiencyLinear searchBinary search

Lesson 6.3

Characteristics of an Algorithm

Not every list of instructions is a good algorithm. Computer scientists usually require an algorithm to have five essential characteristics: input, output, definiteness, finiteness and effectiveness.

InputOutputDefinitenessFinitenessEffectivenessGeneralityInfinite loop

Lesson 6.4

Algorithm Representation

An algorithm can be written down, or represented, in several ways. The most common are natural language, pseudocode, flowcharts and, finally, a programming language.

Natural languagePseudocodeFlowchartConnectorDecision tableTrace table

Practice questions

3 of the 6 questions in the Unit 6 quiz. Try each one, then reveal the answer.

  1. 1. An algorithm is:

    • A. A type of computer hardware
    • B. A finite, ordered set of clear steps that solves a problem
    • C. A programming language
    • D. A virus
    Show answer

    Answer: A finite, ordered set of clear steps that solves a problem

    An algorithm is the step-by-step method; a program is that method written in a particular language.

  2. 2. Which characteristic means an algorithm must stop after a limited number of steps?

    • A. Finiteness
    • B. Input
    • C. Generality
    • D. Colour
    Show answer

    Answer: Finiteness

    An algorithm that never ends cannot give an answer, so finiteness is required.

  3. 3. Writing an algorithm in structured, English-like statements is called:

    • A. Pseudocode
    • B. Machine code
    • C. Binary
    • D. HTML
    Show answer

    Answer: Pseudocode

    Pseudocode looks like code but ignores strict syntax, so it is easy to read and later translate into any language.

Teach Information Technology Unit 6 with WeLearn

We will bring a demo to your school: a lesson on your interactive TV, a virtual lab and a classroom game, with your own teachers.