COA_Ch05_Pretest

Fixed-length instructions:

• waste space but are fast and perform better than variable length instructions
• are more complex to decode than variable-length instructions but save space
• save space and are faster and perform better than variable-length instructions
• are less complex to decode than variable-length instructions and save space

Consider the postfix expression: A-B+C*(D*E-F)/(G+H*K). The equivalent postfix (reverse Polish notation) expression is:

• AB-C+DE*F-GH+K**/
• AB-CDE*F-*+GHK*+/
• ABC+-E*F-*+GHK*+/
• None of these

To carry out a binary arithmetic operation, an accumulator architectures uses ______ operand(s).

• zero
• one
• two
• either one or two

A “jump” statement is an example of:

• a transfer of control instruction
• a data movement instruction
• an arithmetic instruction
• a Boolean logic instruction
• a bit manipulation instruction

A “store” statement is an example of:

• a data movement instruction
• an arithmetic instruction
• a Boolean logic instruction
• a bit manipulation instruction
• an input/output instruction

Short instructions are typically better because they take up less room and can be fetched quickly.

• True
• False

Memory organization has no effect on instruction format.

• True
• False

A fixed-length instruction must have fixed-length opcodes.

• True
• False

One disadvantage to big endian representation is that most computers require words to be written on word address boundaries.

• True
• False

Accumulator architectures store one operand on the stack and the other in the accumulator.

• True
• False