Computer Science Concepts and Terminology

0.0(0)
Studied by 4 people
call kaiCall Kai
Locked
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/25

flashcard set

Earn XP

Description and Tags

A set of vocabulary flashcards covering foundational computer science terms, data structures, and control flow concepts from the lecture notes.

Last updated 12:18 AM on 9/15/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

26 Terms

1
New cards

Procedures

A named sequence of instructions that may take inputs and may report a value. Some languages call procedures methods or functions.

2
New cards

List

An ordered sequence of items.

3
New cards

Strings

An ordered sequence of characters.

4
New cards

Prototype

A function declaration, an object inheritance mechanism, or an early model of software.

5
New cards

Expression

A constant value or a call to a reporter block, including its inputs.

6
New cards

Parameter

The input name set in a procedure or block definition. Also called a formal parameter; the name stays the same each time the block runs.

7
New cards

Argument

The actual input value supplied when a procedure or block runs. Also called an actual argument; the value can be different each time.

8
New cards

Iteration

A repeating program structure, also called looping or repetition. Code may repeat forever, a specific number of times, or until a condition is met.

9
New cards

Boolean

A value that is either true or false.

10
New cards

Predicate

A reporter that asks a true-or-false question and reports a Boolean value.

11
New cards

Abstraction

Hiding details so you can focus on the important parts of a problem.

12
New cards

Procedural Abstraction

Uses named procedures to break a large problem into smaller subproblems.

13
New cards

Infinite Loop

A sequence of computer instructions that repeats forever.

14
New cards

Modulus

An operation that finds the remainder left over after dividing one number by another.

15
New cards

Code Segment

A sequence of connected instructions that carries out a purposeful action. Instructions run in order, from top to bottom.

16
New cards

Operators

Symbols or keywords that tell the computer to perform a specific action on one or more values, called operands.

17
New cards

Readability

How easily and quickly a developer can read, understand, and modify source code.

18
New cards

Traverse

To look at each item in a list. Traversal uses iteration; a for-each loop visits items without explicitly using index numbers.

19
New cards

Index

The position number of an item in a list or a character in a string. In Snap! and AP exam pseudocode, list indices start at 1 and cannot exceed the list length.

20
New cards

Element

An item in a list. Each element has a unique index (position); repeated values still count as separate elements.

21
New cards

Sublist

A list used as an item of another list. The term can also refer to a portion of a list.

22
New cards

Data Abstraction

The creation and use of abstract data types in a program, hiding details of how the data is represented and accessed.

23
New cards

Selection

Deciding which part of an algorithm to run based on whether a condition is true or false.

24
New cards

Conditionals

Statements, such as if and if-else, that control which code runs based on a true-or-false condition.

25
New cards

Nested Conditionals

An if or if-else statement inside another conditional statement.

26
New cards

Return Statement

An instruction that ends a function and passes control, and often a value, back to the code that called it.