Osg 202 Final Exam Updated Questions And Correct Answers

OSG 202 FINAL EXAM UPDATED QUESTIONS AND
CORRECT ANSWERS
Question:
1. In modern printing systems, a disk accepts output from several users. Deadlock occurs when
_________.
A. The network connection for the printer overflows
with to many requests to use the printer.
B. The buffer fills up with too many print jobs and the
printer cannot decide which one to print.
C. The printer needs all of a job's output before it will
begin printing, but the spooling system fills the avail-able disk space with only partially completed
output.
D. Too many users attempt to access the printer at the
same time.
Answer:
C. The printer needs all
of a job's output before it will begin printing, but the spooling system fills the available disk space
with only partially com-pleted output.

Question:
2. In terms of speed the best method of Dynamic Stor-age-Allocation is:
A. Next fit
B. First fit
C. Worst fit
D. Best fit
Answer:
B. First fit

Question:
3. In terms of storage utilization the best method of Dynamic Storage-Allocation is:
A. Next fit
B. First fit
C. Worst fit
D. Best fit
Answer:
D. Best fit

Question:
4. List of memory location, that contains the executable program, the program's data, and its stack is
called:
A. set of resources
B. address space
C. address memory
D. All of the other choices
Answer:
C. address memory

,Question:
5. An example of preemtable resource is
A. DVD device
B. Memory
C. CD-ROM device
D. None of the other choices
Answer:
B. Memory

Question:
6. Which of the following file structure is used for file system in Window?
A. Byte sequence
B. Tree
C. Record sequence
D. Ring
Answer:
B. Tree (used on large
mainframe computers)

Question:
7. Which of the following is specified to indicate the di-rectory where the file is located?
A. Extension
B. Sub-directory
C. Path name
D. Root directory
Answer:
C. Path name

Question:
8. Typical approaches to handle deadlocks do not in-clude
A. Deterrence
B. Detection
C. Avoidance
D. Prevention
Answer:
A. Deterrence

Question:
9. For matrix-based algorithm to detect deadlock, num-ber of instances of each resource each process
cur-rently holds is given by
A. Current allocation matrix
B. Request matrix
C. Existing resource vector
D. Available resource vector
Answer:
A. Current allocation ma-
trix

, Question:
10. File Structure can be:
A. Byte Sequence
B. Tree
C. Record Sequence
D. All of other choices
Answer:
D. All of other choices

Question:
11. What is interrupt vector?
(table where its entry contains the memory address of Interrupt service routine: interrupt vector table)
A. Part of memory which contains the address of inter-
rupt handlers
B. A signal an I/O device sends to CPU
C. The address of interrupt handlers
D. None of the other choices
Answer:
A. Part of memory which
contains the address of in-terrupt handlers

Question:
12. Which method is used to prevent the communication deadlock?
A. Acknowledge signal
B. Handling alarm
C. Timeouts
D. All of the other choices
Answer:
C. Timeouts

Question:
13. If a system is deadlocked, no process can
A. run
B. be awakened
C. release resources
D. All of the other choices
Answer:
D. All of the other choices

Question:
14. In separating I/O and memory space system, the set of I/O ports from the I/O port space. The
mechanism allows:
A. Only program in kernel can access to I/O devices
B. Programs in user space can easily access to I/O
devices
C. Both programs in user space and kernel can access
to I/O space
D. None of the other choices