SINGAPORE A-LEVEL COMPUTING SYLLABUS (2011)

Please note that this document only represents the Singapore A-level computing syllabus up till 2011 - if you are taking the exam in 2012 there is a new syllabus out.

HideShow resource information
  • Created by: j
  • Created on: 04-09-11 14:25
Preview of SINGAPORE A-LEVEL COMPUTING SYLLABUS (2011)

First 50 words of the document:

COMPUTING
HIGHER 2
(Syllabus 9754)
[For School Candidates Only]
CONTENTS
Page
PREAMBLE 1
AIMS OF SYLLABUS 1
STRUCTURE OF SYLLABUS 2
OBJECTIVES OF ASSESSMENT 2
SCHEME OF ASSESSMENT 3
WEIGHTING OF ASSESSMENT 3
PRACTICAL COURSEWORK 3
SUGGESTED SCHEDULE 4
SYLLABUS CONTENT AND LEARNING OUTCOMES 5

Other pages in this set

Page 2

Preview of page 2

Here's a taster:

H2 COMPUTING (2011)
PREAMBLE
This syllabus defines in five modules all the topics to be taught at H2 level. It is intended for the
candidate who desires to learn problem-solving techniques and the design of computer solutions in a
rigorous way, and is self-motivated and capable of working with less direct supervision. The syllabus
emphasises problem-solving methodologies, algorithm designs and developments, data structures
and computer-programming skills.…read more

Page 3

Preview of page 3

Here's a taster:

H2 COMPUTING (2011)
STRUCTURE OF SYLLABUS
The syllabus consists of the following modules:
Module 1 ­ Development of Computer Solutions
This module covers the principles, strategies, techniques and tools relating to the
formulation of a programming problem and the planning of its solution. The study of
these topics is reinforced through practical work.
Module 2 ­ Programming Concepts
This module covers analytical and computer-programming skills required to use
computers for problem solving.…read more

Page 4

Preview of page 4

Here's a taster:

H2 COMPUTING (2011)
SCHEME OF ASSESSMENT
Candidates will offer three papers as follows:
1 Paper 1 (Written, 3 hours)
The Paper comprises 6­8 compulsory questions to cover the entire syllabus and assess
objectives 1.1 to 1.5. Questions are structured and involve problem solving. These are
based on basic concepts and skills, as well as application of these concepts and skills. The
Paper carries 40% of the total marks.…read more

Page 5

Preview of page 5

Here's a taster:

H2 COMPUTING (2011)
Candidates will be required to apply concepts and skills covered in Syllabus Modules 1­4. The
assessment is conducted in the computer laboratories, under the supervision of subject teachers.
Candidates will be allowed to refer to the on-line help feature of the programming language software
as well as an approved reference guide on the syntax of the programming language used.
Each candidate will require access to a microcomputer system comprising a keyboard, mouse,
processor, visual display unit, hard disk and disk drive.…read more

Page 6

Preview of page 6

Here's a taster:

H2 COMPUTING (2011)
SYLLABUS CONTENT
Module 1 ­ Development of Computer Solutions
This module covers the principles, strategies, techniques and tools relating to the formulation of a
programming problem and the planning of its solution. The module is sub-divided into 4 topics and
the study of these topics is reinforced through practical work:
Problem identification and analysis
Formulation of programming solution
Development of programming solution
Execution and evaluation of programming solution
LEARNING OUTCOMES
1.1 Problem Identification and Analysis
Students should be able to
1.1.…read more

Page 7

Preview of page 7

Here's a taster:

H2 COMPUTING (2011)
1.3.3 demonstrate skills in enhancing the clarity of the programming solution through the efficient
use of modules, comments, indentation, and meaningful variable, parameter and procedure
names
1.3.4 explain the importance of reliability, clarity and efficiency in program development
1.4 Execution and Evaluation of Programming Solution
Students should be able to
1.4.1 give a reasoned and critical evaluation of the solution to a problem
1.4.2 describe the types of program errors: semantic, syntax, logic and arithmetic
1.4.3 explain why these errors occur
1.4.…read more

Page 8

Preview of page 8

Here's a taster:

H2 COMPUTING (2011)
2.1.10 effectively use subroutines, procedures, functions and library routines in programming
2.1.11 show an understanding of local and global variables, and the need for passing parameters
(pass-by-value and pass-by-reference)
2.1.12 use composite data types: array and record; and input/output files in programming
2.1.13 use pointers and dynamic structures such as lists
2.2 Object-Oriented Elements
Students should be able to
2.2.1 give a specification of a class
2.2.2 implement classes given their class specifications
2.2.…read more

Page 9

Preview of page 9

Here's a taster:

H2 COMPUTING (2011)
3.1.4 translate an algorithm expressed in pseudocode notation into programs in an appropriate
programming language
3.2 Fundamental Algorithms
Students should be able to
3.2.1 understand and implement algorithms for solving simple problems that involve summing,
counting, finding the minimum and maximum of an array, and random number generation
3.2.2 understand and implement algorithms for bubble sort, insertion sort and quick sort
3.2.3 discuss the efficiency of these sort algorithms and appropriate circumstances for their use
3.2.…read more

Page 10

Preview of page 10

Here's a taster:

H2 COMPUTING (2011)
Module 4 ­ Data Management
This module covers the principles and standard methods of organising and representing data for
storage and processing by computers to suit the needs of applications. The emphasis of this module
will be on the concepts, skills and processes necessary when using databases or files in a problem
situation or application. This module is thus sub-divided into 2 areas:
Relational databases
File organisation and access
LEARNING OUTCOMES
4.1 Relational Databases
Students should be able to
4.1.…read more

Comments

No comments have yet been made

Similar Other resources:

See all Other resources »See all resources »