1. Memory has a finite capacity.: True
2. The PC always contains the location in memory of the first instruction in the current program.:
False
3. In the Fetch/Execute Cycle, the action of retrieving a machine instruction from the memory
address given by the program counter occurs during the: - Instruction Fetch (IF) step
4. The speed of a computer is dependent on the number of cycles of what?: the Fetch/Execute cycle
5. How does the PC change from one fetch/execute cycle to the next (except when the instruction is
a branch or jump)?: Increases by 4.
6. Data Fetch gets the values, called , from memory that the ALU needs to
perform operations like ADD and MULTIPLY.: operands
7. The process of executing a program is also called .: instruction
interpretation
8. Memory locations are identified by numbers called .: address
9. The peripheral used by the computer for both input and output is the:: hard disk
10.Integrated circuits are made with a process called .: photolithog-
raphy
11. Algorithms are rare and seldom used outside of the field of computers.: -
False
12.A loop in an algorithm must include some test which can end the repeti- tion.: True
13.A computer algorithm must have:: a specified input and output
definiteness
effectiveness
14.Which of the following is an example of definiteness?: Add A and B. Divide the sum by C. If C
= 0, the solution is "undefined."
15.Instruction sequences that repeat are called:: loops
16.English is an example of a(n) language.: natural
17. The property of means that an algorithm must eventually stop
: finiteness
18.Which of the following is a good example of effectiveness?: Add 1 to the total number of
students registered.
19.Which of the following lacks finiteness?: Find pi.
20.Programmers use programming languages instead of natural languages because programming
languages:: are precise and unambiguous
1/4