OPERATING SYSTEM
1. Disk scheduling involved deciding the order in which disk access requests must be serviced.
2. Kernal is the set of primitive functions upon which the rest of operating system functions are built up.
3. Dirty bit is used to show the page that is modified after being loaded into cache memory.
4. Fence register is used for Memory protection.
5. Which of the service is not supported by the operating system- Compilation.
6. The first-fit, best-fit and the worst fit algorithm can be used for - Contiguous allocation of memory.
7. Which of the following are single-user Operating system- XENIX, MS-DOS.
8. In Round Robin CPU scheduling, as the time quantum is increased the average turn around time - varies irregularly.
9.The size of the virtual memory depends on - the size of the address bus.
10. For implementing a multiprogramming Operating system- Special support from processor is not essential.
11. To obtain better memory utilization, dynamic loading is used. With dynamic loading, a routine is not
loaded until it is called for. For implementing dynamic loading, User program can implement dynamic loading
without any special support from the operating system or the hardware.
12. When overlys are used, the size of a process is not limited to the size of physical memory.
13. In a partitioned memory allocation scheme, the superiority of the first fit and the best fit algorithms depend on the
sequence of memory requests.
14. Cascading termination refers to termination of all child processes before the parent terminates normally or abnormally.
1. Disk scheduling involved deciding the order in which disk access requests must be serviced.
2. Kernal is the set of primitive functions upon which the rest of operating system functions are built up.
3. Dirty bit is used to show the page that is modified after being loaded into cache memory.
4. Fence register is used for Memory protection.
5. Which of the service is not supported by the operating system- Compilation.
6. The first-fit, best-fit and the worst fit algorithm can be used for - Contiguous allocation of memory.
7. Which of the following are single-user Operating system- XENIX, MS-DOS.
8. In Round Robin CPU scheduling, as the time quantum is increased the average turn around time - varies irregularly.
9.The size of the virtual memory depends on - the size of the address bus.
10. For implementing a multiprogramming Operating system- Special support from processor is not essential.
11. To obtain better memory utilization, dynamic loading is used. With dynamic loading, a routine is not
loaded until it is called for. For implementing dynamic loading, User program can implement dynamic loading
without any special support from the operating system or the hardware.
12. When overlys are used, the size of a process is not limited to the size of physical memory.
13. In a partitioned memory allocation scheme, the superiority of the first fit and the best fit algorithms depend on the
sequence of memory requests.
14. Cascading termination refers to termination of all child processes before the parent terminates normally or abnormally.
No comments:
Post a Comment