Introduction to Computer Science and Python Basics Vocabulary

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

1/19

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards covering core computational thinking principles, historical computer architectures, language structures, and fundamental Python concepts.

Last updated 8:34 PM on 9/18/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

20 Terms

1
New cards

Declarative Knowledge

Knowledge composed of statements of fact, such as "the square root of xx is a number yy such that y×y=xy \times y = x".

2
New cards

Imperative Knowledge

"How to" knowledge, or recipes for deducing information.

3
New cards

Algorithm

A finite list of instructions describing a set of computations that when executed on a set of inputs will proceed through a sequence of well-defined states and eventually produce an output.

4
New cards

Fixed-Program Computer

A computer designed to solve a specific mathematical problem whose program cannot be changed without replacing its circuitry.

5
New cards

Stored-Program Computer

A computer that stores and manipulates a sequence of instructions in memory and has components that execute any instruction in that sequence.

6
New cards

Interpreter

The heart of a stored-program computer that can execute any legal set of instructions, allowing it to compute anything described by those instructions.

7
New cards

Program Counter

A component that points to a particular location in memory from which computation starts or continues.

8
New cards

Flow of Control

The order in which instructions are executed in a program, which may jump to different points based on the results of tests.

9
New cards

Universal Turing Machine

A hypothetical computing device described by Alan Turing in 1936 featuring unlimited memory on a "tape" and simple primitive instructions.

10
New cards

Church-Turing Thesis

A thesis stating that if a function is computable, a Turing Machine can be programmed to compute it.

11
New cards

Halting Problem

The uncomputable problem demonstrated by Alan Turing showing it is impossible to write a program that takes an arbitrary program as input and determines if it will run forever.

12
New cards

Turing Complete

A property of a programming language indicating that it can be used to simulate a Universal Turing Machine.

13
New cards

Syntax

The rules in a language that define which strings of characters and symbols are well formed.

14
New cards

Static Semantics

The rules in a language that define which syntactically valid strings have a meaning.

15
New cards

Semantics

The meaning associated with each syntactically correct string of symbols that has no static semantic errors.

16
New cards

Scalar Objects

Indivisible data objects in Python, considered the atoms of the language, such as int, float, bool, and None.

17
New cards

Non-Scalar Objects

Data objects in Python that possess internal structure, such as strings.

18
New cards

Statement

A command that instructs the Python interpreter to perform an action, such as executing a print function.

19
New cards

Variable

A name that is bound or associated with an object in Python via an assignment statement.

20
New cards

Integrated Development Environment (IDE)

An application suite that provides a text editor with features like syntax highlighting and autocompletion, a shell, and an integrated debugger.