Module Outline
Date retreived
22/07/2026 4:24 PM AWST
22/07/2026 4:24 PM AWST
Whilst all efforts are made to provide accurate and timely information from the relevant source/documentation, please be aware that the information supplied may not be the most current version. The accuracy of the detail has not been confirmed by the Department and therefore should not be relied upon without first confirming the contents.
Programming Pl.i 112
Programming Pl.i 112
Module
National Code
State Code
51555
51555
DTWD Status
Approved
Approved
State Implementation and Classification
Approved Date
Field of Education
Nominal Hours
68
Description
To teach the features of PL/I relevant to relative
and indexed sequential file handling.
To provide experience in programming commercial
applications of PL/I in an interactive environment.
To expose the student to a variety of algorithms
commonly encountered in PL/I applications.
and indexed sequential file handling.
To provide experience in programming commercial
applications of PL/I in an interactive environment.
To expose the student to a variety of algorithms
commonly encountered in PL/I applications.
No information
Evidence Guide
Examination 70% Internal
Assessment 30%
Students must pass the examination.
Where a pass is achieved in the examination, the
overall mark is the sum of the two components,
weighted as shown above.
Otherwise, the overall mark is determined by 100%
weighting for the written paper.
Examination
One two-hour written paper consisting of the following components:
- About five short questions examining syntax and techniques
associated with Topics 1 to
9. 15%
- One or more procedures or program segments testing the
understanding of error handling and interactive
techniques. 20%
- One question testing the use of relative files in a
straight forward application. 15%
- One question requiring the design and coding of a complete
program using indexed sequential files in a commercial
application. 50%
Assignment 1 - Sequential and Relative File
Processing. 15%
Assignment 2 - Indexed Sequential File
Processing. 15%
Assessment 30%
Students must pass the examination.
Where a pass is achieved in the examination, the
overall mark is the sum of the two components,
weighted as shown above.
Otherwise, the overall mark is determined by 100%
weighting for the written paper.
Examination
One two-hour written paper consisting of the following components:
- About five short questions examining syntax and techniques
associated with Topics 1 to
9. 15%
- One or more procedures or program segments testing the
understanding of error handling and interactive
techniques. 20%
- One question testing the use of relative files in a
straight forward application. 15%
- One question requiring the design and coding of a complete
program using indexed sequential files in a commercial
application. 50%
Assignment 1 - Sequential and Relative File
Processing. 15%
Assignment 2 - Indexed Sequential File
Processing. 15%
Elements and Performance Criteria
No information
No information
Associated Qual/Courses
| State Code | National Code | Title | Type |
|---|---|---|---|
| 9600 | Applied Science Computing | Accredited course |