Coding Final Exam 2025

Which of the following is an example of an algorithm?

• the weight of a package of macaroni and cheese in ounces

• directions for heating a package of macaroni and cheese in three steps

• a description of the ingredients in a package of macaroni and cheese

• the cost of a package of macaroni and cheese in dollars

Writing an algorithm is most useful for a task that

• will need to be completed only once.

• will need creativity to complete.

• will need continued research to complete.

• will need to be completed many times.

Which of the following tasks would you most likely use an algorithm to complete?

• convincing your neighbors to come with you to the pool

• imagining a new way to jump off the diving board that no one has done before

• following directions from your neighborhood to the swimming pool

• winning a treading water contest by treading water without getting tired

When you’re using an algorithm to solve a problem, you are

• following steps exactly as they are written.

• coming up with a unique solution that works sometimes.

• making a solution more efficient.

• making an inference using your prior knowledge.

Which algorithm for building a shelf would be the most precise?

• an algorithm written with exact language that anyone can follow

• an algorithm written without any measurements or verbs

• an algorithm with one step

• an algorithm with no steps

Which algorithm for baking a five-layer chocolate cake would be the most efficient?

• one that produces the most delicious cake

• one that can be used to bake a four- or three-layer cake

• one that takes the least amount of time

• one that requires the most ingredients

Augustin wrote an algorithm for making a paper airplane that flies. When his friend Rosa followed the algorithm, the airplane she made could not fly. Augustin’s algorithm

• works every time.

• might need to be more precise.

• might need to be less efficient.

• is written in the correct order.

Flor and Esme wrote algorithms for solving addition problems. Their algorithms are not exactly the same. Which of the following is true?

• Only one of their algorithms can solve addition problems.

• Both algorithms might solve addition problems, but neither one is efficient or precise.

• Neither algorithm can solve addition problems.

• Both algorithms might solve addition problems, but one might be more efficient.

Which algorithm would direct the turtle to the purple dot?

• 1. move (5) 2. turn (left) 3. move (1)

• 1. move (3) 2. turn (left) 3. move (4)

• 1. move (1) 2. turn (left) 3. move (4)

• 1. move (3) 2. turn (left) 3. move (2)

Which algorithm would direct the turtle to the finish?

• move (5) 2. turn (right) 3. move (2) 4. turn (right) 5. move (3)

• move (3) 2. turn (left) 3. move (2) 4. turn (right) 5. move (3)

• move (5) 2. turn (left) 3. move (2) 4. turn (left) 5. move (2) 6. turn (right) 7. move (2)

• move (5) 2. turn (right) 3. move (1) 4. turn (right) 5. move (2) 6. turn (right) 7. move (2)