Test Bank For Invitation to Computer Science 7th Edition G Michael Schneider Judith Gersting
Chapter 02: Algorithm Discovery and Design
1. An unstructured, “free-flowing” writing style should be used for writing algorithms.
a. True
b. False
ANSWER: False
POINTS: 1
REFERENCES: 44
2. With a natural language, different readers can interpret the same sentence in totally different ways.
a. True
b. False
ANSWER: True
POINTS: 1
REFERENCES: 45
3. Java and C++ are examples of pseudocode languages.
a. True
b. False
ANSWER: False
POINTS: 1
REFERENCES: 46
4. The three basic sequential operations are called addition, multiplication, and exponentiation.
a. True
b. False
ANSWER: False
POINTS: 1
REFERENCES: 47
5. Input and output enable the computing agent to communicate with the outside world.
a. True
b. False
ANSWER: True
POINTS: 1
REFERENCES: 49
6. The if/then/else operation allows you to select exactly one of three alternatives.
a. True
b. False
ANSWER: False
POINTS: 1
REFERENCES: 51
7. One of the most powerful features of a computer is its ability to handle loops.
a. True
b. False
ANSWER: True
POINTS: 1
REFERENCES: 53
8. Having an infinite loop in an algorithm is an error.
a. True
b. False
ANSWER: True
POINTS: 1
REFERENCES: 54
9. Once an algorithm has been developed, it may itself be used in the construction of other algorithms.
a. True
b. False
ANSWER: True
POINTS: 1
REFERENCES: 70
10. Pattern matching can only be applied to graphics and pictures.
a. True
b. False
ANSWER: False
POINTS: 1
REFERENCES: 77
Reviews
There are no reviews yet.