Pure demand paging
Explain the term pure demand paging?
Expert
In start of execution of a process having no pages within the memory, operating system sets the instruction pointer at the first instruction of the process, which is on a non-memory resident page; process instantly faults for the required page. After this page is brought within the memory, process continues its execution, faulting as essential until each page which it requires is in the memory. At that particular point, it may execute having no more page faults. This schema is full demand paging.
What are the objectives of Operating System?
What is meant by thrashing?
what are the two procedures used in a recovery algorithm?
Explain the following algorithm: a) First Come, First Served Scheduling. b) Shortest Job First Scheduling. c) Priority Scheduling.
Explain what is effective access time?
Explain the fragmentation?
What do you mean by cycle stealing? Describe in brief.
List some of the algorithms that are available for the Deadlock avoidance.
Discuss the Round-Robin Scheduling.
Explain the critical section problem?
18,76,764
1950512 Asked
3,689
Active Tutors
1452916
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!