Unit 3 Algorithms and Programming

Question 1

____________ a way to represent essential features without including the background details or explanation.

Answer 1

abstraction

Question 2

what is the purpose of an abstraction?

Answer 2

to hide coding details so they can focus on the current problem, makes more efficient software systems

Question 3

no abstractions = ___________

Answer 3

binary machine code

Question 4

make variables meaningful. Variables are values that can be __________

Answer 4

changed

Question 5

MOD (modulus) %
4MOD2 = 0
6MOD0 = __________ error
0MOD6 = 0
3MOD4 = 3

Answer 5

remainder, divide by zero error

Question 6

__________ data abstraction that reduces complexity of a program by giving a collection of data a name without specific details

Answer 6

list

Question 7

=, <, >…
used to ___________

Answer 7

test the relationship between two variables

Question 8

___________ a data type that has only two possible values, true or false

Answer 8

Boolean value

Question 9

if the robot moves beyond the grid, _____________

Answer 9

the robot will stay in the current condition and the program will terminate

Question 10

Rotation is always ___________

Answer 10

relative to where the robot is facing

Question 11

Steps to SWAP (common algorithm)
1.
2.
3.

Answer 11

create a temporary variable used to store the value of the first item in the list ex: temp = animal[1]

replace ex: animal[1] = animal[3]

replace to temp ex: animal[3] = temp

Question 12

_____________ an algorithm for finding an element in a list

Answer 12

linear search, sequential search

Question 13

Sequential search - search starts from the ________________________

Answer 13

beginning of a list and sequentially checks each element until a match is found OR until the entire list is searched without finding it

Question 14

Sequential search can be used for a _________ or ________ list

Answer 14

sorted, unsorted

Question 15

Best scenario is sequential search is to ____________
Worse is _______-

Answer 15

find the it in the 1st comparison
find it in the last comparison

Question 16

_______________ halves the number of elements that need to be searched after every comparison

Answer 16

binary search

Question 17

in a binary search the list must be ___________. It compares the _____________ to the target value. if it is not equal then ________________ is eliminated.

Answer 17

sorted, middle, half in which the target cannot lie

Question 18

look in notes for examples.

Answer 18

look

Question 19

__________ adding strings

Answer 19

concatenation

Question 20

__________ only look for approximate solutions, tend to take less time

Answer 20

heuristics, heuristic search

Question 21

programs can be developed for
- _________
- satisfy personal curiosity
- create new knowledge
- _________-

Answer 21

creative expression, solve problems

Question 22

What is a variable?

Answer 22

An abstraction inside a program that can hold value, which can be a list or other collection containing multiple values.

Question 23

What is the purpose of meaningful names in programming?

Answer 23

To enhance code readability and maintainability.

Question 24

If A <- 1, b <- a, a <- 2, what will be the final values of a and b?

Answer 24

a = 2, b = 1.

Question 25

What is a procedure in programming?

Answer 25

A set of instructions that can be called to perform a specific task.

Question 26

What are parameters in a procedure?

Answer 26

Variables that are passed to a procedure when it is called.

Question 27

Fill in the blank: An ________ is a set of instructions to accomplish a specific task.

Answer 27

[algorithm]

Question 28

What does sequencing mean in programming?

Answer 28

Executing code statements in the order they are given.

Question 29

What is an example of an expression?

Answer 29

x = 5, y = 3, result = x * y + 10, print(result).

Question 30

How is modulus represented in code?

Answer 30

With a percent sign, e.g., z % y.

Question 31

What does the modulus operator do?

Answer 31

It returns the remainder of a division.

Question 32

List the arithmetic operators.

Answer 32

* / - division returns to a float * // - floor division returns the integer part * % - modulus returns the remainder * ** - exponentiation raises the number to the power.

Question 33

What does the comparison operator '==' signify?

Answer 33

It checks if two values are equal.

Question 34

What is the logical operator 'And' used for?

Answer 34

It returns true if both operands are true.

Question 35

True or False: The assignment operator '=' performs a simple assignment.

Answer 35

True.

Question 36

What is string concatenation?

Answer 36

Joining two or more strings end to end to create a new string.

Question 37

What is a substring?

Answer 37

Part of an existing string.

Question 38

What is the purpose of the command 'Brain.Screen.print("hello")'?

Answer 38

To print 'hello' on the screen.

Question 39

What is a decision problem?

Answer 39

A problem that has a yes/no answer.

Question 40

What is an optimization problem?

Answer 40

A problem with the goal of finding the 'best' solution among many.

Question 41

Fill in the blank: Efficiency is an estimation of the amount of _______ used by an algorithm.

Answer 41

[computational resources]

Question 42

What types of algorithms are said to run in a reasonable amount of time?

Answer 42

Algorithms with polynomial efficiency (constant, linear, square, cube).

Question 43

What is a heuristic?

Answer 43

an approach to a problem that produces a solution that is not guaranteed to be optimal but may be used when other solutions are impractical.

Question 44

Define a decidable problem.

Answer 44

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

Question 45

Define an undecidable problem.

Answer 45

A problem where no algorithm can be constructed that always provides a correct yes or no answer.

Question 46

comparison operators == - ________ != _________ >= greater than or equal to <= less than or equal to

Answer 46

equal to, not equal to