CAPE COMPUTER SCIENCE UNIT ONE (1) - UNIT PLAN

UNIT TITLE: Problem Solving with Computers

GRADE/ LEVEL: Twelve (12)

DURATION: Four (4) Weeks

OVERVIEW: On completion of this module, students should: understand the problem-solving process; appreciate the role and importance of algorithms in
the problem-solving process; understand the process of developing algorithms
SPECIFIC SUB-TOPIC(S) MAJOR CONCEPTS TEACHING LEARNING EVALUATION RESOURCES WK
OBJECTIVES STRATEGIES ACTIVITIES

Students should: Syllabus Content Computer, 1

• Module 2: Problem-Solving
Overview and Presentation slides
0. Understand the delivery sequence with Computers and syllabus.
Requirements of • Module 3: Programming
the Syllabus and
the • Module 1: Computer
Internal Assessment IA Mark scheme Organization
Overview
• Definition of the Problems •
Narrative and Flow Charts or
Pseudocode
• Coding of Program

• Testing and presentation

• Communication of
Information
 1. Explain the concept Problem-solving process. Problem Solving definition Laptop, computer, 1
of problem solving ✓ Cooperative • Students will
slides, syllabus and
learning be given a step textbook
of
✓ Case Method the problem
2. Describe the stages Stages of the
in the problem-solving Problem solving • Problem definition. solving process
process process in groups to
• Problem analysis. explain.
• Identify and evaluate possible
solutions
• Select and justify optimal
solutions
• Implementation and review.

3. Explain the concept Algorithms Algorithm Definition. Verbal Recap Laptop, computer, 1
of an algorithm. ✓ Cooperative • Students will
slides, syllabus and
learning research the textbook
Properties of a
✓ Discussion
well-designed
4. Identify the Properties of a well algorithm for
necessary properties of • A general solution to the discussion.
designed algorithm
algorithms that are problem
well designed. • Clearly defined and
unambiguous steps.
• Students will be
• Finite number of steps. given
• Flow of control from one algorithms
5. Identify ways of represented in
Ways of process to the next.
representing the 3 ways for
representing
algorithms algorithms them to make
comparisons,
Narrative, Flowchart & identifying some
Pseudocode constructs are
represented.
6. Explain Constructs used in Students will Laptop, computer, 2
constructs used • Input and Output statements ✓ Cooperative • Students will
structured programming review their slides, syllabus and
in structured learning use control algorithms with textbook
• Control Structures: structures in
programming ✓ Case Method the aid of the
o Sequence the creation of
teacher.
o Selection algorithms in
o Iteration or repetition groups.
(bounded and unbounded

7. Interpret Tracing/Algorithm Determination of output and Class review of Laptop, computer, 3

✓ Cooperative • Students will
algorithms from Review correctness of a given trace tables slides, syllabus and
case problems. algorithm learning be given textbook
algorithms
✓ Case Method to trace. Students will
8. Correct algorithms Determine whether an review each
from case algorithm achieves its stated • Students will other’s work.
problems. objective and if not provide a
correct algorithm analyse and fix
incorrect
algorithms.

9. Develop algorithms Algorithm Development Algorithms as logically Laptop, computer, 4

✓ Cooperative • Discussion
from case sequenced instructions. slides, syllabus and
problems. learning textbook
• Students will
10. Explain the need for analyze the steps
✓ Case Method algorithms and
developing the logic
of a computer determine
program. correctness.

• Students will
explain the need
for algorithms
UNIT TITLE: Programming

GRADE/ LEVEL: Twelve (12)

DURATION: Nine (9) Weeks

OVERVIEW: On completion of this module students should: appreciate the need for different programming languages and program translation; develop the
ability to implement solution to problems using programming language.
SPECIFIC OBJECTIVES SUB-TOPIC(S) MAJOR CONCEPTS TEACHING LEARNING EVALUATION RESOURCES WK
STRATEGIES ACTIVITIES

Students should: Characteristics of Students will be grouped Informal Laptop, computer, 5

• Procedural or Imperative ✓ Discussion where they will be
different slides, syllabus
1. Identify the programming • Object-oriented ✓ Cooperative required to research and textbook
characteristics of paradigms. characteristics of the
different learning different
• Functional
programming programming
paradigms. • Declarative. paradigms etc. for
discussion.

2. Explain the need for Programming Languages Appropriateness to Students will explore Students will be Laptop, computer, 5
✓ Discussion
different applications (web content of the topic in required to slides, syllabus
programming application, games, ✓ Cooperative both video and written. write a short and textbook
languages formula translation, essay
application for mobile learning explaining the
devices) need for
different
programming
languages.

SIX WEEK TEST

3. Explain how Program Translation Stages in the Students will discuss Students will Laptop, computer, 6
✓ Discussion state the
Assemblers, translation process: the different stages of slides, syllabus
Compilers and ✓ Cooperative the deliverables of and textbook
Virtual machines • Lexical analysis translation process. each stage of
and interpreters are learning the translation
• Syntax analysis
involved in the process.
execution of • Semantic analysis
High-level
programming • Intermediate code
languages.
generation
• Code optimization

• Code generation.

Programming Assemblers, Compiler

Language Translators
Role of preprocessors;
linkers.

4. Assign variables Variable declaration Students will declare Laptop, computer, 7

• Appropriate variable ✓ Discussion
to declared and assignment proper variables to be slides, syllabus
variables names. used in their algorithms. and textbook
✓ Cooperative
• Data types (Integer, float,
learning ✓
double and char, char []) • Demonstration
Variable naming
Input and Output conventions Students will research
5. Using input and Statements and share amongst
output statements Inputting data to classmates how to
variables, Output data input and output data to
from variables, print and from variables.
Good programming headings.
6. Develop good practices Students will be required
programming style to add comments to their
programs.
Proper spacing (white
spaces), indentation
 and comments

7. Choose Conditional and Conditional Students will be given Laptop, computer, 7

✓ Demonstration
appropriate Iterative Constructs a chance to analyze a slides, syllabus
conditional and • If Construct problem and decide and textbook
✓ Cooperative
iterative constructs which construct best
• If-then-Else Construct Learning suits the problem.
• Nested-If Constructs

Iterative
• While
Students will
8. Use Conditional • Do-While implement solutions
and Iterative to problems
Constructs • For utilizing conditional
and iterative
constructs.

9. Use arrays in programs Arrays Students will write Students will Laptop, computer, 8
• Read data into arrays • ✓ Demonstration simple C programs to test the slides, syllabus
Output data from arrays perform correctness of and textbook
✓ Cooperative
their programs
Learning

basic functions with through the use

• Manipulate or modify ✓ Case Studies an array. of test data.
data in arrays.
• Character Arrays (String)

10. Apply the techniques Functions Write simple and clear Students will work Laptop, computer, 9
✓ Cooperative
of structured functions; collaboratively to slides, syllabus
decomposition to Learning decompose given and textbook
reorganize a program ✓ Case Studies problems into functions.
into smaller pieces
11. Implement Algorithm Students will be given Students will Laptop, computer, 10
Algorithms to solve a
• Write test and debug ✓ Demonstration fix incorrect
Implementation erroneous slides, syllabus
given problem programs programs/modules code and textbook
✓ Cooperative
• Use of range tests and and asked to debug given to them
Learning them. in a
desk checks PowerPoint
• Code debugging /Worksheet
strategies (trace tables,
watches)

12. Use records as a Records The concept of a Struct in C Students will work Students will Laptop, computer, 11
✓ Demonstration
means of grouping collaboratively to find be given slides, syllabus
related ✓ Cooperative various entities that can entities for and textbook
information. be represented as a which they
Learning struct. will have to
develop
suitable
structs.

13. Use text files to Files File Operations: Open, Students will work Students will Laptop, computer, 12 &
store data and close, read, write, append. ✓ Demonstration be required to
collaboratively after slides, syllabus 13
records ✓ Cooperative given adequate prove and textbook
examples to add correctness of
Learning modules to perform file their modules
operations to their by testing
programs. them.

SIX WEEK TEST