CSPUnit6AssessmentReview

Match this with the equivalent sequential algorithm.

Repeat twice

{

Repeat twice

{

movebackward

turn left

}

moveforward

}

• movebackward

  turnleft

  moveforward

  movebackward

  turnleft

  moveforward

• movebackward

  turnleft

  movebackward

  turnleft

  moveforward

  movebackward

  turnleft

  movebackward

  turnleft

  moveforward

• movebackward

  turnleft

  movebackward

  turnleft

  moveforward

  moveforward

  movebackward

  turnleft

  movebackward

  turnleft

  moveforward

  moveforward

I'm trying to figure out the best route to deliver my Girl Scout cookies so that it takes the least amount of time and gas. What type of problem is this? Choose all that apply.

• Efficiency Problem

• Decision Problem

• Undecidable Problem

• Unreasonable Problem

• Optimization Problem

Binary searches are more efficient than Linear Searches.

• Always true

• True as the numbers of instances gets higher

• Always false

• False unless you have a small number of instances

Which of these searches is considered unreasonable? Choose all that apply.

• Constant

• Factorial

• Polynomial

• Binary

• Exponential

What is the difference between distributed and parallel programming?

• Nothing. They are the same.

• Parallel programming uses multiple computers or documents to complete the task while distributed uses one.

• Distributed programming uses one computer or document to perform numerous tasks at the same time while parallel uses multiple.

• Parallel programming uses one computer or document to perform numerous tasks at the same time while distributed uses multiple.

Which of the following number of instances will NOT require 4 steps?

• 16

• 12

• 10

• 14

Repeat 4 times

{

Walk 1/2 mile

Run 1/4 mile

}

This is an example of what type of algorithm?

• Sequence

• Iteration

• Selection

What is the speedup?

Sequentially, it took 5 hours to research and 7 hours to write

In parallel, it took 1 hour to research and 3 hours to write

• 5

• 7

• 3

• 4

Which term doesn't belong?

• optimization

• traveling salesman problem

• undecidable problem

• heuristic

What does this program do?

num = random(1,10)

Repeat while (num>5)

{

display (num)

num = random(1,10)

}

display ("too small")

• As long as the number generated is less than 5, it will be displayed. Then "too small" will be displayed.

• Until the number is over 5, the number will be displayed. Then "too small" will be displayed.

• As long as the number generated is over 5, it will be displayed. Then "too small" will be displayed.