CS Principles Unit 6 Assessment

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

• Problem

• Algorithm

• Sequencing

• Iteration

A finite set of instructions that accomplish a task.

• Problem

• Algorithm

• Sequencing

• Iteration

_________ is an informal language that helps programmers develop algorithms, literally means “fake code.” Its like writing code for yourself before writing it in proper program language format.

• Problem

• Algorithm

• Pseudocode

• Iteration

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

• Binary Search

• Pseudocode

• Iteration

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.

• Linear Search

• Binary Search

• Pseudocode

• Iteration

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

• Problem

• Algorithm

• Pseudocode

• Efficiency

Any algorithm whose efficiency includes an n2, n3, n4 … is called ___________.

• Problem

• Polynomial

• Pseudocode

• Efficiency

Any algorithm whose efficiency includes an 2n, 3n, 4n … is called ______________.

• Problem

• Polynomial

• Exponential

• Efficiency

Algorithms with a polynomial efficiency or lower (constant, linear, square, cube, etc.) are said to run in a reasonable amount of time.

• Reasonable Time

• Unreasonable Time

Algorithms with exponential or factorial efficiencies are examples of algorithms that run in an unreasonable amount of time.

• Reasonable Time

• Unreasonable Time