Unit 1: Computational Thinking

Question 1

A finite set of instructions that accomplish a specific task

Answer 1

Algorithm

Question 2

A password that is easy for a user to remember but would be difficult for someone else to guess based on knowledge of that user

Answer 2

Strong Password

Question 3

The process of reducing complexity by focusing on the main idea

Answer 3

Abstraction

Question 4

The application of each step of an algorithm in the order in which the code statements are given

Answer 4

Sequencing

Question 5

Determines which parts of an algorithm are executed based on a condition being true or false

Answer 5

Selection

Question 6

A repeating portion of an algorithm

Answer 6

Iteration

Question 7

The process of encoding data to prevent unauthorized access

Answer 7

Encryption

Question 8

The process of decoding the data

Answer 8

Decryption

Question 9

Used to implement algorithms executed by programs

Answer 9

Programming Languages

Question 10

A general description of a task that can (or cannot) be solved algorithmically

Answer 10

Problem

Question 11

A specific task that needs to be solved with specific input

Answer 11

Instance of a Problem

Question 12

A problem with a yes/no answer

Answer 12

Decision Problem

Question 13

A problem with the goal of finding the “best” solution among many

Answer 13

Optimization Problem

Question 14

A decision problem for which an algorithm can be written to produce a correct output for all inputs

Answer 14

Decidable Problem

Question 15

One in which no algorithm can be constructed that always leads to a correct yes-or-no answer

Answer 15

Undecidable Problem

Question 16

The capacity for a system to change in size and scale to meet new demands

Answer 16

Scalability

Question 17

An estimation of the amount of computational resources used by an algorithm

Answer 17

Efficiency

Question 18

Search algorithms that check each element of a list, in order, until the desired value is found or all aspects in the list have been checked

Answer 18

Linear or Sequential Search

Question 19

A search algorithm that starts at the middle of a sorted data set of numbers and eliminates half of the data; this process repeats until the desired value is found or all elements have been eliminated

Answer 19

Binary Search

Question 20

An approach to a problem that produces a solution that is not guaranteed to be optimal but may be used when techniques that are guaranteed to always find an optimal solution are impractical

Answer 20

Heuristic

Question 21

Bias embedded into algorithms and any level of software development

Answer 21

Algorithmic Bias

Question 22

What type of pattern is this:
I
I
I
I ————————————————————–>
L _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _

Answer 22

Constant

Question 23

What type of pattern is this:
I
I ___________________——————————–>
I /
I /
L _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _

Answer 23

Logarithmic

Question 24

What type of pattern is this:
I ^
I /
I /
I /
L _ _ _ _ _ _ _ _

Answer 24

Linear

Question 25

What type of pattern is this:
I ^
I /
I /
I __________________———————-/
L _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _

Answer 25

Quadratic

Question 26

What are the steps of the development process?

Answer 26

1. Designing
2. Testing
3. Investing & Reflection

Question 27

What are the critical features of High-Level Programming?

Answer 27

Easy for us, difficult for computers, unambiguous.

Question 28

What are the critical features of Low-Level Programming?

Answer 28

Easy for computers, difficult for us, unambiguous

Question 29

What is Moore’s Law?

Answer 29

The observation that the number of transistors in an integrated circuit doubles about every two years.

Question 30

Field of coding specializing in encryption/decryption

Answer 30

Cryptography

Question 31

Word for code/algorithms that are unclear or inexact

Answer 31

Ambiguous