test23 - 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 (Wednesday December 13 th ) 200 points Part 1 (50 points : 2 points per question) 1) To compute the maximum addressable space, 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 one data memory reference. 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 ________________ provide service to ______________. a) operating system routines : bios interrupts b) user applications : operating system routine c) user applications: bios interrupts d) bios interrupts : operating system routines 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) __________ is best for ________ processing. a) FCFS:interactive b) SJF:interactive c) RR:interactive d) SRTF:interactive e) None 6 6) The round robin CPU scheduling policy is best suited to improve the 7 a) average response time. b) average turnaround time. c ) average number of context switches 8 d) fairness. e) all the above 9 7) When successful, the fork() function returns __ in the parent and ___ in the child. A. 0:1 B: 1:0 C.-1:0 D. 0:-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 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 from a) ready to running b) waiting to running c) suspended to ready d) running to waiting e) none of the above 1/7
Background image of page 1

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

View Full Document Right Arrow Icon
11) Mutual exclusion for more than 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.

{[ snackBarMessage ]}

Page1 / 7

test23 - 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