Big idea 3: Algorithms and programming

Question 1

sequencing

Answer 1

The sequential execution of steps in an algorithm or code in a program

Question 2

selection

Answer 2

A Boolean condition to determine which of two paths are taken in an algorithm or program.

Question 3

iteration

Answer 3

The repetition of steps in an algorithm or program for a certain amount of times or until a certain condition is met.

Question 4

linear search

Answer 4

An algorithm that iterates through each item in a list until it finds the target value.

Question 5

binary search

Answer 5

An algorithm that searches a sorted list for a value by repeatedly splitting the list in half.

Question 6

reasonable time

Answer 6

A run time for an algorithm that doesn’t increase faster than a polynomial function of the input size(like 10n, n^2). An unreasonable run time would increase super polynomially (like 2^n, n!).

Question 7

heuristic

Answer 7

A technique that helps an algorithm find a good solution in a hard problem (like always walking toward the north star when you are stuck in a forest).

Question 8

undecidable

Answer 8

A problem that is so logically difficult, we can’t ever create an algorithm that would be able to answer “yes or “no” for all inputs (like the halting problem).

Question 9

library

Answer 9

A collection of procedures that are useful in creating programs.

Question 10

API

Answer 10

Application Programming Interface, a library of procedures and a description of how to call each procedure.

Question 11

modularity

Answer 11

The separation of a program into independent modules that are each responsible for one aspect of the program’s functionality.