Computational Thinking and Programming Concepts

0.0(0)
studied byStudied by 0 people
0.0(0)
linked notesView linked note
call with kaiCall with Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/18

flashcard set

Earn XP

Description and Tags

These flashcards cover key vocabulary and essential concepts related to computational thinking and programming as discussed in the lecture notes.

Last updated 4:29 AM on 3/21/25
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

19 Terms

1
New cards

Computational Thinking

A problem-solving process that involves four key components: decomposition, pattern recognition, abstraction, and algorithms.

2
New cards

Decomposition

The process of breaking down a complex problem into smaller, more manageable parts.

3
New cards

Abstraction

The process of removing unnecessary details to focus on essential characteristics.

4
New cards

Algorithm

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

5
New cards

Flowchart

A visual representation of a process or algorithm, using standardized symbols to depict different types of actions.

6
New cards

Variable

A named storage location in programming that can hold a value, which may change during the execution of a program.

7
New cards

Constant

A fixed value that cannot be altered by the program during normal execution.

8
New cards

Operator

A symbol that indicates an operation performed on one or more operands; common types include arithmetic, relational, and logical operators.

9
New cards

Sequential Search

An algorithm that checks each element in a list sequentially until the desired element is found.

10
New cards

Binary Search

An efficient search algorithm that finds the position of a target value within a sorted array by repeatedly dividing the search interval in half.

11
New cards

Selection Sort

A simple sorting algorithm that divides the input list into a sorted and an unsorted sublist, repeatedly selecting the smallest (or largest) element from the unsorted sublist to add to the sorted sublist.

12
New cards

Bubble Sort

A sorting algorithm that repeatedly steps through the list, compares adjacent elements, and swaps them if they are in the wrong order.

13
New cards

Collection

A data structure that can hold multiple elements, typically allowing for operations like adding, removing, and iterating through the elements.

14
New cards

Pseudocode

A notational system used to outline an algorithm in a way that resembles programming languages but is designed to be easily understood by humans.

15
New cards

Compiler

A program that translates code written in a high-level programming language into machine code, enabling the program to be executed by the computer.

16
New cards

Interpreter

A program that translates high-level code into machine code line by line, executing each line as it is converted.

17
New cards

Precondition

A condition that must be true before a particular block of code is executed.

18
New cards

Postcondition

A condition that must be true after a block of code has executed.

19
New cards

Trace Table

A table used to track the values of variables as a program executes, helping to understand how the program flows and operates.

Explore top flashcards