APCSP Unit 10 Algorithm Vocabulary

What is a Problem in the context of algorithms?

• A specific task to be solved using a computational method

• A type of data structure

• A programming language

• A software application

An algorithm is defined as:

• A step-by-step procedure for solving a problem or accomplishing a task

• A random guess

• A type of hardware

• A programming language

Sequencing in algorithms refers to:

• The order in which instructions are executed

• The process of finding errors in code

• The method of organizing data

• The technique of optimizing code

Selection in the context of algorithms refers to the process of:

• choosing the best option from a set of alternatives

• sorting a list of elements

• searching for an element in a list

• inserting an element into a data structure

What is Iteration in algorithms?

• A process of repeating a set of instructions a specified number of times or until a condition is met.

• A method to sort data in ascending order.

• A technique to store data in a database.

• A way to encrypt data for security purposes.

Efficiency in the context of algorithms is defined as:

• The amount of time an algorithm takes to complete.

• The amount of memory an algorithm uses.

• The amount of time and memory an algorithm uses.

• The complexity of the algorithm's code.

Describe Linear Search as per the vocabulary list.

• Linear Search is a method for finding a target value within a list by checking each element sequentially.

• Linear Search is a method for finding a target value within a list by dividing the list into two halves.

• Linear Search is a method for finding a target value within a list by using a hash table.

• Linear Search is a method for finding a target value within a list by using a binary tree.

What is a Binary Search according to the vocabulary list?

• A method for finding a specific value in a sorted array by repeatedly dividing the search interval in half

• A technique for sorting elements in an array

• A way to traverse a binary tree

• A method for encrypting data

Reasonable Time in the context of algorithms is defined as:

• The time taken by an algorithm that is polynomial in relation to the input size.

• The time taken by an algorithm that is exponential in relation to the input size.

• The time taken by an algorithm that is constant regardless of the input size.

• The time taken by an algorithm that is logarithmic in relation to the input size.

Unreasonable Time in algorithms refers to the time complexity that is considered impractical for large input sizes. Which of the following time complexities is generally considered unreasonable?

• O(n log n)