|
| |
Programming Concepts and Skills
Overall Expectations
By the end of this course, students will:
| A1. |
demonstrate the ability to use different data types, including
one-dimensional arrays, in computer programs; |
| A2. |
demonstrate the ability to use control structures and simple
algorithms in computer programs; |
| A3. |
demonstrate the ability to use subprograms within computer programs; |
| A4. |
use proper code maintenance techniques and conventions when creating
computer programs. |
| |
|
Specific Expectations
A1.
|
Data Types and Expressions
|
| |
By the end of this course, students will: |
| |
| A1.1 |
use constants and variables, including integers, floating
points, strings, and Boolean values, correctly in computer
programs; |
| A1.2 |
demonstrate an understanding of how a computer uses various
systems (e.g., binary, hexadecimal, ASCII, Unicode) to
internally represent data and store information; |
| A1.3 |
use assignment statements correctly with both arithmetic and
string expressions in computer programs; |
| A1.4 |
demonstrate the ability to use Boolean operators (e.g., AND,
OR, NOT), comparison operators (i.e., equal to, not equal to,
greater than, less than, greater than or equal to, less than or
equal to), arithmetic operators (e.g., addition, subtraction,
multiplication, division, exponentiation, parentheses), and
order of operations correctly in computer programs; |
| A1.5 |
describe the structure of one-dimensional arrays and related
concepts, including elements, indexes, and bounds; |
| A1.6 |
write programs that declare, initialize, modify, and access
one-dimensional arrays. |
| |
|
|
A2.
|
Control Structures and Simple Algorithms
|
| |
By the end of this course, students will: |
| |
| A2.1 |
write programs that incorporate user input, processing, and
screen output; |
| A2.2 |
use sequence, selection, and repetition control structures
to create programming solutions; |
| A2.3 |
write algorithms with nested structures (e.g., to count
elements in an array, calculate a total, find highest or lowest
value, or perform a linear search). |
| |
|
|
A3.
|
Subprograms
|
| |
By the end of this course, students will: |
| |
| A3.1 |
demonstrate the ability to use existing subprograms (e.g.,
random number generator, substring, absolute value) within
computer programs; |
| A3.2 |
write subprograms (e.g., functions, procedures) that use
parameter passing and appropriate variable scope (e.g., local,
global), to perform tasks within programs. |
| |
|
|
A4.
|
Code Maintenance
|
| |
By the end of this course, students will: |
| |
| A4.1 |
demonstrate the ability to identify and correct syntax,
logic, and run-time errors in computer programs; |
| A4.2 |
use workplace and professional conventions (e.g., naming,
indenting, commenting) correctly to write programs and internal
documentation; |
| A4.3 |
demonstrate the ability to interpret error messages
displayed by programming tools (e.g., compiler, debugging tool),
at different times during the software development process
(e.g., writing, compilation, testing); |
| A4.4 |
use a tracing technique to understand program flow and to
identify and correct logic and run-time errors in computer
programs; |
| A4.5 |
demonstrate the ability to validate a program using a full
range of test cases. |
| |
|
|
| |
|
Source: The Ontario Curriculum, Grades 10 to 12: Computer
Studies, 2008 (revised), page 40-1
PDF Format |