Sample Questions Best site for GRE, LSAT, SAT, GMAT, TOEFL, CCNA, CCSA and interview sample questions  

Technical Sample Questions : C |  C++ |  Oracle |  Java | Unix |  Operating Systems |  Data Structure

Sample Technical Questions

Unix Sample Questions

Questions on memory management in uinx

  1. How the Swapper works?

    Answer:

    The swapper is the only process that swaps the processes. The Swapper operates only in the Kernel mode and it does not uses System calls instead it uses internal Kernel functions for swapping. It is the archetype of all kernel process.

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

    Answer:

    Zombie process: They do not take any up physical memory.
    Processes locked in memories that are updating the region of the process. 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.
  3. What are the requirements for a swapper to work?

    Answer:

    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.
  4. What are the criteria for choosing a process for swapping into memory from the swap device?

    Answer:

    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.
  5. What are the criteria for choosing a process for swapping out of the memory to the swap device?

    Answer:

    The process's memory resident time,
    Priority of the process and
    The nice value.
  6. What do you mean by nice value?

    Answer:

    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.
  7. What are conditions on which deadlock can occur while swapping the processes?

    Answer:

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

« Previous || Next »

Unix Sample Question Number : 1-5 | 6-11 | 12-16 | 17-23 | 24-29 | 30-36 | 37-41 | 42-48 | 49-55 | 56-61 | 62-67 | 68-73
Sample Test Questions
GRE Sample Questions
CAT Sample Questions
GMAT Sample Questions
TOEFL Sample Questions
ACT Sample Questions
SAT Sample Questions
LSAT Sample Questions
PSAT Sample Questions
MCAT Sample Questions
PMP Sample Questions
GED Sample Questions
ECDL Sample Questions
DMV Sample Questions
CCNA Sample Questions
MCSE Sample Questions
Network+ Sample Questions
A+ Sample Questions
Technical Sample Questions
WASL Sample Questions
CISA Sample Questions

Other Sample Questions
Sample Interview Questions
Sample Teacher Interview Questions
Sample Citizenship Questions
Accuplacer Sample Questions
Science Bowl sample Questions
Driving Test Sample Questions
Sample Survey Questions Sample Essay Questions
Sample Behavioral Interview Questions

Copyright © 2004-2013, Best BSQ. All Rights Reserved.