3b AP CSP

• 
• 
• 
• Error. The robot will stay in its current location and the program will terminate

  
  

• 5

• 20

• 0

• Nothing, Runtime error

• 
• 
• 
• 

A city planner is using simulation software to study crowd flow out of a large arena after an event has ended. The arena is located in an urban city. Which of the following best describes a limitation of using a simulation for this purpose?

• The model used by the simulation software cannot be modified once the simulation has been used.

• The model used by the simulation software often omits details so that it is easier to implement.

• Running a simulation requires more time to generate data from trials than observing the crowd exiting the arena at various events.

• Running a simulation requires a large number of observations to be collected before it can be used to explore a problem.

Consider the following procedure.

PROCEDURE doSomething(num1, num2)

{

DISPLAY(num1)

RETURN(num1)

DISPLAY(num2)

}

Consider the following statement.

DISPLAY(doSomething(10, 20))

What is displayed as a result of executing the statement above?

• 10 10

• 10 20

• 10 10 20

• 10 20 10

Consider the following procedures.

PROCEDURE proc1(str)

{

DISPLAY(str)

DISPLAY("happy")

}

PROCEDURE proc2(str1, str2)

{

proc1(str2)

DISPLAY(str1)

}

What is displayed as a result of the procedure call proc2("birthday", "to you") ?

• birthday happy to you

• birthday happy birthday

• to you birthday happy

• to you happy birthday

A team of programmers is designing software. One portion of the project presents a problem for which there is not an obvious solution. After some research, the team determines that the problem is undecidable. Which of the following best explains the consequence of the problem being undecidable?

• The problem can be solved algorithmically, but it will require an unreasonably long amount of time.

• The problem can be solved algorithmically, but it will require an unreasonably large amount of data storage.

• There is no possible algorithm that can be used to solve all instances of the problem.

• There are several different possible algorithms that can solve the problem, but there is controversy about which is the most efficient.

A student wants to determine whether a certain problem is undecidable. Which of the following will demonstrate that the problem is undecidable?

• Show that for one instance of the problem, an algorithm can be written that is always capable of providing a correct yes-or-no answer.

• Show that for one instance of the problem, no algorithm can be written that is capable of providing a correct yes-or-no answer.

• Show that for one instance of the problem, a heuristic is needed to write an algorithm that is capable of providing a correct yes-or-no answer.

• Show that for one instance of the problem, an algorithm that runs in unreasonable time can be written that is capable of providing a correct yes-or-no answer.

Which of the following best explains how algorithms that run on a computer can be used to solve problems?

• 
  All problems can be solved with an algorithm that runs in a reasonable amount of time.

• All problems can be solved with an algorithm, but some algorithms might need a heuristic to run in a reasonable amount of time.

• All problems can be solved with an algorithm, but some algorithms might run in an unreasonable amount of time.

• Some problems cannot be solved by an algorithm.

Which of the following are benefits of procedural abstraction?

Select two answers.

• Procedural abstraction prevents programmers from accidentally using the intellectual property of other programmers.

• Procedural abstraction eliminates the need for programmers to document their code.

• Procedural abstraction makes it easier for people to read computer programs.

• Procedural abstraction provides an opportunity to give a name to a block of code that describes the purpose of the code block.