exam 1 - Summer 2011 KEY

exam 1 - Summer 2011 KEY - COP 4600 Exam #1 Summer 2011...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
This test is comprised of three different types of questions: multiple choice, true/false, and short answer. If you need more room for some answers (for problems 23-28) use the backs of pages – label all answers clearly if you do this!!! Multiple choice - circle the number which corresponds to the best answer or best completes each statement. True or False - circle the word True if the statement is true and circle False if the statement is false. Short answer – provide a short but complete answer to the question. Don’t write paragraphs. You simply need to convince me that you know what’s going on with the concept on which the question is based. Problems 1-22 are worth 2 points each. Points for problems 23-25 are shown with the problem. 1. The primary goal of a modern operating system is (consider current perspective and not an historical perspective): (a) to manage the resources of the computer system in an efficient manner. (b) to make the underlying hardware (the computer system) more convenient to use. (c) to allow for multitasking of the CPU. (d) to maintain a library of system calls and interrupt handlers to process jobs. 2. Which of the following is typically the critical performance requirement in an interactive (time- sharing) operating system environment? (a) Minimizing response time. (b) Maximizing throughput. (c) Minimizing the total number of interrupts that occur. (d) None of the above are accurate. 1 COP 4600 – Exam #1 – Summer 2011 June 16, 2011 100 points total Name: (Please print clearly) KEY
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
3. Consider the multi-level feedback uni-processor scheduling protocol. Which type of process is favored by this protocol? (a) CPU-bound processes. (b) I/O-bound processes. (c) This protocol would favor neither CPU-bound nor I/O-bound processes. 4. A standard “garden-variety” context-switch involves removing a running process from the CPU and replacing it with another process. Assuming that a dispatcher process is responsible for handling the context-switch and no interrupt handler is required for this context-switch, how many different “contexts” will the CPU see before the context-switch is completed? (a) 2 (b) 3 (the original process, the dispatcher process, and the new process) (c) 4 (d) 6 5. In problem #4, we assumed that no interrupt handler was involved in the context-switch. In this case, assume that an interrupt handler is involved with the context-switch (assume, for example, that the executing process requested some I/O service). Assuming that a dispatcher process is responsible for handling the context-switch, how many different “contexts” will the CPU see before the context-switch is completed? (a) 2
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 8

exam 1 - Summer 2011 KEY - COP 4600 Exam #1 Summer 2011...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online