Program structure
This control structure repeats a block of code as long as a certain condition is true.
What is a Loop?
An algorithm that checks every element in a list one by one until the target is found.
What is Linear/Sequential Search?
This data structure is an ordered collection of elements, often accessed by a numerical index.
What is a List?
This base-2 numbering system is the foundation of all digital data.
What is Binary?
This is a reusable block of code that performs a specific task and can be "called" by name.
What is a Procedure/Function?
The three basic building blocks of algorithms are sequencing, selection, and this
What is Iteration?
This efficient search algorithm requires the list to be sorted before it can start.
What is Binary Search?
This process involves reducing complexity by hiding details and focusing on the "what" rather than the "how."
What is Abstraction?
This mathematical operator returns the remainder of a division problem.
What is Modulus?
These are the specific values passed into a procedure to help it perform its task.
What are Parameters?
This type of statement uses "If-Then" logic to decide which part of a program to execute.
What is a Conditional (or Selection) statement?
In a list, this is the specific number used to identify the position of an element.
What is an Index?
This error occurs when a program attempts to access an element at an index that does not exist in a list
What is an Index Out of Bounds error?
This term describes an algorithm that is "good enough" to find a solution when an exact one is computationally too expensive.
What is a Heuristic?
This type of variable is declared inside a procedure and cannot be accessed by the rest of the program.
This is the result of an iterative process that never reaches its termination condition, causing a program to freeze.
What is an Infinite Loop?
This term describes a data structure where each element points to the next one in the sequence, allowing for efficient insertion and deletion of items.
What is a Linked List?
This refers to the practice of using a descriptive name for a value that never changes throughout the program's execution.
What is a Constant?
This is the name for a problem for which no algorithm can be constructed that always leads to a correct yes-or-no answer.
What is an Undecidable Problem?
This programming concept allows a procedure to call itself to solve smaller sub-problems.
What is Recursion?
This logical operator returns True only if both inputs are true; if one is false, the whole expression is false.
What is AND?
This type of non-linear data structure consists of "nodes" connected by "edges," often used to represent social networks or flight paths between cities.
What is a Graph?
This term refers to the process of accessing every element in a data structure (like a list) exactly once, often to perform a calculation or search.
What is Traversing?
This is the measure of how many steps an algorithm takes to complete based on the size of the input, often expressed using Big O notation.
What is Computational Complexity?
This is the term for the unintended consequences of a procedure, such as modifying a global variable that wasn't passed as a parameter.
What are Side Effects?