Unit 6 College Board Quizlet

A graphic artist uses a program to draw geometric shapes in a given pattern. The program uses an algorithm that draws the shapes based on input from the artist. The table shows the approximate number of steps the algorithm takes to draw different numbers of shapes. Number of Shapes Drawn Number of Steps 4

17 5 24 6 35 7 50 Based on the values in the table, which of the following best characterizes the algorithm for drawing n shapes, where n is a very large number? The algorithm runs in a reasonable amount of time because it will use approximately n2 steps to draw n shapes.

Which of the following programs is most likely to benefit from the use of a heuristic?

A program that finds the shortest driving route between two locations on a map

A certain computer has two identical processors that are able to run in parallel. The table below indicates the amount of time it takes each processor to execute each of two processes. Assume that neither process is dependent on the other. Process

Execution Time on Either Processor P 30 seconds Q 45 seconds Which of the following best approximates the difference in execution time between running the two processes in parallel instead of running them one after the other on a single processor? 30 sec-Running the two processes one after the other on a single processor requires 30+45=75 seconds. Running the two processes in parallel requires 45 seconds because if both processes start at the same time on different processors, process P will finish in 30 seconds and process Q will finish 15 seconds later at 45 seconds. Therefore, the amount of time saved by running the two processes in parallel is 75−45=30 seconds.

For which of the following situations would it be best to use a heuristic in order to find a solution that runs in a reasonable amount of time?

Finding the fastest route that visits every location among n locations, which requires n! possible routes be examined.

Which of the following best describes the ability of parallel computing solutions to improve efficiency?

The efficiency of a solution that can be broken down into parallel portions is still limited by a sequential portion.

A certain computer game is played between a human player and a computer-controlled player. Every time the computer-controlled player has a turn, the game runs slowly because the computer evaluates all potential moves and selects the best one. Which of the following best describes the possibility of improving the running speed of the game?

The game's running speed might be improved by using a process that finds approximate solutions every time the computer-controlled player has a turn.

Under which of the following conditions is it most beneficial to use a heuristic approach to solve a problem?

When the problem cannot be solved in a reasonable time and an approximate solution is acceptable