Computational Thinking Flashcards

Front

Abstraction

Back

Simplifying a problem by considering only the necessary details required to obtain a solution, leaving a representation without unnecessary details.

Front

Data Abstraction

Back

The storage and representation of data in a computer system along with its logical description and interaction with operators, such as stacks, queues, and integers.

Front

Graph Theory

Back

A branch of mathematics used to abstractly represent problems using a collection of nodes connected by edges.

Front

Caching

Back

The temporary storage of data by the system in cache or memory for faster retrieval if needed again in the future.

Front

Inputs

Back

Any information relevant to the problem required by the system for processing according to an algorithm.

Front

Outputs

Back

The result returned by a system for a given input after running the entire process or part of a process.

Front

Preconditions

Back

A prerequisite or state of a system and its surroundings required to run a use case and return a valid solution.

Front

Reusable Program Components

Back

Components that have already been written, debugged, and tested, which can be transplanted into new systems to save development time in project completion.

Front

Procedural Abstraction

Back

Achieving a task by relying on a procedure of sequential steps.

Front

Components of a Problem

Back

The smaller, simpler series of tasks and sub-procedures a problem can be broken down into to be completed modularly.