COMPUTER SCIENCE SYLLABUS FOR FORM V_VI
COMPUTER
SCIENCE OBJECTIVES
Computer
Science at Advanced Certificate
of Secondary
Education
has been developed with an objective
of importing Computer Science knowledge into the learner. In particular
the main objectives of Computer Science are:
-
To relate the theory and practice of Computer Programming
-
To develop Computer Programmes for various practical
applications.
-
To give a comparative study
of the main programming languages -
Identify why a language is
used the way it is u sed.
ORGANIZATION OF THE SYLLABUS
Computer programming is a process and therefore methodology driven and
not language controlled. The
syllabus is organized so that stress is on the method and practical application
rather than language. The syllabus also requires that whatever language is used
must be block-structured and have a strong scientific application. The topics in
the syllabus are arranged in a spiranature whereby the same topics are found in
both forms five and six. However, for each topic elementary treatment is done in
form five while more advanced material is done in form six. In addition there is
a topic in form six, which enables the learner to do a comparative study of key
programming languages to establish application of these languages in practical
cases.
It is advised
that the
teacher try as much as possible to incorporate the practical topics (
topic 5 in form V and topic 10 in
form VI ) into other topics rather
that taking them as separate topics.
CHOICE AND USE OF INSTRUCTIONAL MATERIALS
The computer Science
teacher is expected to
be well informed about books which best meet the requirements of the
syllabus. Teachers will also be expected to use their academic and professional
knowledge and skills to guide and advise learners on how best to use books and other
non-textual instructional materials available in schools and libraries.
METHODS OF TEACHING AND LEARNING
The syllabus has proposed teaching/learning strategies for each topic.
These are just proposals. The teacher will be free to use any
teaching/learning method considered effective in promoting concept formation,
skill development and internationalization of knowledge in general. It is worthy
bearing in mind that, it is generally agreed that a skill is learned better by
using the active methods of instruction. This means that the pupils will require
several exercises for developing various programmes.
ASSESSMENT OF
STUDENTS PROGRESS AND PERFOMANCE
It is expected that
teachers will carry out assessment of their
student’s progress and perfomance
periodically. This is done to identify their strengths and weakness and
so as to help the weak and encourage the good one as appropriate. Assessment of students progress and perfomance
does also measure the effectiveness
of the course and the teaching/learning strategies. At the end of form VI students are expected to do an overall
achievement examination intended to determine the extent to which the objectives
of the course have been attained.
INSTRUCTIONAL TIME
The teacher is advised to make maximum use of
the allocated time per week for
the subject. Lost/instructional time, for whatever
cause, should be compensated for
through the teacher’s own
local arrangement with the school administration.
TOPIC FORM V
1.
PROGRAMMING METHODOLOGY
1.1.
Software Development
1.2.
Functional Specification
1.3.
Designing
1.4.
Implementation
1.5.
Testing
1.6.
Debugging strategies
1.7.
Documentation
2.
PROGRAMMING WITH A BLOCK STRUCTURED LANGUAGE
2.1.
Identifiers
2.2.
Constants and Variables
2.3.
Control Structure
2.4.
Input and Output
2.5.
Procedures and Functions
2.6.
Annotation
3.
DATA TYPE AND STRUCTURE
3.1.
Primitive Data Type
3.2.
Linear Data Structure
4.
ALGORITHMS
4.1.
Introduction to Algorithms
4.2.
Sequential and Interactive Algorithm
4.3.
Sequential Search Algorithm
5.
APPLICATION OF COMPUTING
6.
PROGRAMMING METHODOLOGY
FORM VI TOPICS
7.
PROGRAMMING WITH A BLOCK STRUCTURE LANGUAGE
8.
DATA TYPE AND STRUCTURES
8.1.
Linear Data Structure
8.2.
Tree Data Structure
9.
ALGORITHM
9.1.
Search Algorithm
9.2.
Sort Algorithm
10.
APPLICATION OF COMPUTING
11. COMPARATIVE STUDY OF
PROGRAMMING LANGUAGES
