Code.org - AP Computer Science Principles - Unit 3

Algorithm

A precise sequence of instructions for processes that can be executed by a computer and are implemented using programming languages. (NOTE: this is the definition from the AP CS Principles framework).

Low level programming language

A programming language that captures only the most primitive operations available to a machine. Anything that a computer can do can be represented with combinations of low level commands.

High level programming language

A programming language with many commands and features designed to make common tasks easier to program. Any high level functionality is encapsulated as combinations of low level commands.

Sequencing

the application of each step of an algorithm in the order in which the statements are given.

Selection

uses a Boolean condition (a TRUE/FALSE condition) to determine which of two parts of an algorithm is used.

Iteration

the repetition of part of an algorithm until a condition is met or for a specified number of times.

Function

A piece of code that you can easily call over and over again-

API

a collection of commands made available to a programmer

Documentation

a description of the behavior of a command, function, library, API, etc.

Library

a collection of commands / functions, typically with a shared purpose

Parameter

An extra piece of information that you pass to the function to customize it for a specific need

Loop

a programming construct that repeats a group of commands.

For Loop

A particular kind of looping construct provided in many languages. Typically, a for loop defines a counting variable that is checked and incremented on each iteration in order to loop a specific number of times.