操作系统试卷os08(B).docVIP

东 南 大 学 考 试 卷（B 卷） 课程名称 操作系统 考试学期 07-08-2 得分 适用专业 计算机应用 考试形式 闭卷 考试时间长度 120分钟 一、Definitions [5X6=30 pts] Give the technical term that best fits these definitions 1. Portion of a program that accesses shared variables and that no two processes can be executing this code that manipulates shared variables at the same time. 2. It is a method of overlapping the I/O of a job with that job抯 own computation. The idea is simple. After a read operation completes and the job is about to start operating on the data, the input device is instructed to begin the next read immediately. The CPU and input device are then both busy. 3. Some devices, such as tape drives and printers, cannot usefully multiplex the I/0 requests of multiple concurrent applications. The subsystems can coordinate concurrent output to a separate disk file. For instance, When an application finishes printing, the subsystem copies the queued files to the printer one, at a time. 4. Unused routine is never loaded. 5. A process is busy swapping pages in and out. 6. A small operating system core that provides basic scheduling, memory management and communication services while relying on processes to perform the other required functionality traditionally associated with the operating system. 二、Comparisons[6+9=15pts] Complete the following comparisons using True, False or Possible 1.[6pts]Blocking I/o versus Noblocking I/O 2. [9 pts] Threads versus processes 三、Computing[10+12=22 pts] 1.Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 143, and the previous request was at cylinder 125. The queue of pending requests, in FIFO order, is 86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130 Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests, for each of the following disk-scheduling algorithms? [10 pts] a. SSTF b. LOOK 2. Consider the follo