Q. Piece of code that only one thread can execute at a time is called

View solution

Q. When there is enough memory to fit a process in memory, but the space is not contiguous we need

View solution

Q. Which memory allocation policy allocate the largest hole to the process?

View solution

Q. Dived logical memory into blocks with the same size as frames are called

View solution

Q. Which scheduler selects which processes should be brought into the ready queue?

View solution

Q. Which of the following is not the approach to Handling Deadlocks

View solution

Q. Bring a page into memory only when it is needed is called

View solution

Q. Page-Table length register (PTLR) indicates size of

View solution

Q. Paging is implemented in

View solution

Q. Virtual Memory

View solution

Q. Under virtual storage,

View solution

Q. Paging

View solution

Q. Which of the following is not true about the memory management?

View solution

Q. The principle of locality of reference justifies the use of

View solution

Q. In virtual memory systems, Dynamic address translation

View solution

Q. Which is not true about the memory management?

View solution

Q. Thrashing

View solution

Q. A process that execute only in main memory is referred to as ……………… and that allocated in disk is referred to a …………….

View solution

Q. Virtual memory can be implemented with

View solution

Q. Page fault frequency in an operating system is reduced when the

View solution