Scribd
Upload
8 views2 pages

Lecture 10

Uploaded by

baglannurkasym6
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
8 views2 pages

Lecture 10

Uploaded by

baglannurkasym6
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

1. What is the main function of a scheduler in an operating system?

A) Memory allocation
B) Process management
C) Disk management
2. In a multiprogramming environment, what complicates the scheduling algorithm?
A) Single user mode
B) Multiple users waiting for service
C) Simplified user requests
3. What does a good scheduler improve in a system with multiple users?
A) Hardware efficiency
B) User satisfaction
C) Security measures
4. On personal computers, why is the CPU rarely a scarce resource nowadays?
A) High system demands
B) Faster processing power
C) Limited user input
5. What type of processes are known as compute-bound?
A) Processes that perform minimal computing
B) Processes that spend most of their time waiting for I/O
C) Processes that have long CPU bursts
6. What is typically the focus of scheduling in networked servers?
A) Disk management
B) Efficient CPU use
C) User interface responsiveness
7. What happens during a process switch?
A) Memory is freed up
B) The state of the current process is saved
C) The network is reset
8. When is a key scheduling decision made in the lifecycle of a process?
A) Upon creation of a new process
B) When the process is in execution
C) At the end of the process's lifecycle
9. What might cause a process to block, necessitating a scheduling decision?
A) High CPU usage
B) I/O operations or semaphore operations
C) User input
10. How does a preemptive scheduling algorithm work?
A) It allows a process to run indefinitely
B) It limits the process run time
C) It increases the process priority
11. What is true about nonpreemptive scheduling algorithms?
A) They allow processes to run until they block
B) They are mostly used in real-time systems
C) They require constant user intervention
12. Which environment uses nonpreemptive algorithms or preemptive algorithms with long
periods?
A) Real-time systems
B) Interactive systems
C) Batch systems
13. Why is preemption essential in interactive systems?
A) To manage memory better
B) To prevent one process from dominating the CPU
C) To speed up processing time
14. In real-time systems, why is preemption sometimes unnecessary?
A) Processes are designed to run indefinitely
B) Processes usually complete tasks quickly and block
C) The systems do not require high CPU usage
15. What role does the hardware clock play in scheduling?
A) It provides periodic interrupts to facilitate scheduling decisions
B) It manages memory allocation for processes
C) It enhances the security of the operating system
16. How does the scheduler respond to an I/O interrupt?
A) It halts all process activities
B) It decides which process to run next
C) It decreases the priority of all processes
17. What does an effective scheduler manage in a multiprogrammed system?
A) Only the disk operations
B) The order of process execution
C) The graphical user interface
18. How are compute-bound and I/O-bound processes different?
A) By their memory usage
B) By the duration of their CPU bursts
C) By the number of users they support
19. Which scheduling decision is necessary when a process exits?
A) Choosing which process to run next
B) Saving the state of the exiting process
C) Resetting the user interface
20. Why might a preemptive scheduling algorithm suspend a running process?
A) If it requires more memory
B) At the end of a fixed time interval
C) When the process completes its task

1. B, 2. B, 3. B, 4. B, 5. C, 6. B, 7. B, 8. A, 9. B, 10. B, 11. A, 12. C, 13. B, 14. B, 15. A, 16. B, 17. B, 18.


B, 19. A, 20. B

You might also like