APCSP Unit 4 Vocab List

(from 2025)

Append

To add an element to the end of a list.

Arguments

Specifies the values of the parameters when a procedure is called.

Index

A data structure within a list that gives each element a value and position, making it easier to locate it.

Insert

To add an element to a data structure at a specific position without automatically moving to the top or bottom.

Length

The number of elements in a list.

Parallel Lists

Two different lists that organize the same information in different ways while referencing the same elements.

Parameters

Input variables for a procedure.

Binary Search

A search algorithm that repeatedly divides a sorted list to narrow in on the searched-for item.

Decidable Problems

Problems for which an algorithm can be constructed to answer 'yes' or 'no' for all inputs.

Distributed Computing

A computational model in which multiple networked computers run a program.

Efficiency

How well an algorithm uses time, memory/space resources, CPU, and RAM.

Heuristic Algorithm

An algorithm that finds an approximate solution for a hard problem, useful for obtaining a solution in reasonable time.

Linear or Sequential Search

An algorithm that checks every element in a list from start to end to find an item.

Parallel Computing

A computational model where a problem is divided into smaller sequential operations performed simultaneously.

Sequential Computing

A computational model in which operations are performed in order, one at a time, on a single processor.

Bubble Sort

An algorithm that compares items in a list, replacing them until the list is sorted.

Bucket Sorting

An algorithm that divides lists into smaller categories and merges them into a specific ordered list.

Merge Sort

An algorithm that splits lists into pairs, compares them, and eventually compiles them into one sorted list.

Undecidable Problems

Problems that cannot be solved by an algorithm that reliably gives a correct yes-or-no answer.

Brute Force

A problem-solving approach that involves trial and error, trying every possible solution.

Intractable

Describes a problem that is not easily manageable and often requires brute force to solve.

Intractable Problems

Problems that are practically impossible to solve efficiently.

The Halting Problem

An undecidable problem of determining if a computer program will produce an answer or loop forever on a given input.

The Traveling Salesman Problem

A problem that involves finding the shortest path visiting a list of cities once and returning to the start.