Consider a virtual memory system with FIFO page replacement policy. For an arbitrary page access pattern, increasing the number of page frames in main memory will

Which of the following scheduling algorithms is non-preemptive?

In which one of the following page replacement policies, Belady’s anomaly may occur?

The essential content(s) in each entry of a page table is / are ( asked by Google )

A system uses FIFO policy for page replacement. It has 4 page frames with no pages loaded to begin with. The system first accesses 100 distinct pages in some order and then accesses the same 100 pages but now in the reverse order. How many page faults will occur?

Which of the following statements are true?

I. Shortest remaining time first scheduling may cause starvation

II. Preemptive scheduling may cause starvation

III. Round robin is better than FCFS in terms of response time

I. If a process makes a transition D, it would result in another process making transition A immediately.

II. A process P2 in blocked state can make transition E while another process P1 is in running state.

III. The OS uses preemptive scheduling.

IV. The OS uses non-preemptive scheduling.

Which of the above statements are TRUE?

A process executes the following code:-

for(i=0;i<n;i++) {

fork();

}

The total number of child processes created is:-

Which of the following is NOT true of deadlock prevention and deadlock avoidance schemes? ( coceptual question )

Increasing the RAM of a computer typically improves performance because:

Which of the following approach is used in Time shairing system ?

Ostrich algorithm is used for :-

Which of the following is responsible for bringing a process from waiting state or blocked state to ready state ?

Which of the following statements are true ?

I.) variable size partitioning suffers from both internal and external fragmentation

II.) there is no internal fragmentation in paging

III.) fixed size partitioning suffers from both internal and external fragmentation

According to best fit partitioning scheme what will be the correct allocation of above fixed size memory snippet :-

Number of enteries in a page table is equal to :-

Which of the following are true regarding TLB ?

I.) TLB is not a Data structure

II.) After every new process comes, old TLB is cleared

III.) Every process has its separate TLB

Which of the following are true ?

I.) Paging could result in internal fragmentation

II.) Segmentation could result in external fragmentation

III.) Page size is determined by H/W while segment size is given by user

Which of the following is true ?

I.) There is no context switching in threads

II.) Threads share memory

III.) Thread is also called light weight process

Which of the following can be done to reduce thrashing ?

Which among the following holds the base address of a process in MM ?

Logical address is generated by:-