Invitation To Computer Science 7th Edition Schneider Test Bank 1

Name: Class: Date:
Chapter 05: Computer Systems Organization
Invitation to Computer Science 7th Edition

Schneider Test Bank
Full download at link:
Test Bank: https://testbankpack.com/p/test-bank-for-invitation-to-computer-

science-7th-edition-schneider-1305075773-9781305075771/
Solution Manual: https://testbankpack.com/p/solution-manual-for-invitation-

to-computer-science-7th-edition-schneider-1305075773-9781305075771/
1. The branch of computer science that studies computers in terms of their major functional units and how they work is
known as computer organization.
a. True
b. False
ANSWER: True
POINTS: 1
REFERENCES: 222
2. Both RAM and ROM are memory chips into which information has been prerecorded during manufacture.
a. True
b. False
ANSWER: False
POINTS: 1
REFERENCES: 226
3. Memory locations are stored in row major order.

a. True
b. False
ANSWER: True
POINTS: 1
REFERENCES: 232
4. As computers become faster, memory access speeds are keeping pace.

a. True
b. False
ANSWER: False
POINTS: 1
REFERENCES: 235
Cengage Learning Testing, Powered by Cognero Page 1
Name: Class: Date:
5. The principle of locality states that when the computer uses something, it will probably use it again very soon.
a. True
b. False
ANSWER: True
POINTS: 1
REFERENCES: 236
6. In a two-level memory hierarchy, when the computer needs a piece of information, it looks in RAM first, then cache
memory.
a. True
b. False
ANSWER: False
POINTS: 1
REFERENCES: 237
7. Registers can be accessed much more quickly than random access memory.
a. True
b. False
ANSWER: True
POINTS: 1
REFERENCES: 245
8. The instructions that can be decoded and executed by the control unit of a computer are represented in machine
language.
a. True
b. False
ANSWER: True
POINTS: 1
REFERENCES: 250
9. The set of all operations that can be executed by a processor is called its I/O set.
a. True
b. False
ANSWER: False
POINTS: 1
REFERENCES: 251
10. The Von Neumann bottleneck is the inability of the sequential one-instruction-at-a-time computer Von Neumann
model to handle today’s large-scale problems.
a. True
b. False
ANSWER: True
POINTS: 1

Name: Class: Date:

REFERENCES: 267
11. The Memory Data Register contains the address of the cell being fetched or stored. _________________________
ANSWER: False - data value, data values, data
POINTS: 1
REFERENCES: 231
12. Examples of volatile storage are mass storage devices such as disks and tapes. _________________________
ANSWER: False - nonvolatile, non volatile, non-volatile
POINTS: 1
REFERENCES: 239
13. The sectors of a disk are placed in concentric circles called cells. _________________________
ANSWER: False - tracks, track
POINTS: 1
REFERENCES: 239
14. The normal mode of operation of a Von Neumann machine is sequential. _________________________
ANSWER: True
POINTS: 1
REFERENCES: 253
15. MIMD parallelism is a scalable architecture. _________________________

ANSWER: True
POINTS: 1
REFERENCES: 270
16. Computer manufacturers use a standard cell size of eight ____________________.

ANSWER: bits
bit
POINTS: 1
REFERENCES: 227
17. In a direct access storage device, every unit of information has a unique ____________________.
ANSWER: address
POINTS: 1
REFERENCES: 239
18. The three parts of the ALU together are known as the ____________________.
ANSWER: data path
POINTS: 1
REFERENCES: 245
19. Machines that use the simplified approach to designing instruction sets are known as ____________________
machines.
Name: Class: Date:

ANSWER: reduced instruction set computers
RISC
reduced instruction set computers (RISC)
RISC (reduced instruction set computers)
POINTS: 1
REFERENCES: 251
20. The first computer to achieve a speed of 1 million floating-point operations per second, 1 ____________________,
was the Control Data 6600 in the mid-1960s.
ANSWER: megaflop
POINTS: 1
REFERENCES: 269
21. To understand how computers process information, we must study computers as collections of ____ that perform tasks
such as information processing, information storage, computation, and data transfer functional units.
a. data types b. functional units
c. hardware d. memory units
ANSWER: b
POINTS: 1
REFERENCES: 222
22. The acronym ____ is frequently used to refer to the memory unit of a computer.
a. ROM b. CD
c. MDR d. RAM
ANSWER: d
POINTS: 1
REFERENCES: 226
23. There are ____ bytes in a gigabyte.

a. 210 b. 220
c. 230 d. 2100
ANSWER: c
POINTS: 1
REFERENCES: 228
24. In a ____, the original contents of the memory cell are unchanged.
a. nondestructive fetch b. destructive store
c. random access memory d. volatile storage
ANSWER: a
POINTS: 1
REFERENCES: 229
25. To solve the difficulty of scaling memory organization, memories are physically organized into a ____-dimensional
organization.

Name: Class: Date:

a. one b. two
c. three d. multi
ANSWER: b
POINTS: 1
REFERENCES: 234
26. A cache is typically ____ times faster than RAM but much smaller.
a. 5 to 10 b. 15 to 20
c. 20 to 30 d. 25 to 30
ANSWER: a
POINTS: 1
REFERENCES: 237
27. The ____ are the devices that allow a computer system to communicate and interact with the outside world as well as
store information.
a. registers b. arithmetic/logic units
c. control units d. input/output units
ANSWER: d
POINTS: 1
REFERENCES: 239
28. The ____ of a disk is the time needed to position the read/write head over the correct track.
a. latency b. frequency
c. transfer speed d. seek time
ANSWER: d
POINTS: 1
REFERENCES: 240
29. The ____ of a disk is the time for the beginning of the desired sector to rotate under the read/write head.
a. latency b. transfer time
c. frequency d. seek time
ANSWER: a
POINTS: 1
REFERENCES: 240
30. A(n) ____ handles the details of input/output and compensates for any speed differences between I/O devices and
other parts of the computer.
a. cache b. I/O register
c. decoder circuit d. I/O controller
ANSWER: d
POINTS: 1
REFERENCES: 243
31. To alert the computer that an input/output operation is done, a(n) ____ is transmitted to the processor.
Name: Class: Date:

a. condition code b. interrupt signal
c. broadcast d. execution instruction
ANSWER: b
POINTS: 1
REFERENCES: 243
32. A(n) ____ is a storage cell that holds the operands of an arithmetic operation and that, when the operation is complete,
holds its result.
a. decoder b. register
c. I/O controller d. cache
ANSWER: b
POINTS: 1
REFERENCES: 245
33. If a computer has a maximum of 2N memory cells, then each address field in a machine language instruction must be
____ bits wide to enable us to address every cell.
a. N b. 2N
c. N 2 d. 2N
ANSWER: a
POINTS: 1
REFERENCES: 250
34. ____ machines are designed to directly provide a wide range of powerful features so that finished programs for these
processors are shorter.
a. MISC b. SICC
c. SISC d. CISC
ANSWER: d
POINTS: 1
REFERENCES: 252
35. The ____ operation in Von Neumann machines uses a special set of bits known as condition codes.
a. compare b. addition
c. control d. looping
ANSWER: a
POINTS: 1
REFERENCES: 253
36. The ____ machine language instructions alter the normal sequential flow of control.
a. data transfer b. arithmetic
c. branch d. compare
ANSWER: c
POINTS: 1
REFERENCES: 253

Name: Class: Date:

37. It is the task of the ____ to fetch and execute instructions.
a. arithmetic/logic unit (ALU) b. I/O controllers
c. memory d. control unit
ANSWER: d
POINTS: 1
REFERENCES: 255
38. The ____ holds the address of the next instruction to be executed.
a. status register b. program counter
c. condition register d. instruction register
ANSWER: b
POINTS: 1
REFERENCES: 257
39. During the ____ phase, the control unit circuitry generates the necessary sequence of control signals and data transfer
signals to the other units of the computer to carry out the instruction.
a. fetch b. execution
c. store d. decode
ANSWER: b
POINTS: 1
REFERENCES: 262
40. MIMD parallel processing is also called ____.

a. cluster computing b. multichip processing
c. SIMD d. mainframe processing
ANSWER: a
POINTS: 1
REFERENCES: 268
41. What are the four major subsystems of the Von Neumann architecture?
ANSWER: The four major components are memory, input/output, the arithmetic logic unit, the control unit.
POINTS: 1
REFERENCES: 225-226
TOPICS: Critical Thinking
42. Draw an analogy between cache memory and a home refrigerator.

ANSWER: Without a home refrigerator, we would have to go to the grocery store every time we needed an item;
this corresponds to slow, regular memory access. Instead, what we go to the store we buy not only what
we need now but also what we think we will need in the near future, and we put those items into our
refrigerator. Now, when we need something, we first check the refrigerator. If it is there, we can get it at
a much higher rate of speed and we only need to go to the store when the food item we want is not there.
POINTS: 1
REFERENCES: 238

Name: Class: Date:

43. What is the most fundamental characteristic of the Von Neumann architecture?
ANSWER: The most fundamental characteristic is the stored program — a sequence of machine language
instructions stored as binary values in memory.
POINTS: 1
REFERENCES: 250
44. Other than clock speed, what is an accurate measure of machine speed?
ANSWER: Instruction rate, measured in MIPS, an acronym for millions of instructions per second, is an accurate
measure of machine speed. The instruction rate measures how many machine language instructions can
be fetched, decoded, and executed in one second.
POINTS: 1
REFERENCES: 264
45. What is cluster computing?

ANSWER: MIMD parallel processing (multiple instruction stream/multiple datastream), also called cluster
computing, is a widely used form of parallelism, in which we replicate entire processors rather than just
the ALU, and every processor is capable of executing its own separate program in its own private
memory at its own rate.
POINTS: 1
REFERENCES: 268
46. What is random access memory, and what are its three characteristics?
ANSWER: Computer memory uses an access technique called random access, and the memory unit is frequently
referred to as random access memory (RAM). RAM has the following three characteristics:
· Memory is divided into fixed-size units called cells, and each cell is associated with the unique
identifier called an address. These addresses are the unsigned integers 0, 1, 2, ..., MAX.
· All accesses to memory are to a specified address, and we must always fetch or store a complete cell —
that is, all the bits in that cell. The cell is the minimum unit of access.
· The time it takes to fetch or store the contents of a cell is the same for all the cells in memory.
POINTS: 1
REFERENCES: 226
47. When a computer needs a piece of information, does it immediately perform the memory fetch operation? If not, what
does it do?
ANSWER: First, the computer looks in cache memory to see whether the information is there. If it is, then the
computer can access it at a higher speed of the cache. If the desired information is not in the cache, then
it accesses it from RAM at the slower speed, using the fetch operation. Finally, the data just fetched is
copied into the cache along with the appropriate immediately following memory locations. If the cache
is full, then some of the older items that have not been recently accessed are discarded. (The assumption
is that they will not be needed again for a while.)
POINTS: 1
REFERENCES: 237
Name: Class: Date:

48. Explain what a register is and how it differs from random access memory cells.
ANSWER: A register is a storage cell that holds the operands of an arithmetic operation and that, when the operation
is complete, holds its results. Registers are quite similar to random access memory cells, with the
following minor differences:
· They do not have a numeric memory address but are accessed by a special register designator such as
A, X, or R0.
· They can be accessed much more quickly than regular memory cells. Because there are few registers
(typically, a few dozen up to 100), it is reasonable to utilize the expensive circuitry needed to make the
fetch and store operations 5 to 10 times faster than regular memory cells, of which there will be billions.
· They are not used for general-purpose storage but for specific purposes such as holding the operands
for an upcoming arithmetic computation.
POINTS: 1
REFERENCES: 245
49. Explain at length what scalability means.

ANSWER:
Scalability means that, at least theoretically, it is possible to match the number of processors to the size
of the problem. For example, if 1,000 processors were insufficient to solve the reverse telephone lookup
problem, then 2,000 or 5,000 can be used instead, assuming the interconnection network can provide the
necessary level of communications. (Communications can become a serious bottleneck in a parallel
system.) In short, the resources applied to a problem can be in direct proportion to the amount of work
that needs to be done and the speed with which the answer is needed. Massively parallel MIMD
machines containing hundreds of thousands or millions of independent processors have achieved
solutions to large problems thousands of times faster than is possible using a single processor.
POINTS: 1
REFERENCES: 270
50. Describe at length what quantum computing is.

ANSWER: One of the most fascinating (and complex) models of non-Von Neumann computing is called quantum
computing. In a “regular” (i.e., Von Neumann) machine an individual bit of data is always in a well-
defined state–either a 0 or a 1. However, quantum computers are built using the quantum mechanical
principle called superposition, in which a single bit of data, now called a qubit, can be either a 0 or a 1
or both a 0 and a 1 simultaneously! In theory, this would allow a quantum computer to examine every
possible combination of input values in a single step, greatly speeding up the solution to complex
problems. For example, 2 qubits could, at the same time, represent all combinations of two binary
values: 00, 01, 10, and 11.
In 2012, a company called D-Wave Systems, of British Columbia, Canada, built the first working model
of a quantum computer, the D-Wave 1 with 128 qubits. A second prototype, the D-Wave 2 with 512
qubits, was launched in 2013. Soon after that, NASA, Google, the CIA, and a group of American and
Canadian universities formed a research consortium to study how this radically new type of computer
system could best be used.
POINTS: 1
REFERENCES: 272
Name: Class: Date:


Invitation To Computer Science 7th Edition Schneider Test Bank 1

Uploaded by

Copyright:

Available Formats

Invitation To Computer Science 7th Edition Schneider Test Bank 1

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Invitation To Computer Science 7th Edition Schneider Test Bank 1

Uploaded by

Copyright:

Available Formats

Name: Class: Date:

Chapter 05: Computer Systems Organization