Assessment Guidelines For The IB Computer Science Dossier From May, 2000

This Programme Dossier is an individual piece of well-documented work involving a problem that can be solved using computer systems. The emphasis is on the use of a logical approach and analytical thinking from definition and decomposition of the problem through to its solution by constructing modular algorithms.

The assigned dossier mark out of 35 is calculated by multiplying a Mastery Factor times the Assessment Evaluation. Of eleven stipulated programming techniques, the mastery factor is a direct reflection of the number of those techniques appropriately applied in the dossier.

Number of Mastery Techniques in the Programme Dossier

Mastery Factor
Standard Level Dossier

Higher Level Dossier

1.00
 7 9, 10 or 11
0.75
 6 7 or 8
0.50
 4 or 5 5 or 6
0.25
 0, 1, 2 or 3 0, 1, 2, 3 or 4

Techniques of Mastery of IB Computer Science

  1. Insert a new data item into a linked list or tree. It is insufficient to add data only to the front or rear of a list.

  2. Delete a data item from a linked list or tree and properly dispose the allocated memory. It is insufficient to delete a data item from only the front or from only the rear of a list.

  3. Search for a data item in a linked list or tree.

  4. Add a new record to a direct (random) access file.

  5. Delete a record from a direct (random) access file.

  6. Search for a record in a direct (random) access file.

  7. Merge two sorted data structures.

  8. User-Defined functions.

  9. Use arrays, records or pointers as parameters.

  10. Recursion

  11. Use more than one kind of composite data structure OR use one hierarchical composite data structure.

A composite data structure is made from other data types, such as a record. A hierarchical composite data structure is where at least one element is an array of records. Another example is a record which has one field defined on another record or array.

Assessment Criteria of Programme Dossier
A Analysing the Problem: A thorough discussion and analysis of the problem which is being solved. 3
B Document the Design Process: structure charts, pseudocode using PURE, flow charts, instance diagrams 6
C Use Appropriate Data Structures: fully support the data storage requirements of the problem 3
D Use Efficient Algorithms: Executes rapidly and requires minimal storage, simple programming code. 3
E Designing a Testing Strategy: Testing should describe and use a wide range of valid and invalid data 3
F Annotated Hard Copy of the Test Output: A representative sample of sample runs of test cases 3
G User-Friendly features: includes design issues, screen dumps, helpful menus, help instructions 2
H Handling Errors: detect and reject erroneous data input from the user and run-time errors caused by calculations anddata-file errors. 2
I Hard Copy of the Source Code: programme functions well and is closely related to the design 3
J Good Programming Style: listings are easily readable, small and clearly structured modules with abundant comments, meaningful identifier names, a consistent indentation scheme and syntax highlighting 2
K Evaluation of Solutions: a critical analysis; efficiency in general terms, effectiveness in relation to the original description of the problem, realistic improvements and extensions. 3
L User Documentation: clear and thorough written instructions for launching and using the programme. 2
Total Possible Marks From Assessment Evaluation 35