Unix Memory Management (Part- 2), UNIX Interview Questions Quant Notes | EduRev

Placement Papers - Technical & HR Questions

Created by: Prateek Kaushik

Quant : Unix Memory Management (Part- 2), UNIX Interview Questions Quant Notes | EduRev

The document Unix Memory Management (Part- 2), UNIX Interview Questions Quant Notes | EduRev is a part of the Quant Course Placement Papers - Technical & HR Questions.
All you need of Quant at this link: Quant

14.  What are the processes that are not bothered by the swapper? Give Reason.

  1. Zombie process: They do not take any up physical memory.
  2. Processes locked in memories that are updating the region of the process.
  3. Kernel swaps only the sleeping processes rather than the 'ready-to-run' processes, as they have the higher probability of being scheduled than the Sleeping processes.

15. What are the requirements for a swapper to work?

The swapper works on the highest scheduling priority. Firstly it will look for any sleeping process, if not found then it will look for the ready-to-run process for swapping. But the major requirement for the swapper to work the ready-to-run process must be core-resident for at least 2 seconds before swapping out. And for swapping in the process must have been resided in the swap device for at least 2 seconds. If the requirement is not satisfied then the swapper will go into the wait state on that event and it is awaken once in a second by the Kernel.

16. What are the criteria for choosing a process for swapping into memory from the swap device?

The resident time of the processes in the swap device, the priority of the processes and the amount of time the processes had been swapped out.

17. What are the criteria for choosing a process for swapping out of the memory to the swap device?

  1. The process's memory resident time,
  2. Priority of the process and
  3. The nice value.

18. What do you mean by nice value?

Nice value is the value that controls {increments or decrements} the priority of the process. This value that is returned by the nice() system call. The equation for using nice value is:
Priority = ("recent CPU usage"/constant) + (base- priority) + (nice value)
Only the administrator can supply the nice value. The nice() system call works for the running process only. Nice value of one process cannot affect the nice value of the other process.

19. What are conditions on which deadlock can occur while swapping the processes?

  1. All processes in the main memory are asleep.
  2. All "ready-to-run" processes are swapped out.
  3. There is no space in the swap device for the new incoming process that are swapped out of the main memory.
  4. There is no space in the main memory for the new incoming process.

20. What are conditions for a machine to support Demand Paging?

  1. Memory architecture must based on Pages,
  2. The machine must support the 'restartable' instructions.

21. What is "the principle of locality"?

It's the nature of the processes that they refer only to the small subset of the total data space of the process. i.e. the process frequently calls the same subroutines or executes the loop instructions.

22. What is the working set of a process?

The set of pages that are referred by the process in the last "n", references, where "n" is called the window of the working set of the process.

23. What is the window of the working set of a process?

The window of the working set of a process is the total number in which the process had referred the set of pages in the working set of the process.

24. What is called a page fault?

Page fault is referred to the situation when the process addresses a page in the working set of the process but the process fails to locate the page in the working set. And on a page fault the kernel updates the working set by reading the page from the secondary device.

25. What are data structures that are used for Demand Paging?

Kernel contains 4 data structures for Demand paging. They are,

  1. Page table entries,
  2. Disk block descriptors,
  3. Page frame data table (pfdata),
  4. Swap-use table.

26. What are the bits that support the demand paging?

Valid, Reference, Modify, Copy on write, Age. These bits are the part of the page table entry, which includes physical address of the page and protection bits.

27. How the Kernel handles the fork() system call in traditional Unix and in the System V Unix, while swapping?

Kernel in traditional Unix, makes the duplicate copy of the parent's address space and attaches it to the child's process, while swapping. Kernel in System V Unix, manipulates the region tables, page table, and pfdata table entries, by incrementing the reference count of the region table of shared regions.

Offer running on EduRev: Apply code STAYHOME200 to get INR 200 off on our premium plan EduRev Infinity!

Dynamic Test

Content Category

Related Searches

ppt

,

Exam

,

Unix Memory Management (Part- 2)

,

Previous Year Questions with Solutions

,

past year papers

,

UNIX Interview Questions Quant Notes | EduRev

,

study material

,

Viva Questions

,

pdf

,

UNIX Interview Questions Quant Notes | EduRev

,

Unix Memory Management (Part- 2)

,

Objective type Questions

,

Unix Memory Management (Part- 2)

,

Summary

,

Semester Notes

,

video lectures

,

mock tests for examination

,

MCQs

,

Sample Paper

,

Extra Questions

,

practice quizzes

,

UNIX Interview Questions Quant Notes | EduRev

,

Free

,

Important questions

,

shortcuts and tricks

;