Variables
Abstraction
Parallel and Distributive Computing
Efficiency
Algorithmic Problems
100

List 3 types of data types that can be stored as a variable.

Strings, integers, lists, booleans, floats, etc.

100

What does abstraction mean?

The general representation of an object. By leaving unnecessary/redundant details.

100

What is the difference between parallel and distributive computing?

Parallel computing uses one computer with multiple processors. While distributive computing uses multiple computers.

100

Which search type is the most efficient? And why?

Binary search is most efficient because it follows a logarithmic pattern when searching. However, binary search cannot be used if the list is unordered.

100

What is a heuristic problem?

They are problems that give approximate solutions, because it takes too long to get the exact solution. It is not an optimal solution, but it is better than nothing.

200

How can you rewrite these scores into a list?

score1 = 500

score2 = 300

score3 = 504

score4 = 485

scoresList = [500, 300, 504, 485]

200
Why are lists considered abstractions?

Lists assign a single variable to a group of related items/data types. Rather than assigning each item to a single variable.

200

Why is sequential computing not preferred?

It is not preferred because it has a long execution time and tasks are performed one at a time.

200

What is the best-case scenario for binary and linear searches?

Binary: When the target is found in the 1st comparison.

Linear: When the target is the 1st element in the list.

200

Can an algorithm solve every problem?

No, because there are undecidable problems.

300

namesList = [Jack, Jill, Henry, Terry, Fiona]

display(namesList[4])

What is the output of the program?

Terry

300

What is the benefit of a procedural abstraction?

Procedural abstractions allow the programmer to use a procedure without having to know every detail of the code.

300

How does parallel and distributive computing work?

Parallel: Tasks are performed on the same computer, but each processor is assigned one task. All tasks are completed simultaneously.

Distributive: Tasks are performed by different devices. All tasks are done simultaneously.

300

What is the worst-case scenario for both binary and linear searches?

When the target is not present in the list.

300

Is an intractable problem the same as an undecidable problem?

No, because intractable problems can give you an exact answer, but it will take an exponentially long time to complete. Undecidable problems cannot be solved using an algorithm.

400

What is the speed-up time?

How much quicker are tasks completed using parallel or distributive computing compared to sequential computing (Sequential/Parallel or Distributive)

M
e
n
u