1) In Figure 4-22 on page 303, (a) shows a 1KB disk block can hold 256 32-bit disk block numbers. If a disk block number uses 128 bits, how many disk block numbers can 1KB disk block hold? The first image at the botton is for this problem.

A. 128

B. 64

C. 32

D. 16

E. Your answer: ______________________

2) Which of the following statements is NOT true?

A. An i-node (index-node) is a data structure used for representing a file in terms of its attributes and the addresses where it is located on disk.

B. An absolute path name of a file refers to the path from the root directory to the file.

C. A file system is part of an operating system.

D. A journaling file system is mainly used to prevent a system from crashing.

3) Similar to Figure 5-24 on page 380, if the new requests come in for cylinders 4, 31, 17, 27, 6, and 13 while the seek to cylinder 11 is in progress, what are the total cylinders the disk arm should move to fulfill all the requests based on the SSF (Shortest Seek First) algorithm?

A. 45

B. 46

C. 47

D. 48

E. Your answer: ___________________

4) Based on the discussion on interrupt, which of the following statements is NOT true?

A. The interrupt signal causes the CPU to stop what it is doing and start doing something else.

B. The interrupt vector can only be saved in memory.

C. Before CPU responds to an interrupt request, the program counter of the interrupted process must be saved so that it can be used to restart the interrupted process at a later time.

D. A precise interrupt is defined as an interrupt that leaves the machine in a well-defined state.

5) In the I/O system, the responsibility of the layer of device drivers is to

A. perform I/O operation

B. wake driver when I/O completed

C. make I/O call and format I/O

D. set up device registers and check status

6) A resource graph is usually used in which of the following strategies for dealing with deadlock issues in operating systems? (Chapter 6)

A. deadlock avoidance

B. deadlock detection

C. deadlock prevention

D. deadlock recovery

Generally, free blocks are used to hold the free list, so the storage gmillion blocks. Genera bill blocks. Generally, free blocks are used to hold tequires about 4 ntially free s asentilly Free disk blocks: 16, 17, 18 42 136 210 97 41 63 21 48 230 162 612 342 214 160 664 216 320 86 234 897 422 140 223 223 160 126 1001101101101100 1010110110110110 0110110110111011 1110111011101111 1101101010001111 0000111011010111 1011101101101111 1100100011101111 262 310 180 51600 482 142 0111011101110111 141 A 1-KB disk block can hold 256 32-bit disk block numbers A bitmap Figure 4-22. (a) Storing the free list on a linked list. (b) A bitmap. tochnique is the bitmap. A disk with n