Q331. The SJF algorithm executes first the job
a) that last entered the queue
b) that first entered the queue
c) that has been in the queue the longest
d) with the least processor needs
Answer : d
Q332. Page-Table length register (PTLR) indicates size of
a) Page Table
b) Paging File
c) Main Memory
d) Virtual Memory
Answer : a
Q333. Bring a page into memory only when it is needed is called
a) Demand Memory
b) Demand Paging
c) Page Fault
d) Page Segmentation
Answer : b
Q334. Which of the following is not the approach to Handling Deadlocks
a) Deadlock Prevention
b) Deadlock Avoidance
c) Detect & Recover
d) Virtual Memory
Answer : d
Q335. Dived logical memory into blocks with the same size as frames are called
a) Pages
b) Frames
c) Page Table
d) Segmentation
Answer : a
Q336. Which memory allocation policy allocate the largest hole to the process?
a) Best-Fit
b) Worst-Fit
c) First-Fit
d) None of them
Answer : b
Q337. When there is enough memory to fit a process in memory, but the space is not contiguous we need
a) Internal Fragmentation
b) Virtual Fragmentation
c) External Fragmentation
d) None of them
Answer : c
Q338. 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
Answer : d
Q339. 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
Answer : d
Q340. First-in-First-Out (FIFO) scheduling is
a) Non Preemptive Scheduling
b) Preemptive Scheduling
c) Fair Share Scheduling
d) Deadline Scheduling
Answer : a