Introduction to Computational Thinking

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

1/24

flashcard set

Earn XP

Description and Tags

Flashcards covering key concepts from the introduction to computational thinking.

Last updated 4:11 PM on 4/17/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

25 Terms

1
New cards

Computational Thinking (CT)

A problem-solving approach that involves designing solutions so that a computer (or human) can execute them effectively.

2
New cards

Algorithm

A step-by-step procedure for solving a problem or performing a computation.

3
New cards

Procedure

A concrete implementation of an algorithm (e.g., a function or method in code).

4
New cards

Program

Is the actual implementation of an algorithm using programming language

5
New cards

Problem Decomposition

Breaking a complex problem into smaller, manageable sub-problems for easier solving.

6
New cards

Modular Programming

Is a programming approach where a large program is divided into smaller, manageable, and independent parts called module.

7
New cards

Abstraction

Focusing on essential details while ignoring unnecessary information.

8
New cards

Automation

Using computers or algorithms to perform tasks with minimal human intervention.

9
New cards

Simulation

Creating a computational model of a real or theoretical system to study its behavior over time.

10
New cards

Parallelization

Dividing a task into smaller tasks that run simultaneously to solve problems faster.

11
New cards

Data Collection

The process of gathering, organizing, and interpreting data for computational purposes.

12
New cards

Data Representation

The method of storing and organizing data in various forms like numbers, strings, or objects.

13
New cards

Data Analysis

The process of sorting, searching, and identifying patterns in the collected data.

14
New cards

Finiteness

A characteristic of an algorithm that ensures it terminates after a finite number of steps.

15
New cards

Definiteness

A characteristic of an algorithm where each step is precisely defined.

16
New cards

Effectiveness

A property of algorithm steps that must be basic enough to be executed manually or computationally.

17
New cards

Input and Output

Accepts input and produces output

18
New cards
19
New cards

Modular Programming

A programming approach where a large program is divided into smaller, manageable, and independent parts called modules.

20
New cards

Multithreading

It allows a program to execute multiple tasks concurrently in a single JVM

21
New cards

Distributed System

Involves multiple computers (nodes) working together to perform a tasks

22
New cards

Pseudocode

A high-level description of an algorithm that uses plain language and is easily understandable.

23
New cards

Flowchart

A diagram-based representation of a process or algorithm.

24
New cards

Data Parallelism

Performing the same operation on different pieces of data simultaneously.

25
New cards

Task Parallelism

Different tasks performed at the same time rather than the same tasks on different data.