True/False
Indicate whether the
statement is true or false.
|
|
|
1.
|
Computers are so intelligent that they do not need human beings to give them
directions.
|
|
|
2.
|
The people who write the programs are called programmers.
|
|
|
3.
|
After the programmer and user agree on the solution, the programmer begins
converting the solution into a computer program.
|
|
|
4.
|
During the initial phase, the programmer meets periodically with the user to
determine whether the program fulfills the user’s needs, and to refine any details of the
solution.
|
|
|
5.
|
Because programmers are only expected to work in teams of programmers, employers
only need people who are able to communicate with technical personnel.
|
|
|
6.
|
Knowing even a little bit about the programming process will allow you, the
manager of a department, to better communicate your department’s needs to a programmer.
|
|
|
7.
|
All computer programs, no matter how simple or how complex, are written using
one or more of three basic structures: sequence, selection, and repetition.
|
|
|
8.
|
Programmers must use the repetition structure in every program they
write.
|
|
|
9.
|
When used in a computer program, the selection structure alerts the computer
that a decision needs to be made, and it provides the appropriate action to take based on the result
of that decision.
|
|
|
10.
|
The redo structure is also referred to as a loop or as iteration.
|
|
|
11.
|
Without the repetition structure, if you needed an instruction to repeat 20
times you would have to write that instructions 20 times in your program.
|
|
|
12.
|
The first step that programmers follow when they solve problems is to plan the
algorithm.
|
|
|
13.
|
The final step that programmers follow when they solve problems is to rigorously
test the program using the computer.
|
|
|
14.
|
The two most important components of any problem are the problem’s output
and its input.
|
|
|
15.
|
When analyzing a problem, you always search first for the input, and then for
the output.
|
|
|
16.
|
The input typically is stated as nouns and adjectives in the problem
specification.
|
|
|
17.
|
When determining the output, it helps to think about the information that you
would need to solve the problem manually.
|
|
|
18.
|
Analyzing real-world problems is generally as easy as analyzing the problems
found in a textbook.
|
|
|
19.
|
If you are having trouble analyzing a problem, try reading the problem
specification several times, as it is easy to miss information during the first reading.
|
|
|
20.
|
Most algorithms begin with an instruction that enters the input items into the
computer.
|
|
|
21.
|
Most algorithms end with an instruction to print, display, or store the output
items.
|
|
|
22.
|
Display, print, and store refer to a file on disk, the printer, and the computer
screen, respectively.
|
|
|
23.
|
To avoid confusion, it is important that the algorithm is consistent when
referring to the input and output items.
|
|
|
24.
|
Pseudocode is standardized.
|
|
|
25.
|
Unlike a flowchart, pseudocode uses standardized symbols to visually depict an
algorithm.
|
|
|
26.
|
You can draw the flowchart symbols by hand; or, you can use the drawing or
shapes feature in a word processor.
|
|
|
27.
|
When planning an algorithm, you need to create both a flowchart and
pseudocode.
|
|
|
28.
|
For simple algorithms, flowcharts work just fine.
|
|
|
29.
|
Not all algorithms require a processing item.
|
|
|
30.
|
Before you begin a desk-check, you first choose a set of sample data for the
input values, which you then use to manually compute the expected output values.
|
|
|
31.
|
It is helpful to use a desk-check table when desk-checking an algorithm.
|
|
|
32.
|
You can only perform a desk-check using an algorithm’s pseudocode.
|
|
|
33.
|
You should test an algorithm with invalid data because users sometimes make
mistakes when entering data.
|
Multiple Choice
Identify the
choice that best completes the statement or answers the question.
|
|
|
34.
|
In essence, the word ____ means giving a mechanism the directions to accomplish
a task.
a. | executing | c. | programming | b. | directing | d. | scripting |
|
|
|
35.
|
The directions given to a computer are called computer ____.
a. | programs | c. | plans | b. | languages | d. | selections |
|
|
|
36.
|
When a company has a problem that requires a computer solution, typically it is
a ____ that comes to the rescue.
a. | Web designer | c. | script developer | b. | computer technician | d. | programmer |
|
|
|
37.
|
In many cases, the programmer also provides the user with ____ that explains how
to use the program.
a. | a programmer’s guide | c. | the source code | b. | the
manual | d. | the program
code |
|
|
|
38.
|
Control structures or ____ structures control the flow of a program’s
logic.
a. | flow | c. | logic | b. | program | d. | execution |
|
|
|
39.
|
The ____ structure in a computer program directs the computer to process the
program instructions, one after another, in the order listed in the program.
a. | sequence | c. | repetition | b. | selection | d. | series |
|
|
|
40.
|
A(n) ____ is a set of step-by-step instructions that accomplish a task.
a. | program | c. | instruction set | b. | algorithm | d. | command
structure |
|
|
|
41.
|
The ____ structure makes a decision and then takes an appropriate action based
on that decision.
a. | repetition | c. | command | b. | sequence | d. | selection |
|
|
|
42.
|
When used in a program, the ____ structure directs the computer to repeat one or
more instructions until some condition is met, at which time the computer should stop repeating the
instructions.
a. | redo | c. | selection | b. | repetition | d. | sequence |
|
|
|
43.
|
The ____ step is the most difficult of the problem-solving steps, and it
requires a lot of time, patience, and effort.
a. | planning | c. | analysis | b. | desk-check | d. | testing |
|
|
|
44.
|
The second step in the problem-solving process is to plan the ____, which is the
set of instructions that, when followed, will transform the problem’s input into its
output.
a. | program | c. | instructions | b. | algorithm | d. | statements |
|
|
|
45.
|
____ is called false code because, although it resembles programming language
instructions, it cannot be understood by a computer.
a. | Binary code | c. | Planning code | b. | Empty code | d. | Pseudocode |
|
|
|
46.
|
Besides using pseudocode, programmers also use ____ when planning
algorithms.
a. | pseudocharts | c. | flowcharts | b. | templates | d. | coding sheets |
|
|
|
47.
|
Symbols are connected with lines, called ____.
a. | chartlines | c. | processlines | b. | flowlines | d. | tracklines |
|
|
|
48.
|
The oval symbol in a flowchart is called the ____ symbol.
a. | start/stop | c. | process | b. | input/output | d. | flow |
|
|
|
49.
|
The parallelogram symbol in a flowchart is called ____ symbols.
a. | start/stop | c. | process | b. | input/output | d. | flow |
|
|
|
50.
|
The rectangle in a flowchart is called the ____ symbol and is used to represent
tasks such as calculations.
a. | start/stop | c. | process | b. | input/output | d. | flow |
|
|
|
51.
|
When an algorithm becomes more complex, the program’s logic may be easier
to see in ____.
a. | code | c. | pseudocode | b. | a processor | d. | a flowchart |
|
|
|
52.
|
A ____ item represents an intermediate value that the algorithm uses when
processing the input into the output.
a. | calculating | c. | processing | b. | data | d. | storage |
|
|
|
53.
|
The term ____ refers to the fact that the programmer reviews the algorithm while
seated at his or her desk rather than in front of the computer.
a. | desk-checking | c. | desk-tracing | b. | program-checking | d. | hand-checking |
|
|
|
54.
|
You ____ an algorithm to verify that it is not missing any steps, and that the
existing steps are correct and in the proper order.
a. | desk-trace | c. | program-check | b. | desk-check | d. | hand-check |
|