CSP Unit 1 Vocab

0.0(0)
studied byStudied by 0 people
0.0(0)
call with kaiCall with Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/20

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 10:32 PM on 1/27/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

21 Terms

1
New cards

strong password

Protects computers and keeps privacy.

2
New cards

algorithm

A list of steps needed to complete a task. A step-by-step procedure for solving a problem.

3
New cards

abstraction

The process of reducing complexity by focusing on the main idea.

4
New cards

sequencing

The application of each step of an algorithm. It's in the order in which the code statements are given.

5
New cards

selection

Determines which parts of the algorithm are executed based on a condition being true or false.

6
New cards

iteration

A repeating portion of an algorithm.

7
New cards

encryption

The process of encoding the data to prevent unauthorized access.

8
New cards

decryption

The process of decoding the data.

9
New cards

programming language

Is a formal artificial language that allows humans to give instructions to the computer.

10
New cards

problem

A general description of a task that can or cannot be solved algorithmically.

11
New cards

instance of a problem

A specific task that needs to be solved with a specific input.

12
New cards

decision problem

A problem with a yes/no answer.

13
New cards

optimization problem

A problem with the goal of finding the 'best' solution among many.

14
New cards

decidable problem

A decision problem for which an algorithm can be written to produce a correct output for all inputs.

15
New cards

undecidable problem

A problem which no algorithm can be constructed that always leads to a correct yes-or-no answer.

16
New cards

scalability

The capacity for a system to change in size and scale to meet new demands.

17
New cards

efficiency

An estimation of the amount of computational resources used by an algorithm. Expressed as a function of a size of the input.

18
New cards

linear or sequential search

Are algorithms that check each element of a list, in order, until the desired value is found or all elements in the list have been checked off.

19
New cards

binary search

An algorithm that starts at the middle of a sorted data set of numbers and eliminates half of the data. This process repeats until the desired value is found or all elements have been eliminated.

20
New cards

heuristic

Is any approach to problem solving, learning, or discovery that employs a practical method not guaranteed to be optimal or perfect, but sufficient for the immediate goal.

21
New cards

algorithmic bias

Occurs when a computing innovation systematically discriminates against certain individuals or groups to create unfair outcomes for some and favorable for others.