CPT Requirements Overview

The Create Performance Task (CPT) requires a program that demonstrates core computational thinking concepts.

Your program must include:

• Input: user interaction
• Output: program-generated result
• List: collection of data items
• Procedure: reusable function with parameter
• Algorithm: sequencing, selection, iteration

---

📘 CPT Purpose

Full Program

This area can contain a full program combining the component examples below. For now, use the individual component boxes to learn and experiment.

CPT Components

Use the sections below to learn each CPT component. Each section explains the concept, gives a short learning tip, and includes an editable example you can run in your browser.

Input

What it is: data entered by the user (typing, clicking, selecting).

How to learn: practice reading values from form fields and using them in your program.

Your notes Example (edit & Run) // Read the value from the textbox and show it const v = document.getElementById('input_example_field').value; console.log('You entered:', v);

Output

What it is: results produced by the program (text, images, files).

How to learn: practice formatting and presenting data clearly.

Your notes Example (edit & Run) // Compute a result and display it const result = 2 + 3; console.log('Result:', result);

List

What it is: a collection of items you can store and iterate over.

How to learn: manipulate arrays/collections (add, remove, search, sort).

Your notes Example (edit & Run) // Work with a list (array) const fruits = ['apple','banana']; fruits.push('cherry'); console.log('Fruits now:', fruits); console.log('First item:', fruits[0]);

Procedure

What it is: a reusable function with parameters.

How to learn: write small functions, call them with different inputs, and reuse them.

Your notes Example (edit & Run) // Define a procedure (function) and call it function greet(name) { return 'Hello, ' + name + '!'; } console.log(greet('Student'));

Algorithm

What it is: step-by-step instructions using sequencing, selection, and iteration.

How to learn: trace algorithms on paper, then implement them and test edge cases.

Your notes Example (edit & Run) // Simple algorithm: find the largest number const nums = [3,7,2,9,4]; let max = nums[0]; for (let i=1;i<nums.length;i++){ if (nums[i] > max) max = nums[i]; } console.log('Max is', max);

💾 Save System