AP CSP Notes

Heuristic

A "good enough" solution used in situations where the most efficient solution is unattainable, commonly applied in computer science to answer complex questions efficiently.

Traveling Salesman Problem

A classic problem in computer science and algorithms that involves finding the shortest route that visits a set of given cities exactly once and returns to the original city.

Linear Search

A search algorithm that looks through unsorted data one by one, making it slow when dealing with large datasets.

Binary Search

An efficient search algorithm for sorted data that repeatedly divides the search interval in half, making it much faster than linear search.

Parallel Programming & Speedup

Parallel programming involves executing multiple steps simultaneously, leading to a speedup in processing time compared to sequential execution.