Computational Thinking

Heuristic

• Provides a "good enough" solution to a problem when an actual solution is impractical or impossible

• Problem for which no algorithm can be constructed that is always capable of providing a correct yes-or-no answer

• A search algorithm that starts at the middle of a sorted set of numbers and removes half of the data; this process repeats until the desired value is found or all elements have been eliminated.

• a search algorithm which checks each element of a list, in order, until the desired value is found or all elements in the list have been checked.

Binary Search

• Provides a "good enough" solution to a problem when an actual solution is impractical or impossible

• Problem for which no algorithm can be constructed that is always capable of providing a correct yes-or-no answer

• A search algorithm that starts at the middle of a sorted set of numbers, removes half of the data; repeats until the desired element is found or all elements have been eliminated.

• A search algorithm which checks each element of a list, in order, until the desired value is found or all elements in the list have been checked.

Linear Search

• Provides a "good enough" solution to a problem when an actual solution is impractical or impossible

• Problem for which no algorithm can be constructed that is always capable of providing a correct yes-or-no answer

• A search algorithm that starts at the middle of a sorted set of numbers, removes half of the data; repeats until the desired element is found or all elements have been eliminated.

• A search algorithm which checks each element of a list, in order, until the desired value is found or all elements in the list have been checked.

A measure of how many steps are needed to complete an algorithm.

• Efficiency

• Sequencing

• Algorithm

• Problem

A general description of a task that can (or cannot) be solved with an algorithm

• Efficiency

• Sequencing

• Algorithm

• Problem

A set of commands that must be followed for a computer to perform calculations or other problem-solving operations.

• Efficiency

• Sequencing

• Algorithm

• Problem

A program may need to ask a question because it has reached a step where one or more options are available. Depending on the answer given, the program will follow a certain step and ignore the others.

• Iteration

• Sequencing

• Algorithm

• Selection

A function that repeats a block of code in a specified order, often until a specific result occurs.

• Iteration

• Sequencing

• Algorithm

• Selection

A problem-solving method using computer science techniques, where possible solutions are developed and presented in a way that can be understood by humans and computers.

• Computational Thinking

• Syntax

• Function

• Abstraction

A computer language set of rules that defines the combinations of symbols that are considered to be correctly structured statements or expressions in that language.

• Computational Thinking

• Syntax

• Function

• Abstraction