Self Test - Chapter One Supplements

CIS343

(1-3) List the three steps of the Fetch-Execute Cycle.

5. What does it mean to “fetch” an instruction?

6. Why are decode and execute not listed as separate steps?

7. During program execution, how is a jump or a branch accomplished?

8. Is instruction cycle synonymous with machine cycle?

9. What is the purpose of an instruction format?

(10-14) List, in order, the steps of instruction encoding & decoding.

10.

11.

12.

13.

14.

(15-19) Identify these operand addressing modes.

15. Operand is found in the instruction itself

16. Operand is found in a specified register

17. Operand is found in a memory; address is specified by a register

18. Operand is found in a memory; address is in the instruction itself

19. Operand is found in a memory; address is in a memory location specified by a register

(20-22) If an operand is in memory, its address may be found:

20.

21.

22.

23. Can the design of a machine’s addressing mode have an effect on locality?

24. The lowest level instructions that directly control a microprocessor is called . . .

25. In modern PC microprocessors, the microcode is _____ and _____ be modified.

(26-32) Identify these stages in the development of operating systems.

26. A computer operator was put in charge of the machine.

27. The user was given interactive access to the machine via a command line interface.

28. Computers did not have software. To reprogram the machine required rewiring.

29. A user on a PC runs several processes at once.

30. Several jobs are read into memory, allowing the processor to switch back and forth them.

31. User time was scheduled. Users had to load their programs along with system software needed by their job.

32. The scheduling and loading functions were turned over to a program called the monitor. Jobs were grouped together and run in batches.

33. Clarify the usage of the terms multiprogramming, multiprocessing and multitasking.

34. Clarify the role locality plays in OS concerns.

35. Clarify the role of time in locality issues.

(36-40) Identify these program features as producing spatial locality, temporal locality or both.

36. Sequential execution of code.

37. Frequent accesses to a global variable

38. Execution of a tight loop.

39. Array initialization

40. Bubble sort

41. Let m be a spac-loc-mem-ref. Is it always also a temp-loc-mem-ref?

42. Let m be a temp-loc-mem-ref. Is it always also a spac-loc-mem-ref?

43. Clarify the relationship between spatial and temporal locality.

Self Test - Chapter One Supplements

CIS343 Word Bank

Choose from these answers for Questions #1 to 19.

A. Address in the PC is changed

B. Copy it from RAM to IR

C. Copy it from RAM to IT

D. Decode & execute instruction

E. Decode instruction

F. Execute instruction, placing result in destination

G. Execution and decoding are often intermingled

H. Execution must come before decoding

I. Fetch destination operands

J. Fetch the instruction located in the IR

K. Fetch instruction pointed to by PC

L. For security, instructions are encrypted and must be decoded prior to

execution

M. If applicable, determine destination of result

N. If applicable, obtain operands

O. If applicable, take a hardware look at addressing mode field

P. Immediate

Q. Increment PC by instruction size

R. It is not; at the machine level only sequential execution is permitted

S. A jump requires operator intervention, a branch is accomplished via

microcode

T. Memory direct

U. Memory indirect

V. Memory register

W. No, execution of one instruction may require several machine cycles

X. No, machine cycles occur only in washing machines, not computers

Y. Register direct

Z. Register immediate

AA. Register indirect

BB. Register memory

CC. Restore the PC to its original value

DD. Rotate operands

EE. Send Fido after it

FF. Take a hardware look at opcode field of instruction

GG. To allow for formatted input

HH. To allow for formatted output

II. To specify the role of each field of the instruction

JJ. Yes, on each machine cycle exactly one instruction is executed

Choose from these answers for Questions #20 to 43.

A. both

B. can

C. cannot

D. hardwired

E. In the instruction itself

F. In the memory folder

G. In a memory location specified by a register

H. In a register

I. In the register folder

J. Interactive multiprogramming

K. Locality is basically irrelevant to OS concerns.

L. Many programs exhibit a high degree of locality. OS designers work to take advantage of

that fact to get better usage of resources.

M. microcode

N. Monitored batch systems

O. Most programs have a low degree of locality. OS designers run workshops to teach programmers

how to improve the degree of locality of their programs.

P. Multiprocessing and multitasking are the same, since task is another word for process.

Q. Multiprogrammed batch systems

R. Multiprogramming and multitasking as synonymous. Multiprocessing is multiprogramming on

a multiprocessor.

S. Multiprogramming refers to running several programs on one machine.

T. must

U. no

V. No, locality is a property of programs; machine design has nothing to do with it

W. On the desktop of the machine

X. Operator controlled machines

Y. Prehistory

Z. Posthistory

AA. pseudocode

BB. Simple batch systems

CC. Single user multiprogramming

DD. Single user uniprogramming

EE. spatial

FF. Spatial locality is a generalization of temporal locality

GG. temporal

HH. Temporal locality is a generalization of spatial locality

II. There is not relationship. They are separate concepts.

JJ. They are all three the same

KK. Time is inherent in the definition of temporal locality. But it is irrelevant to spatial locality, which

refers to how far memory references are from each other.

LL. To be useful in OS design, clustered memory references must take place within a short time

frame.

MM. uniprogrammed

NN. Uniprogrammed batch systems

OO. User scheduling

PP. User setup and breakdown

QQ. User uniprogramming

RR. written in software

SS. yes

TT. Yes, an addressing mode may require access to memory locations not in proximity to each

other