Operating System Bits
1. Memory protection is normally done by the processor and the associated hardware.
2. Which of the following scheduling algorithms gives minimum average waiting time SJF
Shortest job first.
3. In a paged scheme of memory management, the segment table itself must have a page table because each segment
is spread over a number of pages.
4. Which of the following page replacement algorithm suffers from Belady's anomaly FIFO- FIRST IN FIRST OUT.
5. A memory page containing a heavily used variable that was initialized very early and is in constant use is removed
when the page replacement algorithm used is FIFO.
6. Which of the following scheduling policy is well suited for a time shared operating system-Round Robin.
7. Virtual Memory is an illusion of an extremely large memory.
8. Spatial locality is referred as a nearby location will be referenced soon.
9. Which of the following is an example of SPOOLED device- A line printer used to print the output of a number of jobs.
10.Page fault occurs when the page is not in main memory.
11. Overly is a single contegious memory that is used in olden days for running large programs by swapping.
12.Concurrent processes are processes that are overlap in time.
13. The page replacement policy that sometimes lead to more page faults when the size of the memory is increased is FIFO.
14. The only state transition that is initiated by the user process itself is Block
15. Fragmentation is fragments of memory words unused in a page.
16. Which of the following are real time systems
a process control system
aircraft control system
17. Dijkstra's banking algorithm in an operating system solves the problem of Deadlock avoidance.
18. In a paged memory systems if page size increased, then the internal fragmentation is generally becomes more.
19. Critical region is the software which monitors the operating system.
20. Necessary condition for deadlocks are
Non-preemption and Circular wait.
Mutual Exclusion and partial allocation.
21. In a time sharing operating system, when a time slot is given to a process is completed the process goes from
the RUNNING state to READY state.
22. Supervisor calls are privileged calls that are used to perform resource management functions, which are controlled
by the operating system.
23. Semaphores are used to solve the problem of Process synchronization and Mutual exclusion.
24. Preemptive scheduling algorithm is the strategy of temporarily suspending a running process before the CPU time slice expires.
25.Mutual exclusion problem occurs between Processes that share resources.
1. Memory protection is normally done by the processor and the associated hardware.
2. Which of the following scheduling algorithms gives minimum average waiting time SJF
Shortest job first.
3. In a paged scheme of memory management, the segment table itself must have a page table because each segment
is spread over a number of pages.
4. Which of the following page replacement algorithm suffers from Belady's anomaly FIFO- FIRST IN FIRST OUT.
5. A memory page containing a heavily used variable that was initialized very early and is in constant use is removed
when the page replacement algorithm used is FIFO.
6. Which of the following scheduling policy is well suited for a time shared operating system-Round Robin.
7. Virtual Memory is an illusion of an extremely large memory.
8. Spatial locality is referred as a nearby location will be referenced soon.
9. Which of the following is an example of SPOOLED device- A line printer used to print the output of a number of jobs.
10.Page fault occurs when the page is not in main memory.
11. Overly is a single contegious memory that is used in olden days for running large programs by swapping.
12.Concurrent processes are processes that are overlap in time.
13. The page replacement policy that sometimes lead to more page faults when the size of the memory is increased is FIFO.
14. The only state transition that is initiated by the user process itself is Block
15. Fragmentation is fragments of memory words unused in a page.
16. Which of the following are real time systems
a process control system
aircraft control system
17. Dijkstra's banking algorithm in an operating system solves the problem of Deadlock avoidance.
18. In a paged memory systems if page size increased, then the internal fragmentation is generally becomes more.
19. Critical region is the software which monitors the operating system.
20. Necessary condition for deadlocks are
Non-preemption and Circular wait.
Mutual Exclusion and partial allocation.
21. In a time sharing operating system, when a time slot is given to a process is completed the process goes from
the RUNNING state to READY state.
22. Supervisor calls are privileged calls that are used to perform resource management functions, which are controlled
by the operating system.
23. Semaphores are used to solve the problem of Process synchronization and Mutual exclusion.
24. Preemptive scheduling algorithm is the strategy of temporarily suspending a running process before the CPU time slice expires.
25.Mutual exclusion problem occurs between Processes that share resources.
No comments:
Post a Comment