Algorithms Review

Instruction that use sequencing, selection, and iteration is called an (a)   .

A (a)   search repeatedly cuts a sorted list in half until a desired element is found.

A (a)   search checks each element until the correct value is found.

A (a)   provides a "good enough" solution when it is impractical or impossible to find an actual solution.

The time used to complete a task sequentially divided by the time to complete a task in parallel is called (a)  

What is iteration?

• completing steps in order

• executing a portion of an algorithm based on a given condition

• repeating a portion of an algorithm

• running a program on multiple devices

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

• MOVE_FORWARD()

  TURN_RIGHT()

  MOVE_FORWARD()

  TURN_RIGHT()

  MOVE_FORWARD()

  TURN_RIGHT()

  MOVE_FORWARD()

  TURN_RIGHT()

• REPEAT 2 TIMES

  {

      MOVE_FORWARD()

      MOVE_FORWARD()

      TURN_RIGHT()

      MOVE_FORWARD()

      TURN_RIGHT()

  }

What is the difference between a decision problem and an optimization problem?

• decision problems are solved by just one computer, optimization problems use multiple computers

• decision problems have a linear efficiency, optimization problems have an exponential efficiency

• decision problems have a yes/no answer, optimization problems cannot be answered

• decision problems have a yes/no answer, optimization problems look for the best solution

Which graph has a linear efficiency?

• green

• yellow

• orange

• red

Which graph has a polynomial efficiency?

• green

• yellow

• orange

• red