Algorithm Review

An algorithm is a set of steps for completing a task or solving a problem. You can write algorithms in code for computers to follow. Those algorithms are called computer programs. Other algorithms are meant for people to follow. Some examples are a recipe for baking apple pie, instructions for playing Go Fish and directions for walking home from school. In math class, you might learn or write algorithms to solve similar problems, like finding the sum of two integers.

According to the passage, what is the relationship between an algorithm and a computer program?

• An algorithm is the opposite of a computer program.

• A computer program is an example of an algorithm.

• Every algorithm is also a computer program.

• An algorithm is the language in which a computer program is written.

The purpose of an algorithm is to create a solution that can work every time. Anyone should be able to follow it to complete the same task or solve the same type of problem. Therefore, you need to be very exact in your algorithm.

If it’s a recipe, you’d want to include precise measurements and exact directions. Don’t just write, “Put the ingredients together.” Instead, specify which ingredients, how much of each, how they should be combined and what utensils to use. Be sure the steps appear in the right sequence. Don’t add a step at the end that was intended to go at the very beginning.

What is the meaning of the word “sequence” as it is used in the passage above?

• the order in which things will happen

• a set of related events

• to arrange in a particular way

• a later development

When more than one algorithm solves the same problem, we call them “competing algorithms.” In the song, two algorithms directed the turtle out of the maze. Even though both algorithms solved the same problem, one did it more efficiently.

Efficient algorithms don’t waste any resources, like time, money or steps. Sometimes, you might compare competing algorithms by looking at efficiency. If you have a limited timeline or budget, you could choose the most efficient algorithm.

However, efficiency isn’t the only way to choose an algorithm. For example, you might want to examine the effects an algorithm would have on the people you are designing it for and other advantages and disadvantages of the competing algorithms.

The author of this passage would most likely agree with which of the following statements?

• When choosing among competing algorithms, one should choose the algorithm that requires the least amount of time and money.

• Effects on society matter more than efficiency when selecting an algorithm.

• It’s important to weigh the advantages and disadvantages when choosing among competing algorithms.

• No more than two algorithms can solve the same problem.

Computer science is problem solving. You don’t only use algorithmic thinking, thinking in algorithms, to help you write computer programs. You can use it anytime you’re solving a problem by clearly defining all the steps to develop a solution that will work every time. Giving someone directions to play a card game is one example.

Another example is helping someone who’s lost by providing directions to where they need to go. If you’re writing or following steps in order, you’re using an algorithm. It’s not just something computers do.

The author of this passage would most likely agree with which of the following statements?

• To solve problems, people should rely more on creativity than on algorithmic thinking.

• Algorithmic thinking limits what computers can do or solve.

• Algorithmic thinking is mostly useful for computer programmers.

• Algorithmic thinking is useful outside of computer science.