Principles Unit 10 - Algorithm and Computing Vocabulary

What is an Algorithm?

• A step-by-step procedure for solving a problem

• A type of computer hardware

• A programming language

• A software application

What is Iteration in the context of algorithms?

• A process of repeating a set of instructions until a condition is met

• A method of organizing data in a hierarchical structure

• A technique for finding the shortest path in a graph

• A way to encrypt data for secure communication

Define Problem in terms of algorithms.

• A problem is a set of instructions for solving a task.

• A problem is a question or task that requires a solution.

• A problem is a type of algorithm.

• A problem is a solution to an algorithm.

What does Selection mean in algorithmic processes?

• A process of choosing the best option from a set of alternatives

• A method to sort data in ascending order

• A technique to search for an element in a list

• A way to iterate over elements in a collection

Sequencing in algorithms is the process of:

• arranging the steps in a specific order

• executing steps in parallel

• randomly selecting steps to execute

• ignoring the order of steps

What is a Binary Search?

• A search algorithm that finds the position of a target value within a sorted array

• A method of searching that checks each element in sequence until the desired element is found

• A search algorithm that uses a hash table to find the target value

• A method of searching that uses a linear approach

Efficiency in algorithms is measured by:

• Time complexity and space complexity

• The number of lines of code

• The programming language used

• The speed of the computer

Linear Search is a search algorithm that:

• searches for an element in a sorted array

• searches for an element in an unsorted array

• searches for an element using binary search

• searches for an element using hash tables

What is meant by Reasonable Time in algorithms?

• The time taken by an algorithm to execute on a quantum computer

• The time taken by an algorithm to execute on a supercomputer

• The time taken by an algorithm to execute within polynomial time

• The time taken by an algorithm to execute within exponential time

What is Unreasonable Time in the context of algorithms?

• A time complexity that is considered efficient for practical use

• A time complexity that grows exponentially and is impractical for large inputs

• A time complexity that is constant and does not depend on input size

• A time complexity that is linear and scales with input size