QUESTION 1

Which of the following is placed into the symbol table during the first pass?

a)		directives
b)		comments
c)		labels
	d)	mnemonics

QUESTION 2

Assembly language:

	a)	is not translated into machine language
	b)	uses alphabetic (mnemonic) codes in place of binary strings
	c)	All listed
d)		is easier to program in than high-level languages

QUESTION 3

a)Among other things, assembler directives can:

b)		control conditional assembly using macro instructions
c)		determine the next action after numeric overflow
d)		invoke interrupt service routines
e)		distinguish a value as hexadecimal or decimal

QUESTION 4

Suppose a computer's control unit consists of a 4-bit counter and a 4 16 decoder. What is the maximum number of clock cycles that can be consumed by any instruction?

	a)	32
	b)	48
	c)	4
	d)	16

QUESTION 5

If a system's entire set of microoperations consists of 41 statements, how many bits must be used for its microop code?

	a)	41
	b)	5
	c)	6
	d)	4

QUESTION 6

In order to pass parameters to subprograms a(n) ____________ must be implemented to support the ISA.

a)		stack
b)		bus
	c)	assembler
	d)	counter

QUESTION 7

Suppose a computer's control unit consists of a 5-bit counter and a 5 32 decoder. What is the maximum number of clock cycles that can be consumed by any instruction?

a)		48
b)		4
c)		16
d)		32

QUESTION 8

If a system's instruction set consists of a 5-bit opcode, what is the maximum number of output signal lines required for the control unit?

	A)	48
	B)	16
	c)	4
	D)	32

QUESTION 9

If a system's entire set of microoperations consists of 92 statements, how many bits must be used for its microop code?

a)		8
b)		7
c)		64
d)		92

QUESTION 10

If a system's instruction set consists of an 8-bit opcode, what is the maximum number of output signal lines required for the control unit?

a)		8
b)		64
c)		128
d)		256

QUESTION 11

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

	a)	None of these
	b)	ABC+-E*F-*+GHK*+/
	c)	AB-CDE*F-*+GHK*+/
	d)	AB-C+DE*F-GH+K**/

QUESTION 12

A subtract statement is an example of:

a)		a bit manipulation instruction
b)		an arithmetic instruction
c)		a Boolean logic instruction
	d)	an input/output instruction
	e)	a data movement instruction
	f)	a transfer of control instruction

QUESTION 13

A store statement is an example of:

a)		an arithmetic instruction
b)		a bit manipulation instruction
c)		a transfer of control instruction
d)		an input/output instruction
e)		a data movement instruction
f)		a Boolean logic instruction

QUESTION 14

A stack-organized computer uses _______ addressing.

a)		zero
b)		indirect
c)		direct
d)		indexed

QUESTION 15

In reverse Polish notation, the expression A*B+C*D is written:

a)		AB*CD*+
b)		ABCD**+
c)		AB*CD+*
d)		A*B*CD+

QUESTION 16

The term endian refers to a computer architectures:

a)		byte order
b)		ability to find the end of variable length instructions
c)		ability to complete arithmetic operations
d)		address modes

QUESTION 17

Examples of hazards in pipelines include:

a)		superscalar and VLIW
b)		addressing modes and memory
c)		resource conflicts, data dependencies, and conditional branch statements
d)		ILP and VLIW

QUESTION 18

A jump statement is an example of:

a)		an arithmetic instruction
b)		an input/output instruction
c)		a Boolean logic instruction
d)		a transfer of control instruction
e)		a data movement instruction
f)		a bit manipulation instruction

QUESTION 19

There are three basic ISA architectures for internal storage in the CPU:

a)		load-store, cache, and RAM
	b)	cache, RAM, and ROM
c)		stack, accumulator, and general-purpose registers
	d)	cache, RAM, and registers

QUESTION 20

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

(The instruction to specify the operation uses _______ operands)

	a)	zero
	b)	one
	c)	two
	d)	either one or two

QUESTION 21

If the opcodes field for an instruction has n bits, that means there are _______ potential distinct operations.

	a)	2n
	b)	n2
	c)	n/2
	d)	2n

QUESTION 22

Consider the infix expression: 16/(5+3). The equivalent postfix (reverse Polish notation) expression is:

a)		16/8
b)		16 / 5 + 3
c)		16 5 3 + /
d)		5 3 + / 16

QUESTION 23

Fixed-length instructions:

a)		are less complex to decode than variable-length instructions and save space
b)		save space and are faster and perform better than variable-length instructions
c)		waste space but are fast and perform better than variable length instructions
d)		are more complex to decode than variable-length instructions but save space

QUESTION 24

Consider the postfix (reverse Polish notation) 10 5 + 6 3 - /. The equivalent infix expression is:

a)		10/5+(6-3)
b)		(10+5)-(6/3)
c)		(10+5)-(6/3)
		d)(10+5)/(6-3)

10 points

QUESTION 25

Instruction sets are differentiated by which feature?

a)		operand storage and number of operands
b)		operations
c)		all listed
d)		operand location