Deck 10: Algorithmic Thinking

Question 1

Algorithms are only used in the field of computers; there is no use for algorithms anywhere else .

Answer 1

False

Question 2

The type of data, the amount of data, and the form of the data must all be specified when creating an algorithm .

Answer 2

True

Question 3

The sequence of commands is important in an algorithm .

Answer 3

True

Question 4

To be effective, an algorithm relies on outside help to provide further input .

Question 5

Algorithms use functions (operations that the agent already knows how to perform) to simplify the algorithmic description .

Question 6

Replacing nouns with pronouns in a natural language algorithm will make the algorithm more understandable .

Question 7

An algorithm is a systematic method to produce a specified result .

Question 8

All algorithms contain loops .

Question 9

A loop in an algorithm must include a test which can end the repetition .

Question 10

It is possible for the output of an algorithm to be a statement that says there is no possible solution .

Question 11

The way to know that an algorithm works is to know what properties the computation has that cause it to produce the right result every time and to be able to explain how those properties do the job .

Question 12

A heuristic process is an example of an algorithm .

Question 13

Anyone who creates an algorithm needs to know why it works .

Question 14

The value of an algorithm depends on its use of resources, such as space and time .

Question 15

There is only one possible algorithm that can be developed to solve each problem .

Question 16

Which of the following is a good example of the effectiveness property of algorithms?

A) Enter the test score you may get on the next test .
B) Subtract the amount spilled from a glass of juice .
C) Add 1 to the total number of students registered .
D) Any of these are good examples .

Question 17

Algorithms should

A) use resources efficiently
B) only be clear to the algorithm designer
C) be ambiguous to allow creativity
D) be written to solve one specific case

Question 18

Which of the following is an example of definiteness?

A) Add and multiply values A, B, and C .
B) Divide the result of values A and B by D .
C) Use multiplication and addition to find the result of three values .
D) Add values A and B, then divide by C . If C = 0, solution is "undefined . "

Question 19

Instruction sequences that repeat are called

A) loops
B) tests
C) sorts
D) assumptions

Question 20

A heuristic process

A) provides guidelines for finding a solution
B) is guaranteed to work 100% of the time
C) yields the specified answer or reports back that no such answer exists
D) All of these

Question 21

Which of the following statements is NOT true about algorithms?

A) Problems can be solved by different algorithms in different ways .
B) Algorithms can be given at different levels of detail, depending on the abilities of the agent .
C) Algorithms always work .
D) All of these are true .

Question 22

Algorithms are used by

A) only web searches
B) no one, they are just imagined solutions
C) various agents
D) only computers

Question 23

If an algorithm is run at different times but with the same data the output will be

A) different
B) sometimes the same but not often
C) the same
D) impossible to tell

Question 24

Select all that apply . Which of the following is(are) required of an algorithm?

A) It must, eventually, end .
B) Input and output must be specified .
C) It must be executable without further external support .
D) It must specify every step and the order the steps must be performed .

Question 25

Select all that apply . Which of the following lacks finiteness?

A) Add 2 to a number five times .
B) Find the value of pi .
C) Read Chapter 10 .
D) Bake until the top of the cake appears brown .

Question 26

Select all that apply . Which of the following can complete the statement below?Different algorithms for the same problem can

A) solve the problem differently
B) never come up with exactly the same outcome
C) have different running times
D) require different inputs where the outcome is the same but depends on the differences in the input characteristics

Question 27

Select all that apply . Which of the following can complete the statement below?The intersect of an alphabetized list (IAL) and a No Alphabetized List (NAL) are different solutions because they

A) have different running times
B) require different forms of the input
C) look for different outcomes
D) rely on the characteristics of the input

Question 28

Select all that apply . Which property(ies) of a valid algorithm is(are) violated by the instruction seen so often on hair shampoo bottles: "lather, rinse, repeat"?

A) definiteness
B) finiteness
C) effectiveness
D) None of these

Question 29

A precise, systematic method for producing a specified result is a(n) ________ .

Question 30

English is an example of a(n) ________ language .

Question 31

A(n) ________, such as C or Java, is a formal notation used to precisely define an algorithm .

Question 32

An algorithm that has no successful end violates the ________ property .

Question 33

The intended result (that is, the data resulting from a computation) is the ________ .

Question 34

A(n) ________ is an idea or concept extracted from a specific situation .

Question 35

Specifying the sequence of operations of an algorithm is part of the property of ________ .

Question 36

A web search process is not an algorithm; rather, it is a(n) ________ process .

Question 37

The data to be transformed during the computation in order to produce the output is the ________ .