4-1 Which one of the following is not the function of Operating System?
A. Resource Management
B. File Management
C. Networking
D. Processor Management
4-2 The Banker’s algorithm is used
A. to rectify deadlock
B. to detect deadlock
C. to prevent deadlock
D. to slove deadlock
4-3 Which of the following concept is best to preventing page faults?
A. Paging
B. The working set
C. Hit ratios
D. Address location resolution
4-4 Which of the following memory unit that processor can access more
rapidly
A. Main Memory
B. Virtual Memory
C. Cache memory
D. Read Only Memory
4-5 A page fault occurs when
A. the Deadlock happens
B. the Segmentation starts
C. the page is found in the memory
D. the page is not found in the memory
4-6 Bringing a page into memory only when it is needed, this
mechanism is called
A. Deadlock
B. Page Fault
C. Dormant Paging
D. Demand Paging
4-7 First-in-First-Out (FIFO) scheduling is
A. Non Preemptive Scheduling
B. Preemptive Scheduling
C. Fair Share Scheduling
D. Deadline Scheduling
4-8 Copying a process from memory to disk to allow space for other
processes is Called
A. Swapping
B. Deadlock
C. Demand Paging
D. Page Fault
4-9. The necessary conditions needed before deadlock can occur?
A. No Mutual Exclusion, Hold and wait, Preemption, Circular Wait
B. Mutual Exclusion, No Hold and wait, Preemption, Circular Wait
C. Mutual Exclusion, Hold and wait, No Preemption, Circular Wait
D. Mutual Exclusion, Hold and wait, Preemption, No Circular Wait
4-10 A program in execution is called
A. A Paging
B. A Process
C. A virtual memory
D. A Demand Page
Answers
1 – C 2 – C 3 – B 4 – C 5 – D
6 – D 7 – A 8 – A 9 – C 10 – B
0 comments:
Post a Comment