File System And Device Management (Basic Level) - 1


10 Questions MCQ Test Question Bank for GATE Computer Science Engineering | File System And Device Management (Basic Level) - 1


Description
This mock test of File System And Device Management (Basic Level) - 1 for Computer Science Engineering (CSE) helps you for every Computer Science Engineering (CSE) entrance exam. This contains 10 Multiple Choice Questions for Computer Science Engineering (CSE) File System And Device Management (Basic Level) - 1 (mcq) to study with solutions a complete question bank. The solved questions answers in this File System And Device Management (Basic Level) - 1 quiz give you a good mix of easy questions and tough questions. Computer Science Engineering (CSE) students definitely take this File System And Device Management (Basic Level) - 1 exercise for a better result in the exam. You can find other File System And Device Management (Basic Level) - 1 extra questions, long questions & short questions for Computer Science Engineering (CSE) on EduRev as well by searching above.
QUESTION: 1

The page replacement policy that sometimes leads to more page faults when the size of the memory is increased is

Solution:

It is due to Belady’s Anomaly in which more frames may sometimes lead to more page fault.

QUESTION: 2

Which of the following page replacement algorithms suffers from Belady’s anomaly?

Solution:

There are two types of page replacement algorithm mainly stack based and non-stack based, it is observed that algorithms which follows the latter one suffers from Belady’s anomaly. FIFO suffers from Belady's anomaly.

QUESTION: 3

Match List-I with List-ll select the correct answer using the codes given below the lists:

Solution:

SCAN is a disk scheduling algorithm:

  • Batch processing can be successfully done by FIFO without starvation.
  • Round Robin work son times haring mechanism.
  • Interrupt processing (means interrupted process to be handled, last in first out). (LIFO)
QUESTION: 4

Thrashing

Solution:

When to increase multi-programming, a lot of processes are brought into memory. Then, what happens is, no process gets enough memory space and processor needs to keep bringing new pages into the memory to satisfy the requests. (A lot of page faults occurs). This process of excessive page replacements is called thrashing, which in turn reduces the overall performance.

QUESTION: 5

The data block of a very large file in the Unix file system are allocated using

Solution:

Data block of a very large file in the UNIX file system are allocated using an extersion of induced allocation.

QUESTION: 6

Given reference to the following page by a program:
0, 9, 0, 1,8, 1,8, 7, 8, 7, 1,2, 8, 2, 7, 8, 2, 3, 8, 3 
If the program contains 3 page frames.
How many page fault will occur in optimal page replacement policy?

Solution:

QUESTION: 7

On a system the average process size be 128 KB and each page entry requires 8 bytes then what will be the optimal page size.

Solution:


QUESTION: 8

Four page frames and page references in the order 0 2 1 3 2 1 0 1 2 1
By using LRU page replacement algorithm the least recently used page will be 

Solution:

For the sequence 0, 2, 1, 3, 2, 1, 0, 1, 2, 1

QUESTION: 9

Determine the page faults when FIFO is applied to the following string with 3 frames 2, 4, 3, 1, 5, 3, 2, 5, 3, 1, 4, 2 

Solution:


So, 10 page faults.

QUESTION: 10

Consider the following page addresses stream frequency by executing the program with 3 frames. 1 2 3 1 2 5 8 7
By using optimal page replacement, number of page fault will be ....... and the number of page hit will be .......

Solution:


So, 6 page faults and 2 page hit.