Section 4: Computational Thinking and Programming Logic Flashcards

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

1/61

flashcard set

Earn XP

Description and Tags

Vocabulary flashcards covering computational thinking, algorithm characteristics, SDLC phases, flowchart symbols, data types, and specific data structure operations discussed in the Section 4 lecture notes.

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

No analytics yet

Send a link to your students to track their progress

62 Terms

1
New cards

Computer programming

The process of writing code that tells a computer, application, or software program what to do.

2
New cards

Variables

Named storage locations that hold a value or an object which can be changed.

3
New cards

Algorithms

A series of steps followed to solve a problem or complete a task, similar to a recipe in cooking.

4
New cards

Flowcharts

Graphical representations of algorithms that use shapes and arrows to illustrate the sequence of steps.

5
New cards

Pseudocode

The use of plain text or English to write algorithm instructions rather than using actual code.

6
New cards

SDLC (Software Development Life Cycle)

A structured process used by software developers and project managers to design, develop, test, and deploy software.

7
New cards

Data types

A label or category that tells a computer what kind of data is being worked with, such as integers or strings.

8
New cards

Data structures

A way of organizing and storing collections of data so that it can be used efficiently.

9
New cards

Arrays

A data structure that stores a collection of the same elements, typically of the same data types, in a specific order.

10
New cards

camelCase

A way to separate words in a phrase by capitalizing the first letter of the second and subsequent words without using spaces.

11
New cards

Definiteness

A key characteristic where each algorithm step must be precise, leaving no room for interpretation or uncertainty.

12
New cards

Finiteness

A key characteristic where an algorithm must eventually terminate after a finite number of operations.

13
New cards

Search Algorithms

A step-by-step method for locating specific elements in a data set.

14
New cards

Sorting Algorithms

Algorithms that put elements of a list into a specific order, such as alphabetical or numerical.

15
New cards

Encryption Algorithms

Algorithms that encode or hide data to make it more secure during storage or transmission.

16
New cards

Terminator Symbol

A flowchart symbol that shows where a process begins (Start) or ends (Stop).

17
New cards

Input/Output Symbol

A parallelogram shape in a flowchart used to show any action where information is taken in or given out.

18
New cards

Processing Symbol

A rectangular box in a flowchart that performs math operations like addition, subtraction, division, and multiplication.

19
New cards

Decision Symbol

A diamond shape in a flowchart used to show a choice with two different outcomes based on the decision.

20
New cards

Problem Analysis

The first step in developing software where a systems analyst works with a client to understand the purpose and requirements of a project.

21
New cards

Wireframes

Simple sketches used during the design phase to show how the user interface (UI) will be laid out.

22
New cards

Debugging

The process of identifying and correcting errors in code.

23
New cards

Syntax error

An error in the spelling or grammar of the code, such as incorrectly entering the command word 'print' as 'pront'.

24
New cards

Normal data

Data that a program is designed to accept as valid input during testing.

25
New cards

Extreme data

Test data that lies on the boundary of what is considered normal, such as a score of 0%0\% or 100%100\%.

26
New cards

Exceptional data

Data that is out of range or invalid, such as entering a negative number or text where a number is expected.

27
New cards

Run-time error

An error that occurs while the program is running, such as a crash caused by attempting to divide by zero.

28
New cards

Logic error

A mistake in the design or formula of a program that causes it to produce incorrect results even if the code runs.

29
New cards

Integer (int)

A Python data type used for whole numbers.

30
New cards

Floating-point (float)

A Python data type used for numbers with decimals, also referred to as real values.

31
New cards

Boolean (bool)

A Python data type that stores one of two values: True or False.

32
New cards

String (str)

A Python data type that stores a sequence of characters, often enclosed in quotes.

33
New cards

type()

A Python function used to check the data type of a variable.

34
New cards

Linear data structure

A structure where elements are arranged on a straight path and connected end-to-end, such as arrays and stacks.

35
New cards

Non-linear data structure

A structure where data elements are not organized sequentially but in an interconnected manner, such as trees and graphs.

36
New cards

Traversing

The term for iterating over or moving through a collection of data elements.

37
New cards

Static data structures

Data structures with a fixed size where memory is allocated at compile time.

38
New cards

Dynamic data structures

Data structures with a size that can change during run time to accommodate different data requirements.

39
New cards

Subscript (Index)

A unique number assigned to each element in an array to help find its specific position, starting at index 00.

40
New cards

Parallel arrays

Multiple arrays used to represent related data where each index in one array corresponds to the same index in others.

41
New cards

2D Array

A multi-dimensional array with rows and columns, forming a grid-like structure accessed using two indices (r, c).

42
New cards

Linked List

A dynamic data structure where each item (node) contains both data and a pointer to the next item.

43
New cards

Singly Linked List

A uni-directional linked list that can only point to the next node, not the previous one.

44
New cards

Doubly Linked List

An advanced linked list where each node contains data, a pointer to the next node, and a pointer to the previous node.

45
New cards

Stack

A LIFO list where items are only added (pushed) or removed (popped) from the top.

46
New cards

LIFO

Last In, First Out; the principle governing stacks where the last item added is the first one removed.

47
New cards

Stack Overflow

An error that occurs when new data is added to a stack past the specified End pointer.

48
New cards

Stack Underflow

An error that occurs when data is attempted to be popped below the Bottom pointer of a stack.

49
New cards

Queue

A FIFO list where items are added at one end (rear) and removed from the other (front).

50
New cards

FIFO

First In, First Out; the principle governing queues where the first item entered is the first one processed.

51
New cards

Enqueuing

The process of adding an item to the end of a queue.

52
New cards

Dequeuing

The process of removing an item from the front of a queue.

53
New cards

Graph

A collection of nodes (vertices) connected by lines (edges) used to model relationships.

54
New cards

IDE (Integrated Development Environment)

Software that combines code editing, compiling, and debugging functions in one place, such as IDLE or PyCharm.

55
New cards

Assignment Operator

The Python symbol == used to store a value in a variable.

56
New cards

Concatenation

The process of joining two variables or strings together, often using the ++ symbol.

57
New cards

Equality Comparison

The Python operator ==== used to check if two values are equal.

58
New cards

f-string

A formatted string literal in Python created by placing the letter 'f' before quotes to embed variables in braces {}\{\}.

59
New cards

Swap Algorithm

An algorithm used to exchange the values of two variables, often utilizing a 'Temporary' variable as a placeholder.

60
New cards

if/else statement

A programming construct used for conditional execution, telling the computer what to do based on whether a condition is true or false.

61
New cards

len()

A Python function used to determine the total number of items in an array or list.

62
New cards

count()

A Python list method that returns the number of occurrences of a specific value in the list.