Algorithm Implementation

[jakeneggs03]

The written response:

• [ ] includes a program code segment of a student-developed algorithm that includes -sequencing -selection -iteration
• [ ] explains in detailed steps how the identified algorithm works in enough detail that someone else could recreate it.

[jakeneggs03]

Responses that do not earn the point in row 4 may still earn the point in this row.

Requirements for program code segments: •The algorithm being described can utilize existing language functionality or library calls. •An algorithm that contains selection and iteration, also contains sequencing .•An algorithm containing sequencing, selection, and iteration that is not contained in the procedure can earn this point. •Use the first code segment, as well as any included code for procedures called within this first code segment, to determine whether the point is earned. •If this code segment calls other student-developed procedures, the procedures called from within the main procedure can be considered when evaluating whether the elements of sequencing, selection, and iteration are present as long as the code for the called procedures is included.

Do NOT award a point if any one or more of the following is true: •The response only describes what the selected algorithm does without explaining how it does it. •The description of the algorithm does not match the included program code. •The code segment consisting of the selected algorithm is not included in the written response. •The algorithm is not explicitly identified (i.e., the entire program is selected as an algorithm without explicitly identifying the code segment containing the algorithm). •The use of either the selection or the iteration is trivial and does not affect the outcome of the program.