Part A Unit 6 Practice Exam

• 
• 
• 
• 

Which of the following is true of algorithms?

• Algorithms may have an infinite set of instructions

• Algorithms must be expressed using a programming language

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

• Every problem can be solved with an algorithm

The following algorithm is followed by a person every morning when they get up from bed to go to school

Wake up

Brush teeth

Put on shirt

Put on pants

Put on socks

Put on shoes

Tie shoes

Which concept does this algorithm BEST demonstrate?

• Sequencing

• Selection

• Iteration

• Execution

A town government is designing a new bus system and are deciding where to put the different bus stops. They want to pick the collection of locations that minimizes the distance anyone needs to walk in order to get to at least one bus stop. What term best defines the kind of problem?

• A decision problem

• An optimization problem

• An undecidable problem

• An efficiency problem

The algorithm shown in the image is used to find the largest element in a list of numbers.

By modifying one of the lines in the program it is possible to make the algorithm find the SMALLEST element. Which line would need to be modified and how?

• Line 01 becomes target <- list[2]

• Line 04 becomes IF (num < target)

• Line 04 becomes IF (num = target)

• Line 01 becomes list[0] <- target