Computer Science Principles Unit 6 Review

Computer Science Principles Unit 6 Review

Algorithms

Algorithms

• specific instructions to complete a task

• often built as functions

• uses sequence and iteration to repeat

• "Undecidable problems" can not use algorithms

Multiple Choice

The following algorithm is followed by someone to start a car and drive. Which concept does this algorithm best demonstrate?

• sequencing

• selection

• iteration

• execution

Multiple Choice

Which of these algorithms will move the robot along the same path as the algorithm below?

Optimization

• code is altered to use less memory, less power

• same results with fewer operations

Multiple Choice

A school is designing a new bus route and are deciding where to put the different bus stops. They want to pick the collection of locations that maximizes the amount of students at a pick up to at least 2 . What term best defines the kind of problem?

• A decision problem

• An undecidable problem

• An optimization problem

• An efficiency problem

Multiple Choice

The algorithm below is used to find the largest element in a list of numbers. Which line checks if a number is to BIGGER than the target?

• 1

• 4

• 6

• 9

Multiple Choice

Which of the following algorithms is the same as the flowchart shown below?

Efficiency

This graph shows the efficiencies of two different algorithms that solve the same problem. Line A is more consistent at returns than Line B (it is exponential).

Heuristic Approaches

• a practical method not guaranteed to be optimal or perfect

• it can be considered a shortcut

Multiple Choice

Which situation will likely need a heuristic solution?

• finding the lowest total of comparable grocery items

• finding the best schedule for all airplanes

• finding the average of neighborhood home prices

Linear vs. Binary

• A linear search looks down a list, one item at a time, without jumping

• binary search is when you start with the middle of a sorted list, and see whether that's greater than or less than the value you're looking for,

Multiple Choice

A computer is performing a binary search on the sorted list of 9 numbers below. What is the maximum number of iterations needed to find the item?

• 1

• 3

• 4

• 9

Distributed & Parallel Computing

• Scalability with more processors in DC

• Reliable because of redundancy in DC

• Economical because high-bandwidth networks are now affordable

Multiple Choice

What is a benefit of parallel computing over sequential computing?

• cost

• scalability

• fewer computers

Sequential vs Parallel

S runs in order

P runs simultaneously to speed up overall completion time

Multiple Choice

The impacts of running a parallel algorithm on a large number of computers includes:

• less time to run but not more efficiency

• less time to run and more efficiency

• more time to run and more efficiency

Multiple Choice

If an algorithm speeds up completion, it is called:

• modulo

• secession

• processing time