Consider a buddy system memory allocation where the size of a free memory segment is 256 KB, and the memory of kernel is 33 KB. To fulfill the request of memory allocation, a memory block of size M from free memory pool is allocated. What is the size of M?

Find out the total size of internal fragmentation in case of first fit algorithm. undefined

Consider a FIFO page replacement algorithm containing three frames. Initially, there is no page loaded in any of the frames. If the system first accesses 60 distinct pages in some order and then accesses the same pages in reverse order, calculate the total number of page faults.

In demand paging, if average page fault service time is 7 millisecond, memory access time is 150 nanoseconds. A process 'P' executes successfully without replacing any frame. What is the effective access time?

If a page fault occurs in step 5, which of the step(s) will execute again? undefined

__________ helps us to distinguish the pages in the memory and the pages on the disk.

If a process is spending much more time in paging than executing, then this phenomenon is called __________.

Local replacement algorithm is used to avoid

A process can be swapped out from the memory, if i. its time quanta has expired in Round-robin scheduling ii. higher priority process has arrived in priority scheduling iii. a new process of less execution time has arrived in FCFS scheduling

Demand paging is commonly used in ___________.

Where does the swap space reside in the system?

Consider the following reference strings with three frames: 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6. Find out the total number of page fault, if LRU (Least Recently Used) page replacement algorithm is implemented.

Which of the following is the fastest memory?

Which of the following is/are the extension(s) of Batch file?

Attribute of file consists of _________.

Which of the following allows a user to erase the content of a file but keep its attributes?

Which of the following is/are the properties of storage devices? (i) Its speed is slower than the primary memory. (ii) It is cheaper than the primary memory. (iii) It is non-volatile in nature.

Consider the following data ||| |---|---| |
Job size in KB |
Execution Time in microseconds | |
6 |
3 | |
9 |
4 | |
3 |
1 | |
5 |
2 | |
11 |
9 | |
20 |
6 | |
2 |
1 |

If the best fit algorithm is used for allocating jobs to memory partitions of sizes 4KB, 8KB, 20KB and 3KB, when will the 20KB job complete?

Calculate the total size of external fragmentation in first fit algorithm.

 Consider a partitioned memory of sizes 200 KB, 400 KB, 60 KB, 500 KB and 350 KB and processes of 268 KB, 125 KB, 340 KB, 110 KB and 58 KB arrive in order.

Which of the following cases takes the highest access time?