Standard level
To achieve a mastery factor of 1.0, students must have mastered at least 10 of the following 15
aspects.

1. Arrays
2. User-defined objects
3. Objects as data records
4. Simple selection (if–else)
5. Complex selection (nested if, if with multiple conditions or switch)
6. Loops
7. Nested loops
8. User-defined methods
9. User-defined methods with parameters (the parameters have to be useful and used within the
method body)
10. User-defined methods with appropriate return values (primitives or objects)
11. Sorting
12. Searching
13. File i/o
14. Use of additional libraries (such as utilities and graphical libraries not included in appendix 2
Java Examination Tool Subsets)
15. Use of sentinels or flags

Higher level
To achieve a mastery factor of 1.0, students must have mastered at least 10 of the following 19 aspects.

1. Adding data to an instance of the RandomAccessFile class by direct manipulation of the file
pointer using the seek method
2. Deleting data from an instance of the RandomAccessFile class by direct manipulation of the
file pointer using the seek method. (Data primitives or objects may be shuffled or marked as
deleted by use of a flag field. Therefore files may be ordered or unordered).
3. Searching for specified data in a file.
4. Recursion
5. Merging two or more sorted data structures
6. Polymorphism
7. Inheritance
8. Encapsulation
9. Parsing a text file or other data stream
10. Implementing a hierarchical composite data structure. A composite data structure in this
definition is a class implementing a record style data structure. A hierarchical composite data
structure is one that contains more than one element and at least one of the elements is a
composite data structure. Examples are, an array or linked list of records, a record that has one
field that is another record, or an array.
11. The use of any five standard level mastery factors—this can be applied only once
12–15. Up to four aspects can be awarded for the implementation of abstract data types (ADTs)
according to the table entitled “Implementation of ADTs”.
An ADT may be implemented as a class or interface containing data members and methods
appropriate to that ADT. The number of mastery aspects to be awarded will depend on the
thoroughness and correctness of the student’s implementation. Examples are given in the following
table.
16. Use of additional libraries (such as utilities and graphical libraries not included in appendix 2
Java Examination Tool Subsets)
17. Inserting data into an ordered sequential file without reading the entire file into RAM.
18. Deleting data from a sequential file without reading the entire file into RAM.
19. Arrays of two or more dimensions.