1、 1 1.1What are the three main purposes of an operating system? (1)帮助执行用户程序 (2)管理软硬件资源 （ 3）为用户提供操作接口（ 4）组织用户更好地使用计算机 1.2 List the four steps that are necessary to run a program on a completely dedicated machine. Preprocessing Processing Linking Executing. 答 ：（ 1）预约计算机时间（ 2)手动把程序加载到内存 （ 3）加载起始地址并开始执行
2、（ 4）在电脑的控制台监督和控制程序的执行 1.6 Define the essential properties of the following types of operating systems: a. Batch b. Interactive c. Time sharing d. Real time e. Network f. Distributed 答： A.批处理系统：成批处理作业，用户脱机工作，单、多道程序运行，适合 处理需要很少交互的大型工件； B.交互式系统：交互性，及时性 C.分时系统：同时性，交互性，及时性，独立性 D.实时系统 ：对时间有严格要求，外部事件驱动方式，响
3、应及时，容错 -双机备份，可靠性高，通常为特殊用途提供专用系统 E、网络操作系统：网络通信，可实现无差错的数据传输；共享软硬件； 网络管理（比如安全控制 );网络服务 F、分布式系统：多台分散的计算机经互联网连接而成的系统，处理器不共享内存和一个时钟，每个处理器有自己的内存，它们通过总线互相交流。 1.7 We have stressed the need for an operating system to make efficient use of the computing hardware. When is it appropriate for the operating system
4、 to forsake this principle and to“waste” resources? Why is such a system not really wasteful? 答：单用户系统，它应该最大化地为用户使用，一个 GUI（图形化用户接口）可能 会浪费 CPU周期，但是它优化了用户和系统的交互。 2.2 How does the distinction between monitor mode and user mode function as a rudimentary form of protection (security) system? 答： monitor mo
5、de(管理状态，也是特权状态，可以执行全部指令，包括特权指令和非特权指令，访问所有资源并且具有改变处理器状态的能力） user mode （用户状态，也叫目态，只能执行非特权指令 ) 注解： rudimentary(基本的，初步的 ) distinction (区别） 特权指令 ( privileged instructions):只提供给操作系统的核心程序使用，不给用户提供。 2.3 What are the differences between a trap and an interrupt? What is the use of each function? 答：陷入（ trap)是由
6、处理器正在执行的指令导致的，一条指令执行期间允许响应陷入，通常陷入处理程序提供的服务是当前进程所需要 的。一般发生在软件层。 中断（ interrupt)是由于与现行指令无关的中断信号发出的，通常在两条机器指令之间才可以响应中断，一般来说，中断处理程序提供的服务不是当前进程所需要的。一般发生在硬件里。 陷入可以用来调用操作系统程序，寻找算术错误 中断用于标记一个 I/O设备的完成，用来消除设备轮询。 2.5 Which of the following instructions should be privileged? a. Set value of timer. b. Read the c
7、lock. c. Clear memory. d. Turn off interrupts. e. Switch from user to monitor mode. 答案： a,c,d,e 特权指令：（ 1）允许和禁止中断，控制中断禁止屏蔽位（ 2）在进程间切换处理（ 3）存取用于主存保护的寄存器（ 4）执行 I/O操作 (5)停止一个中央处理机的工作 (6)清理内存 (7)设置时钟（ 8）建立存储键（ 9）加载 PSW 2.8 Protecting the operating system is crucial to ensuring that the computer system op
8、erates correctly. Provision of this protection is the reason behind dual-mode operation, memory protection, and the timer. To allow maximum flexibility, however, we would also like to place minimal constraints on the user. 2 The following is a list of operations that are normally protected. What is
9、the minimal set of instructions that must be protected? a. Change to user mode. b. Change to monitor mode. c. Read from monitor memory. d. Write into monitor memory. e. Fetch an instruction from monitor memory. f. Turn on timer interrupt. g. Turn off timer interrupt. 答案： b,c,d,g 3.6 List five servic
10、es provided by an operating system. Explain how each provides convenience to the users. Explain also in which cases it would be impossible for user-level programs to provide these services. 答：（ 1)执行程序 ，操作系统加载文件的目录到内存中并开始执行。在用户程序不能合理分配 CPU时间的情况下不能提供该项服务。 （ 2） I/O操作 ，程序运行过程中需要 I/O设备上的数据时，可以通过 I/O命令或 I
11、/O指令，请求操作系统的服务。 （ 3） 文件系统操作 ，文件系统让用户按文件名 创建 ，读写，修改，删除文件，使用方便，安全可靠。当设计多用户访问或共享文件时，操作系统还提供信息保护机制。 （ 4） 通信服务 ，在很多情况下，一个进程要与另外的进程交换信息， 进程通信可以借助共享内存实现，也可使用消息消息传送技术实现。 （ 5） 错误检测 ， OS可以不做和处理各种硬件和软件造成的差错和异常，并让他们造成的影响缩小在最小范围内。 3.7 What is the purpose of system calls? 答 :系统调用（ system calls)的目的：扩充机器功能，增强系统能力，方
12、便用户使用 3.10 What is the purpose of system programs? 答：系统程序通过系统调用可以访问系统资源，调用操作系统。它提供基本的服务给用户，这样用不需 要自己编写程序便可以解决问题。 4.1 MS-DOS provided no means of concurrent processing. Discuss three major complications that concurrent processing adds to an operating system. 答：（ 1）采取共享时间的方法 允许每个进程都可访问系统。这种方法包括剥夺不主动放弃
13、 CPU 的进程和可重入的内核（ 2）进程和系统资源必须有保护，互相隔离开。每个进程可使用的内存有限，同时在设备上 (比如磁盘 )的操作也是有限的（ 3）关注内核，防止进程间出现死锁 5.1 Provide two programming examples of multithreading giving improve performance over a single-threaded solution. 5.3 What are two differences between user-level threads and kernel-level threads? Under what
14、circumstances is one type better than the other? 答：（ 1）在 KLT(内核级线程）：和传统的基于进程操作系统中，大多数系统调用将阻塞进程，因此当线程执行一个系统调用是，不仅该线程被阻塞，而且进程内所有线程都会被阻塞，但是 ULT中，可以选择另一个线程运行（ 2)在纯 ULT中，多线程应用不能利用多重处理的优点，内核在一段时间里，分配一个进程进占用 CPU。 6.3 Consider the following set of processes, with the length of the CPU-burst time given in mi
15、lliseconds: Process Burst Time Priority P1 10 3 P2 1 1 P3 2 3 P4 1 4 P5 5 2 3 The processes are assumed to have arrived in the order P1, P2, P3, P4, P5, all at time 0. a. Draw four Gantt charts illustrating the execution of these processes using FCFS, SJF, a nonpreemptive priority (a smaller priorit
16、y number implies a higher priority), and RR (quantum = 1) scheduling. b. What is the turnaround time of each process for each of the scheduling algorithms in part a? c. What is the waiting time of each process for each of the scheduling algorithms in part a? d. Which of the schedules in part a resul
17、ts in the minimal average waiting time (over all processes)? 6.4 Suppose that the following processes arrive for execution at the times indicated. Each process will run the listed amount of time. In answering the questions, use nonpreemptive scheduling and base all decisions on the information you h
18、ave at the time the decision must be made. a. What is the average turnaround time for these processes with the FCFS scheduling algorithm? b. What is the average turnaround time for these processes with the SJF scheduling algorithm? c. The SJF algorithm is supposed to improve performance, but notice
19、that we chose to run process P1 at time 0 because we did not know that two shorter processes would arrive soon. Compute what the average turnaround time will be if the CPU is left idle for the first 1 unit and then SJF scheduling is used. Remember that processes P1 and P2 are waiting during this idl
20、e time, so their waiting time may increase. This algorithm could be known as future-knowledge scheduling. 4 6.10 Explain the differences in the degree to which the following scheduling algorithms discriminate in favor of short processes: a. FCFS b. RR c. Multilevel feedback queues 7.7 Show that, if
21、the wait and signal operations are not executed atomically, then mutual exclusion may be violated. 7.8 The Sleeping-Barber Problem. A barbershop consists of a waiting room with n chairs and the barber room containing the barber chair. If there are no customers to be served,the barber goes to sleep.
22、If a customer enters the barbershop and all chairs are occupied, then the customer leaves the shop.If the barber is busy but chairs are available, then the customer sits in one of the free chairs. If the barber is asleep, the customer wakes up the barber. Write a program to coordinate the barber and
23、 the customers. 8.2 Is it possible to have a deadlock involving only one single process? Explain your answer. 8.4 Consider the traffic deadlock depicted in Figure 8.11. a. Show that the four necessary conditions for deadlock indeed hold in this example. b. State a simple rule that will avoid deadloc
24、ks in this system. 8.13 Consider the following snapshot of a system: Allocation Max Available A B C D A B C D A B C D P0 0 0 1 2 0 0 1 2 1 5 2 0 P1 1 0 0 0 1 7 5 0 P2 1 3 5 4 2 3 5 6 P3 0 6 3 2 0 6 5 2 P4 0 0 1 4 0 6 5 6 Answer the following questions using the bankers algorithm: a. What is the cont
25、ent of the matrix Need? b. Is the system in a safe state? c. If a request from process P1 arrives for (0,4,2,0), can the request be granted immediately? 5 9.5 Given memory partitions of 100K, 500K, 200K, 300K, and 600K (in order), how would each of the First-fit, Best-fit, and Worst-fit algorithms p
26、lace processes of 212K, 417K, 112K, and 426K (in order)? Which algorithm makes the most efficient use of memory? 9.8 Consider a logical address space of eight pages of 1024 words each, mapped onto a physical memory of 32 frames. a. How many bits are there in the logical address? b. How many bits are
27、 there in the physical address? 9.16 Consider the following segment table: Segment Base Length 0 219 600 1 2300 14 2 90 100 3 1327 580 4 1952 96 What are the physical addresses for the following logical addresses? a. 0,430 b. 1,10 c. 2,500 d. 3,400 e. 4,112 6 10.2 Assume that you have a page referen
28、ce string for a process with m frames (initially all empty). The page reference string has length p with n distinct page numbers occur in it. For any page-replacement algorithms, a. What is a lower bound on the number of page faults? b. What is an upper bound on the number of page faults? 10.11 Cons
29、ider the following page reference string: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. How many page faults would occur for the following replacement algorithms, assuming one, two, three, four, five, six, or seven frames? Remember all frames are initially empty, so your first unique p
30、ages will all cost one fault each. LRU replacement FIFO replacement Optimal replacement 11.7 Explain the purpose of the open and close operations. 11.9 Give an example of an application in which data in a file should be accessed in the following order: a. Sequentially b. Randomly 11.12 Consider a sy
31、stem that supports 5000 users. Suppose that you want to allow 4990 of these users to be able to access one file. a. How would you specify this protection scheme in UNIX? b. Could you suggest another protection scheme that can be used more effectively for this purpose than the scheme provided by UNIX
32、? 7 12.1 Consider a file currently consisting of 100 blocks. Assume that the file control block (and the index block, in the case of indexed allocation) is already in memory. Calculate how many disk I/O operations are required for contiguous, linked, and indexed (single -level) allocation strategies
33、, if, for one block, the following conditions hold. In the contiguousallocation case, assume that there is no room to grow in the beginning, but there is room to grow in the end. Assume that the block information to be added is stored in memory. a. The block is added at the beginning. b. The block i
34、s added in the middle. c. The block is added at the end. d. The block is removed from the beginning. e. The block is removed from the middle. f. The block is removed from the end. 13.2 Consider the following I/O scenarios on a single-user PC. a. A mouse used with a graphical user interface b. A tape
35、 drive on a multitasking operating system (assume no device preallocation is available) c. A disk drive containing user files d. A graphics card with direct bus connection, accessible through memory-mapped I/O For each of these I/O scenarios, would you design the operating system to use buffering, s
36、pooling, caching, or a combination? Would you use polled I/O, or interrupt-driven I/O? Give reasons for your choices. 8 14.2 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 q
37、ueue 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 diskscheduling algorithms? a. FCFS b. SSTF c. SCAN d. LOOK e. C-SCAN 1.1 1.6 2.3 2.5 3.7 6.3 6。 4 7.8 8.13 9.5 9.8 10.11 12.1 14.2
