test32 - AL AKHAWAYN UNIVERSITY IN IFRANE School of Science...

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

View Full Document Right Arrow Icon
AL AKHAWAYN UNIVERSITY IN IFRANE School of Science and Engineering CSC 3351 Operating Systems Test 3 (Friday May 12 th ) 200 points Part 1 (50 points : 2 points per question) 1) To compute the maximum memory capacity depends, we need only : a) the size of the address bus. b) the unit of storage (i.e., the amount stored at each address plus a) c) the size of the data bus plus b) d) the size of program counter plus b) e) all of the above. 2) Assume that all the instructions of a CPU allow at most 2 data memory references. Then, the maximum number of page faults that an instruction may incur is : a) one. b) two. c) three. d) four. e) None of the above. 3) On a PC, the ________________ may call the ______________. a) operating system routines : bios interrupts b) bios interrupts : operating system routine c) windows applications: communication protocols d) microprocessor : interrupts e) None of the above 4) In _____________ system, the short-term CPU scheduler is a _____________ algorithm. a) an early batch: quite complex b) a time-shared : simple c) an early batch: straightforward d) a multiprogrammed: quite simple e) None of the above 5) A _____________ is ___________. a) process: a program b) process : an abstraction of a program in memory c) process: a program in execution d) process: a program on disk e) None of the above 6) The shortest remaining time job first CPU scheduling policy is optimal in terms of a) average response time. b) average tirnaround time. c) average number of context switches and a) d) fairness. e) all the above 7) First come first serve CPU scheduling policy can be simulated with a multi-level feedback system with a) an infinite number of queues with quantum=1. b) an infinite number of queues with infinite quantum. c) one queue. d) one queue with quantum=1. e) none of the above 8) The medium-term scheduler is the algorithm that decides to switch the state of a process from a) ready to running b) waiting to running c) suspended to ready d) running to waiting e) none of the above 1/8
Background image of page 1

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

View Full DocumentRight Arrow Icon
9) The short-term scheduler is the algorithm that decides to switch the state of a process from a) ready to running b) waiting to running c) suspended to ready d) running to waiting e) none of the above 10) The long-term scheduler is the algorithm that decides to switch the state of a process from a) ready to running b) waiting to running c) suspended to ready d) running to waiting e) none of the above 11) Mutual exclusion for two processes can be easily solved by ___________ that is a mechanism provided by the O.S. a)
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.

This note was uploaded on 11/15/2011 for the course COMP 3500 taught by Professor Wang,y during the Summer '08 term at Auburn University.

Page1 / 8

test32 - AL AKHAWAYN UNIVERSITY IN IFRANE School of Science...

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