Evaluation of Students’ work
- For the first question, teams received at least a check if they identified one or more specific ways that the implementations of CircularSeries are similar or noticed that the output produced is identical or very nearly the same. Jackson Miller and William Han received a check plus for including both types of observations in their answer.
- Not evaluated.
- Teams received a check if their answered contained some sort of factual statement about the program. No team clearly expressed the most important underlying purpose of the program, which was mentioned in class more than once; namely, that computers can only represent a finite number of values with a finite number of bits.
- Some teams received low marks for not clearly identifying individual algorithms. Translations of the variationsOf method were studied carefully. Teams that received the highest scores clearly specified the algorithms inputs, its output, and the steps followed to produce the output. The best answer received, submitted by Matthew Leslie and Holden Hutley, was:
Function variationsOf(int valueBase10) Convert supplied numeric value (valueBase10) into an integer. Take the integer and convert it into its binary form. Define this value as String s2. Take the same integer and convert it into decimal form. Define this value as String s10. Take the same integer and convert it to hexadecimal form. Define this value as String s16. Return a String that combines s2, a space, s16, a space, and s10, then prints a new line.
- Not evaluated.
- Not evaluated.
- Not evaluated.
- Not evaluated.
- Students received good marks for noting that computers represent values using a finite number of bits and that the results of mathematical operations can be surprising when computed values exceed (overflow) the number of bits available for a particular numeric date type.