DIVISION/DEPARTMENT: MEZAM

PRACTICING SCHOOL/ETABLISSEMENT D’APPLICATION: GOVERNMENT TECHNICAL HIGH SCHOOL

NKWEN (GTHS)
OPTION/SERIE: COMPUTER SCIENCE
ACADEMIC YEAR/ANNEE ACADEMIQUE 2020/2021
COMPETENCY BASE APPROACH LESSON

COMPUTER SCIENCE
SUBJECT/PROGRAMME:
NATURE OF LESSON/TYPE DE LECON: THEORY

LESSON TITLE/TITRE DE LA LECON : ALGORITHM REPRESENTATION

DURATION OF LESSON/DUREE DE LA 1HR 40 MINS
LECON :
TEACHER BIH SANDRA CHENWIE

PEDAGOGIC FORM
COMPETENCY BASED APPROACH LESSON
TEACHER’S NAME: BIH SANDRA CHENWIE
SCHOOL: GTHS NKWEN CLASS: FORM 4 DATE:21st JAN 2021
SUBJECT: COMPUTER DURATION: 1HR 40MINS No OF STUDENTS:22
SCIENCE
MODULE II: ALGORITHM SUBTOPIC: ALGORITHMS, TEACHING AIDS: CHALK, BOARD,
REPRESENTATION THE STRUCTURE OF AN CHARTS.

ALGORITHM, AND
METHODS OF
REPRESENTING
ALGORITHMS.
REAL LIFE SITUATION: WRITING AN ALGORITHM WHICH GETS THE COST OF MAKING A BED AND A
CHAIR, SUMS UP THE VALUES AND PRINTS THE RESULT.

PRE-REQUISITE OR PREVIOUS KNOWLEDGE: Students should be able to explain logic gates, describe the six different
types of logic gates and importance of logic gates.

EXPECTED Students will be able to:

COMPETENCY To use flow charts, pseudo code or structured English to represent
algorithms.
OBJECTIVES Students should:
 Write an algorithm to perform simple task
 Define algorithms
 State the structure of an algorithm
 Explain methods of expressing algorithms
  Sketch flow chart symbols
 State limitations of flow chart
 Write pseudocode for simple tasks.
 List properties of good algorithms.
 Importance of algorithms.

TEACHING
METHOD: STUDENT CENTERED: PARTICIPATORY, DEMONSTRATIVE
AND ACTIVE

LESSON PLAN/PLAN DE LA LECON

I. Introduction:
II. Presentation:
III. Conclusion
IV. Application exercises
V. Consolidation exercise
Documents to be prepared and handed to students/Documents a preparer a remetre aux eleves:
Lesson notes
EVALUATION

Application Exercises: write an algorithm using flow charts that gets 2 numbers, sums them
and prints the results if answer is less than 4.
1. Consolidation exercises: Take home exercises:
Read on algorithm control structures
 LESSON WORKING SHEET
LESSON OBJECTIVES TEACHING LEARNER’S DIDAC FORMATIVE
STAGES

DURATION
CONTENT ACTIVITIES ACTIVITIES TIC EVALUATION
MATER
IALS

Conduct roll Ensure that students are Call students’ Answer their names Class Identify the
CALL
ROLL

5 MINS
call present in class names and mark register students
the register and pen

 Revision on Ensure that students Ask questions Answer questions Chalk 1.Explain the
INTRODUCTION

30 MINS
previous Can remember what a on posed by the teacher and black meaning of
knowledge logic gate is what a  Logic gates and clarify any doubts board logic gates and
on truth truth table is, explain  Types of logic from previous class. their importance
tables, the different types of gates Present their in real life.
Boolean logic gates.  Truth tables assignments 2.Explain the
algebra, Explain what Boolean and how truth different types
logic gates algebra and give the tables are of gates using
and the Boolean expression of constructed. their truth tables
different the AND, OR, and  Boolean and symbols.
types NOT gates. algebra. 3.Explain boolean
 Correction Ensure that students Check students’ algebra and give
of have done their given assignments. the boolean
assignment assignment. expression of
on logic the main
gates. operators.
Explanation of Students should listen Teacher asks  Listen attentively Lecture Explain the
PRESENTATION

1HOUR
algorithms, carefully to the questions on the  Answer questions notes, algorithms and
structure of an teacher’s explanation, following; posed by the teacher chalk and structure of
algorithm, and ask any questions What is an  Express their black algorithm.
explain they may have and algorithm? difficulties with the board, Identify the
methods of asked any questions Methods of topic by asking charts. various ways of
expressing posed by the teacher expressing questions expressing
algorithms, algorithms  Copy notes given by algorithms.
sketch flow  What is a flow the teacher Importance of
charts chart? Give the algorithms.
symbols, limitations of
explain flow charts
limitations of  What is a
flow charts, pseudocode?
list properties  Explain
of good structured
algorithms and English.
write lines of  State properties
pseudo codes. of a good
Importance of algorithm.
algorithms.  Teacher now
explains what
was left out and
give notes on
algorithms,
structure of an
algorithm,
methods of
expressing
algorithms.
 Application At the end of this stage, The teacher must Listened to lectures, Record Explain
CONCLUSI0N

5 MINS
and students must be able have explained asked questions, of work, algorithms and
consolidation explain what they the meaning of answered questions book, structures of
exercises understand algorithms, algorithms, and copied the notes pen algorithms
list the structures of structures of given by the teacher. Explain the
algorithms. algorithms, methods of
Write simple task using methods of expressing
the three different representing algorithms and
methods of representing algorithms and give the
algorithms. importance of advantages and
algorithms. disadvantages
where applicable.
 BOARD IMPLANTATION

PLAN DATE
ALGORITHM VOCABULARY
REPRESENTATION
Revision DEMONSTRATION: Algorithm
Introduction: Diagram of flow chart Pseudo code
Presentation: symbols. Flow charts
 Algorithms Structured language
 Structures of an Header
algorithm Declaration
 Methods of Terminator
expressing an Connector
algorithm
 Properties of a
good algorithm.
Conclusion
Application Exercise
Consolidation Exercise

BLOOM TAXONOMY
Bloom’s KNOWLEDG COMPREHENSIO APPLICATIO ANALYSI SYNTHESI EVALUATIO
definition E N N S S N

Remembering Understanding Applying Analyzing Evaluating Creating

Grade of    
Evaluatio
n

LESSON NOTES
ALGORITHM REPRESENTATION
ALGORITHM
An algorithm is a finite step by step process for solving a problem (computational problems).
Algorithms are therefore a sequence of computational steps that transform the input into output. It
is not limited to computer science alone since we use algorithm in our daily life.
THE STRUCTURE OF AN ALGORITHM
Every algorithm should have the following sections, in the stated order;
1) Header: algorithm’s name or title
 2) Declaration: a brief description of algorithm and variables. That is statement of the
purpose.
3) Body: sequence of steps.
4) Terminator: end statement
METHODS OF EXPRESSING ALGORITHMS
FLOWCHART
A flowchart is a step by step diagrammatic representation of the logic paths to solve a
given problem. A flowchart is graphical representation of an algorithm.

SYMBOLS USED IN FLOWCHARTS

symbols Name / meaning

Process: denotes a process to be carried out e.g addition, subtraction,

division, etc.

Input / output: denotes an input and output operation

Decision: denotes a decision (or branch) to be made.

Terminator: denotes the beginning or end of the program.

Connector: connect sections of the flowcharts.

Arrows: denotes the direction of logic flow in the program.

Advantages of flowcharts Disadvantages of flowcharts

Easy communication: flowcharts are helpful in Complex: if the program is very large, the
explaining the program to other people using flowcharts cover many pages, making them
 standard symbols. hard to follow.
Effective analysis: with the help of flowcharts, Costly: if the flowchart is to be drawn for a
the problem can be analyzed more effectively. huge program, the time and cost factor of
program development may get out of
proportion, making it a costly affair.
Proper debugging: the flowchart helps in the Difficult to modify: due to its symbolic nature,
debugging process. any change or modifications to a flowchart
usually requires redrawing the entire logic
again, and redrawing a complex flowchart is
not a simple task.
Efficient coding: once the flowchart is drawn, No update: large programs are almost
it becomes easy to write the program in any impossible to update.
high level language.

Example 1
Write an algorithm that gets two numbers from a student, adds the numbers and displays the
result.

PSEUDO CODE
Pseudo code is an artificial and informal English language used to present an algorithm in an
easily readable and modular form.
Pseudo code guidelines
1) Statements should be written in simple English and should be programming language
independent.
2) Steps must be clear i.e they must suggest a solution to the specified problem.
3) Each instruction should be written in a separate line.
4) Capitalized keywords such as READ and PRINT.
5) Each set of instructions is written from top to bottom, with only one entry and one exit.

ADVANTAGES OF USING PSEUDO-CODES

 Easy to read
 Easy to understand
 Easy to modify
 Reduced complexity
 Increased flexibility
 Writing requires less time and effort.
DISADVANTAGES OF PSEUDO CODES
 There are no accepted standards for writing pseudo codes. Different programmers
use their own style of writing pseudo code.
 It’s quite difficult for the beginners to write pseudo code as compared to drawing
a flowchart.
Example 2
Write an algorithm that gets two numbers from a student, multiplies the numbers and displays the
result.
STRUCRUTRED ENGLISH
Structured English is a limited form of pseudo code. It uses English language with
the syntax of structured programming to communicate the design of a computer
program to non- technical users by breaking it down into logical steps using straight
forward English words.
Importance of algorithms
 Creating computer programs.
 Solving problems (computational problems)