1. Hillcrest Christian College
Senior Information Processing and Technology
SEMESTER 1 2013
NAME: DATE: 14/06/13
ASSESSMENT ITEM NO 2 (Yr 11), 8 (Yr 12)
TYPE OF ASSESSMENT Formative (Yr 11), Summative (Yr 12)
ASSESSMENT TECHNIQUE Supervised Practical Exam
ASSESSMENT CONDITIONS Open Book
50 minutes (5 minutes perusal)
Questions to be answered on paper provided
TOPIC/S ASSESSED
Algorithms theory and Design (1), Software
Programming (1)
CRITERIA ASSESSED Knowledge & Application, Analysis & Synthesis,
Evaluation & Communication
TEACHER Mr Miles
INSTRUCTIONS
1. Read the questions carefully. Unless stated otherwise, Students are to show full setting out of all answers, using correct spelling, and
clear explanations and/or diagrams. This will contribute to reasoning as you will be graded on your use of communication and
justification in this subject.
2. Answer all questions fully on your exam paper, and in the Eclipse programming environment.
3. The space allocated for answers is appropriate for a full response. Use your own paper to redo a question if you make a mistake.
4. Calculators are permitted.
5. Please use black or blue biro.
SUMMARY OF RESULTS
DIMENSION RESULT
Knowledge & Application
Analysis & Synthesis
Evaluation & Communication

2. Knowledge & Application:
Grade K&A Descriptors
Standard D Standard C Standard B Standard A
E
reproduction of isolated information
technology facts
elements of set processes used
D
statements of [non-isolated] information
technology facts
elements of set processes to partially
solve simple, familiar problems
C
description of information technology
concepts, terminology, processes, and
principles
application of set processes to [fully]
solve simple or familiar problems
B
description and explanation of
information technology concepts,
terminology, processes, and principles
effective application of set processes to
solve simple and familiar problems
A
detailed description and explanation of
links between information technology
concepts, terminology, processes, and
principles
effective and consistent application of set
processes to solve simple and familiar
problems

3. Analysis & Synthesis
A&S Descriptors
Standard D Standard C Standard B Standard A
E
restated problems or situations
superficial elements of unrehearsed or
complex problems
D
identification and classification of problems
or situations
designed or developed elements of
solutions for unrehearsed or complex
problems
C
analysis of problems and situations
designed and developed partial solutions for
unrehearsed or complex problems
B
interpretation and analysis of problems and
situations
designed and developed [full] solutions for
unrehearsed or complex problems
A
detailed interpretation and analysis of
problems and situations from multiple
perspectives
designed and developed effective solutions to
unrehearsed or complex problems
Evaluation & Communication:
A
comprehensive testing of processes and solutions, application of self-determined and prescribed criteria, reasoning and evidence to draw
conclusions and make supported recommendations
comprehensive construction of documentation and fluent presentation of information using suitable communication conventions to convey
meaning appropriate to the context
B
testing of processes and solutions, application of prescribed criteria, reasoning and evidence to draw conclusions and make supported
recommendations
effective construction of documentation and presentation of information using suitable communication conventions to convey meaning
appropriate to the context
C
[full] testing of processes or solutions, application of prescribed criteria, reasoning or evidence to draw conclusions and make
recommendations
construction of documentation and presentation of information using [some] communication conventions to convey meaning
D
elements of testing of processes or solutions to draw inferences
presentation of information using elements of communication conventions
E
elements of testing & presentation of information

4. Practical Exam
Open the file PracExam.java in Eclipse and attach the standard User library “Genesis”. This
project contains the following (incomplete) code for the class AverageOrderLocate:
import genesis.*;
public class AverageOrderLocate {
public static void main (String [] args) {
int guess = ; //requests a number from the user to search for presence in array
int [] data = {5, 12, -34, 78, -92, 10};
double average = averageOfPositives(data);
Transcript.println(“The average of positive numbers is ” + average);
orderDescending(data);
}
public static double averageOfPositives (int [] intArray) {
// ...
// complete the code for this method (Q1(a))
// ...
}
public static void orderDescending (int [] intArray){
// ...
// complete the code for this method (Q1(b))
// ...
}
public static void locateGuess (int [] intArray, int target){
// ...
// complete the code for this method (Q1(c))
// ...
}
}
You are required to…
1. Create a complete Class Chart for the program.
2. Write a logically complete Pseudocode for the empty methods (syntax is not a major
concern).
3. Complete the methods using fully syntactically and logically correct Java code.
4. Comment major components of your code requiring explanation.
Please Remember…
• The skeleton code provided, does not have a complete main method.
THERE ARE COMPONENTS OTHER THAN THE EMPTY METHODS YOU
MUST CONSIDER TO CODE SO THE PROGRAM RUNS AS INTENDED.
Your Task…
Question 1(a)

5. Complete the code for the method averageOfPositives. This method has one parameter
denoting an array of integers. It returns the average of the positive integers (i.e. those integers
greater than 0) in the array, which is then printed out with the outlined formatting in the main
method. If there are no positive integers in the array, the method returns 0.
Question 1(b)
Complete the code for the method orderDescending. This method has one parameter, the
same array of integers as in the first method. It takes the contents of this array, and prints the
elements in descending order (Hint: Create a second array to do this).
Question 1(c)
Complete the code for the method locateGuess. This method has two parameters, the same
array of integers as in both previous methods (however, since 1b it will now be in descending
order), as well as a guess number (integer). It allows the user to continually guess if a
particular integer exists in the now ordered (descending) array, and each time searches the
contents of this array for the number guessed by the user. If it is not found at first, then it
prompts the user for a new guess number. This process continues until the user guesses a
number which actually exists in the array. When found, it prints the position in the ordered
(descending) array where the guessed integer exists using the following format:
i.e.
“Your guessed number of 12, exists at position 1 in the array”
Considering a fully correct solution, once the program has compiled and is executed, the
output to the Transcript window at run-time should look as follows:
The average of positive numbers is 26.25
78, 12, 10, 5, -34, -92
Your guessed number of 10, exists at position 3 in the array
[for example]