CSP Unit 6 - Algorithms

Every ________________ can be constructed using combinations of sequencing, selection, and iteration

Walk into class

Put backpack at seat

Get laptop from cart

Return to seat

Log into Laptop

What concept does this algorithm best demonstrate

• sequencing

• iteration

• selection

• execution

The City of Knoxville is designing a new metro rail system and are deciding where to put the different stations. They want to pick locations that minimizes the distance anyone needs to walk in order to get to a metro rail station. What term best defines the kind of problem?

REPEAT 2 TIMES

{

REPEAT 3 TIMES

{

MOVE_FORWARD()

}

ROTATE_LEFT()

MOVE_FORWARD()

ROTATE_RIGHT()

}

Which picture displays where the location of the cursor at the end of the algorithm shown above?

• 
• 
• 
• 

REPEAT 6 TIMES

{

MOVE FORWARD

TURN LEFT

MOVE FORWARD

TURN RIGHT

}

Which picture displays where the location of the cursor at the end of the algorithm shown above?

• 
• 
• 
• 

What does the following algorithm do?

target <- list[1]

FOR EACH num IN list {

IF(num > target) {

target <- num }}

DISPLAY(target)

• Finds the largest value in a list

• Finds the smallest value in a list

• Sorts the list from smallest to largest

• Sorts the list from largest to smallest

What does the following algorithm do?

• A loop that generates random numbers; displays those greater than 8; ends when random number generated is less than 8

• A loop that generates random numbers; displays those less than 9; ends when an 8 is generated

• A loop that generates random numbers; displays those less than 8; ends when a 9 or 10 is generated

• A loop that generates random numbers; displays those less than 9; ends when a 9 or 10 is generated

Amazon is creating vacation schedules for its 1.2 million employees. Employees submit their requested vacation days and then a program will be designed to find the optimal schedule for all employees -- to make sure that each office still has coverage on all days of the year.

Amazon determined that finding the absolute best schedule cannot be solved in a reasonable time. Instead they have decided to use a simpler algorithm that produces a good but non-optimal schedule in a more reasonable amount of time.

Which principle does this decision best demonstrate?

Which algorithmic efficiencies is considered LEAST efficient?

An _____________ problem is a problem for which no algorithm can be constructed that always produces a correct output