1/24
Flashcards covering key concepts from the introduction to computational thinking.
Name | Mastery | Learn | Test | Matching | Spaced | Call with Kai |
|---|
No analytics yet
Send a link to your students to track their progress
Computational Thinking (CT)
A problem-solving approach that involves designing solutions so that a computer (or human) can execute them effectively.
Algorithm
A step-by-step procedure for solving a problem or performing a computation.
Procedure
A concrete implementation of an algorithm (e.g., a function or method in code).
Program
Is the actual implementation of an algorithm using programming language
Problem Decomposition
Breaking a complex problem into smaller, manageable sub-problems for easier solving.
Modular Programming
Is a programming approach where a large program is divided into smaller, manageable, and independent parts called module.
Abstraction
Focusing on essential details while ignoring unnecessary information.
Automation
Using computers or algorithms to perform tasks with minimal human intervention.
Simulation
Creating a computational model of a real or theoretical system to study its behavior over time.
Parallelization
Dividing a task into smaller tasks that run simultaneously to solve problems faster.
Data Collection
The process of gathering, organizing, and interpreting data for computational purposes.
Data Representation
The method of storing and organizing data in various forms like numbers, strings, or objects.
Data Analysis
The process of sorting, searching, and identifying patterns in the collected data.
Finiteness
A characteristic of an algorithm that ensures it terminates after a finite number of steps.
Definiteness
A characteristic of an algorithm where each step is precisely defined.
Effectiveness
A property of algorithm steps that must be basic enough to be executed manually or computationally.
Input and Output
Accepts input and produces output
Modular Programming
A programming approach where a large program is divided into smaller, manageable, and independent parts called modules.
Multithreading
It allows a program to execute multiple tasks concurrently in a single JVM
Distributed System
Involves multiple computers (nodes) working together to perform a tasks
Pseudocode
A high-level description of an algorithm that uses plain language and is easily understandable.
Flowchart
A diagram-based representation of a process or algorithm.
Data Parallelism
Performing the same operation on different pieces of data simultaneously.
Task Parallelism
Different tasks performed at the same time rather than the same tasks on different data.