πŸŽ“ BookMCQ
← Back to 6. CPU Scheduling

πŸ“ Solaris Scheduling (76 MCQs)

πŸ“– From Operating System β€’ 6. CPU Scheduling β€’ 76 questions available

What is Solaris Scheduling?

Definition:
Solaris employs a multilevel feedback queue with configurable classes (TS, IA, FX, RT), where time-sharing (TS) threads adjust priority based on recent CPU usage and sleep time via decay function pnew=f(pold,cpu_usage)p_{new} = f(p_{old}, cpu\_usage).

Example:
An interactive shell thread sleeping frequently retains high TS priority, while a CPU-bound compiler thread gradually demotes to lower priority unless boosted by admin-set limits.

Reason:
Solaris's class-based architecture supports diverse workload coexistence with fine-grained administrative control, enabling enterprise environments to mix real-time, interactive, and batch processing predictably.

18
Easy
43
Medium
15
Hard

πŸ“ All Solaris Scheduling MCQs

Q1. How many scheduling classes does Solaris use for thread scheduling?

A.4
B.5
C.6 βœ…
D.7
πŸ’‘ Difficulty: easy | βœ… Correct: C

πŸ“– Explanation: Solaris uses six scheduling classes: Time Sharing (TS), Interactive (IA), Real Time (RT), System (SYS), Fair Share (FSS), and Fixed Priority (FP). Each class has different priorities and scheduling algorithms.

Q2. What is the default scheduling class for a process in Solaris?

A.Interactive (IA)
B.Real Time (RT)
C.Time Sharing (TS) βœ…
D.Fair Share (FSS)
πŸ’‘ Difficulty: easy | βœ… Correct: C

πŸ“– Explanation: The default scheduling class for a process in Solaris is Time Sharing (TS). This class uses a multilevel feedback queue to dynamically alter priorities and assign time slices of different lengths.

Q3. Which Solaris scheduling class uses the same scheduling policy as the time-sharing class but gives windowing applications higher priority?

A.Real Time (RT)
B.Interactive (IA) βœ…
C.Fixed Priority (FP)
D.System (SYS)
πŸ’‘ Difficulty: easy | βœ… Correct: B

πŸ“– Explanation: The Interactive (IA) class uses the same scheduling policy as the time-sharing class but gives windowing applicationsβ€”such as those created by KDE or GNOMEβ€”a higher priority for better performance.

Q4. Which Solaris scheduling class is reserved for kernel threads such as the scheduler and paging daemon?

A.Time Sharing (TS)
B.Real Time (RT)
C.System (SYS) βœ…
D.Fixed Priority (FP)
πŸ’‘ Difficulty: easy | βœ… Correct: C

πŸ“– Explanation: The System (SYS) class is reserved for kernel use, including kernel threads like the scheduler and paging daemon. Once the priority of a system thread is established, it does not change.

Q5. Which Solaris scheduling class uses CPU shares instead of priorities for making scheduling decisions?

A.Time Sharing (TS)
B.Interactive (IA)
C.Real Time (RT)
D.Fair Share (FSS) βœ…
πŸ’‘ Difficulty: easy | βœ… Correct: D

πŸ“– Explanation: The Fair Share (FSS) scheduling class uses CPU shares instead of priorities to make scheduling decisions. CPU shares indicate entitlement to available CPU resources and are allocated to a set of processes known as a project.

Q6. Which Solaris scheduling class has the same priority range as the time-sharing class but does not dynamically adjust priorities?

A.Interactive (IA)
B.Fixed Priority (FP) βœ…
C.System (SYS)
D.Fair Share (FSS)
πŸ’‘ Difficulty: easy | βœ… Correct: B

πŸ“– Explanation: The Fixed Priority (FP) class, introduced with Solaris 9, has the same priority range as the time-sharing class. However, priorities in this class are not dynamically adjusted, unlike the time-sharing class where priorities change based on behavior.

Q7. What type of scheduling policy does the time-sharing class in Solaris use?

A.First-come, first-served
B.Round-robin
C.Multilevel feedback queue βœ…
D.Priority inheritance
πŸ’‘ Difficulty: easy | βœ… Correct: C

πŸ“– Explanation: The time-sharing class in Solaris uses a multilevel feedback queue scheduling policy. This policy dynamically alters priorities and assigns time slices of different lengths based on thread behavior and priority levels.

Q8. What is the relationship between priority and time quantum in the Solaris time-sharing class?

A.Higher priority = larger time quantum
B.Higher priority = smaller time quantum βœ…
C.Priority and time quantum are unrelated
D.Priority determines the time quantum randomly
πŸ’‘ Difficulty: medium | βœ… Correct: B

πŸ“– Explanation: In the Solaris time-sharing class, there is an inverse relationship between priorities and time slices. The higher the priority, the smaller the time slice; and the lower the priority, the larger the time slice.

Q9. How many priority levels do the time-sharing and interactive classes in Solaris include?

A.32
B.40
C.60 βœ…
D.100
πŸ’‘ Difficulty: medium | βœ… Correct: C

πŸ“– Explanation: The time-sharing and interactive scheduling classes in Solaris include 60 priority levels. The dispatch table for these classes covers priorities from 0 to 59, with higher numbers indicating higher priority.

Q10. What is the time quantum for priority 0 in the Solaris time-sharing dispatch table?

A.20 milliseconds
B.40 milliseconds
C.160 milliseconds
D.200 milliseconds βœ…
πŸ’‘ Difficulty: medium | βœ… Correct: D

πŸ“– Explanation: In the Solaris dispatch table, priority 0 (the lowest priority) has a time quantum of 200 milliseconds. This reflects the inverse relationship between priority and time quantum, where lower priorities receive larger time slices.

Q11. What is the time quantum for priority 59 in the Solaris time-sharing dispatch table?

A.200 milliseconds
B.20 milliseconds βœ…
C.40 milliseconds
D.80 milliseconds
πŸ’‘ Difficulty: medium | βœ… Correct: B

πŸ“– Explanation: In the Solaris dispatch table, priority 59 (the highest priority in the time-sharing class) has a time quantum of 20 milliseconds. This is the smallest time quantum, reflecting the inverse relationship between priority and time quantum.

Q12. What happens to a thread's priority in Solaris when it uses its entire time quantum without blocking?

A.Its priority is increased
B.Its priority remains the same
C.Its priority is lowered βœ…
D.Its priority is reset to base
πŸ’‘ Difficulty: medium | βœ… Correct: C

πŸ“– Explanation: When a thread uses its entire time quantum without blocking (considered CPU-intensive), its priority is lowered. This is reflected in the 'time quantum expired' column of the dispatch table, which shows the new priority after using the full quantum.

Q13. What happens to a thread's priority in Solaris when it returns from sleeping (e.g., after waiting for I/O)?

A.Its priority is lowered
B.Its priority remains the same
C.Its priority is boosted βœ…
D.Its priority is reset to base
πŸ’‘ Difficulty: medium | βœ… Correct: C

πŸ“– Explanation: When a thread returns from sleeping (such as after waiting for I/O), its priority is boosted. The dispatch table shows that returning threads have their priorities boosted to between 50 and 59, supporting good response time for interactive processes.

Q14. Which Solaris scheduling class has the highest priority?

A.Time Sharing (TS)
B.Interactive (IA)
C.System (SYS)
D.Real Time (RT) βœ…
πŸ’‘ Difficulty: easy | βœ… Correct: D

πŸ“– Explanation: Threads in the Real Time (RT) class are given the highest priority. A real-time process will run before a process in any other class, allowing it to have a guaranteed response within a bounded period of time.

Q15. How many interrupt threads does the Solaris kernel maintain for servicing interrupts?

A.4
B.8
C.10 βœ…
D.16
πŸ’‘ Difficulty: medium | βœ… Correct: C

πŸ“– Explanation: The Solaris kernel maintains 10 threads for servicing interrupts. These threads do not belong to any scheduling class and execute at the highest priority (160–169), ensuring immediate response to hardware interrupts.

Q16. What is the priority range for interrupt threads in Solaris?

A.0-59
B.60-99
C.100-159
D.160-169 βœ…
πŸ’‘ Difficulty: medium | βœ… Correct: D

πŸ“– Explanation: Interrupt threads in Solaris execute at the highest priority, ranging from 160 to 169. These threads do not belong to any scheduling class and have the highest priority in the system to ensure timely interrupt handling.

Q17. What scheduling algorithm does Solaris use when multiple threads have the same priority?

A.First-come, first-served
B.Round-robin βœ…
C.Priority inheritance
D.Multilevel feedback
πŸ’‘ Difficulty: medium | βœ… Correct: B

πŸ“– Explanation: When there are multiple threads with the same priority, the Solaris scheduler uses a round-robin queue. This ensures fairness among threads at the same priority level by giving each one a chance to run.

Q18. What is the priority range for the time-sharing and interactive classes in Solaris?

A.0-59 βœ…
B.60-99
C.100-159
D.160-169
πŸ’‘ Difficulty: medium | βœ… Correct: A

πŸ“– Explanation: The time-sharing and interactive classes in Solaris include 60 priority levels, ranging from 0 to 59. Higher numbers indicate higher priority within these classes, with priority 59 being the highest in these classes.

Q19. What is the global priority range for all Solaris scheduling classes combined?

A.0-59
B.0-99
C.0-139
D.0-169 βœ…
πŸ’‘ Difficulty: hard | βœ… Correct: D

πŸ“– Explanation: The global priority range in Solaris spans from 0 to 169. This includes all scheduling classes and interrupt threads. The scheduler converts class-specific priorities into global priorities and selects the thread with the highest global priority to run.

Q20. What happens to a thread selected by the Solaris scheduler?

A.It runs until it blocks, uses its time slice, or is preempted βœ…
B.It runs to completion without interruption
C.It runs for a fixed time quantum and then stops
D.It runs only when no other threads are ready
πŸ’‘ Difficulty: medium | βœ… Correct: A

πŸ“– Explanation: A selected thread runs on the CPU until it blocks (e.g., for I/O), uses its time slice, or is preempted by a higher-priority thread. This ensures that threads don't monopolize the CPU while still allowing preemption for higher-priority tasks.

Q21. Which two scheduling classes were introduced with Solaris 9?

A.Time Sharing and Interactive
B.Real Time and System
C.Fair Share and Fixed Priority βœ…
D.Interactive and Fair Share
πŸ’‘ Difficulty: hard | βœ… Correct: C

πŸ“– Explanation: The Fair Share (FSS) and Fixed Priority (FP) scheduling classes were introduced with Solaris 9. These classes provided additional scheduling options beyond the existing TS, IA, RT, and SYS classes.

Q22. What is a 'project' in the context of Solaris fair-share scheduling?

A.A set of processes that are allocated CPU shares βœ…
B.A group of threads with the same priority
C.A collection of scheduling classes
D.A set of interrupt handlers
πŸ’‘ Difficulty: hard | βœ… Correct: A

πŸ“– Explanation: In the fair-share scheduling class, CPU shares are allocated to a set of processes known as a project. This allows CPU resources to be divided among projects, ensuring that each project receives its entitled share of CPU time.

Q23. What is the priority of a thread that has just returned from sleeping in Solaris?

A.It is lowered to between 0-10
B.It is boosted to between 50-59 βœ…
C.It remains at its previous priority
D.It is reset to the base priority
πŸ’‘ Difficulty: medium | βœ… Correct: B

πŸ“– Explanation: When a thread returns from sleeping, its priority is boosted to between 50 and 59, according to the dispatch table. This high priority boost ensures that I/O-bound and interactive threads get quick CPU access when the I/O they were waiting for becomes available.

Q24. What is the priority of a CPU-intensive thread that has used its entire time quantum without blocking?

A.It is increased
B.It is lowered βœ…
C.It remains the same
D.It is boosted to maximum
πŸ’‘ Difficulty: medium | βœ… Correct: B

πŸ“– Explanation: A CPU-intensive thread that uses its entire time quantum without blocking has its priority lowered. This prevents compute-bound threads from monopolizing the CPU and allows other threads to get CPU time.

Q25. What is the lowest priority in the Solaris time-sharing dispatch table?

A.0 βœ…
B.20
C.40
D.59
πŸ’‘ Difficulty: medium | βœ… Correct: A

πŸ“– Explanation: The lowest priority in the Solaris time-sharing dispatch table is 0. This priority has the largest time quantum (200 milliseconds) and is used for the lowest-priority threads in the time-sharing class.

Q26. What is the highest priority in the Solaris time-sharing dispatch table?

A.0
B.20
C.40
D.59 βœ…
πŸ’‘ Difficulty: medium | βœ… Correct: D

πŸ“– Explanation: The highest priority in the Solaris time-sharing dispatch table is 59. This priority has the smallest time quantum (20 milliseconds) and is used for the highest-priority threads in the time-sharing class.

Q27. What is the priority of a thread that returns from sleeping in Solaris?

A.It is set to the base priority of its class
B.It is boosted to between 50 and 59 βœ…
C.It is lowered to the lowest priority
D.It is set to the priority it had before sleeping
πŸ’‘ Difficulty: medium | βœ… Correct: B

πŸ“– Explanation: According to the dispatch table, a thread returning from sleep (such as from waiting for I/O) has its priority boosted to between 50 and 59. This high priority ensures that interactive and I/O-bound threads receive excellent response times.

Q28. What is the purpose of the dynamic priority adjustment in the time-sharing class?

A.To give all threads equal CPU time
B.To provide good response time for interactive processes and good throughput for CPU-bound processes βœ…
C.To ensure real-time threads always run first
D.To simplify the scheduling algorithm
πŸ’‘ Difficulty: hard | βœ… Correct: B

πŸ“– Explanation: The dynamic priority adjustment in the time-sharing class provides good response time for interactive processes (which typically have higher priority) and good throughput for CPU-bound processes (which typically have lower priority). This balances responsiveness with overall system efficiency.

Q29. Which Solaris scheduling class gives windowing applications a higher priority for better performance?

A.Time Sharing (TS)
B.Interactive (IA) βœ…
C.Real Time (RT)
D.Fixed Priority (FP)
πŸ’‘ Difficulty: easy | βœ… Correct: B

πŸ“– Explanation: The Interactive (IA) class gives windowing applicationsβ€”such as those created by the KDE or GNOME window managersβ€”a higher priority for better performance. This ensures that the user interface remains responsive.

Q30. What is the global priority of interrupt threads in Solaris?

A.0-59
B.60-99
C.100-159
D.160-169 βœ…
πŸ’‘ Difficulty: medium | βœ… Correct: D

πŸ“– Explanation: Interrupt threads in Solaris execute at priorities 160-169, which are the highest in the system. This ensures that hardware interrupts are handled immediately, without being delayed by other threads.

Q31. How does the Solaris scheduler select which thread to run next?

A.It uses a round-robin algorithm
B.It selects the thread with the highest global priority βœ…
C.It selects the thread that has been waiting the longest
D.It uses a first-come, first-served algorithm
πŸ’‘ Difficulty: medium | βœ… Correct: B

πŸ“– Explanation: The Solaris scheduler converts class-specific priorities into global priorities and selects the thread with the highest global priority to run. This ensures that the most important thread always gets CPU time.

Q32. What is the relationship between time quantum and priority in the Solaris time-sharing class?

A.Direct relationship (higher priority = larger quantum)
B.Inverse relationship (higher priority = smaller quantum) βœ…
C.No relationship
D.Quantum is fixed for all priorities
πŸ’‘ Difficulty: easy | βœ… Correct: B

πŸ“– Explanation: In the Solaris time-sharing class, there is an inverse relationship between priority and time quantum. Higher-priority threads get smaller time slices, while lower-priority threads get larger time slices, as shown in the dispatch table.

Q33. Which Solaris scheduling class is not dynamically adjusted?

A.Time Sharing (TS)
B.Interactive (IA)
C.System (SYS) βœ…
D.Fair Share (FSS)
πŸ’‘ Difficulty: medium | βœ… Correct: C

πŸ“– Explanation: In the System (SYS) class, once the priority of a system thread is established, it does not change. This is different from the time-sharing and interactive classes, where priorities are dynamically adjusted.

Q34. What is the purpose of the 'time quantum expired' field in the Solaris dispatch table?

A.To show the time quantum for each priority
B.To show the new priority of a thread that has used its entire time quantum βœ…
C.To show the priority of a thread returning from sleep
D.To show the base priority for each class
πŸ’‘ Difficulty: medium | βœ… Correct: B

πŸ“– Explanation: The 'time quantum expired' field in the Solaris dispatch table shows the new priority of a thread that has used its entire time quantum without blocking. These threads are considered CPU-intensive and have their priorities lowered.

Q35. What is the purpose of the 'return from sleep' field in the Solaris dispatch table?

A.To show the time quantum for each priority
B.To show the new priority of a thread that has used its entire time quantum
C.To show the priority of a thread returning from sleeping βœ…
D.To show the base priority for each class
πŸ’‘ Difficulty: medium | βœ… Correct: C

πŸ“– Explanation: The 'return from sleep' field in the Solaris dispatch table shows the priority of a thread that is returning from sleeping (such as after waiting for I/O). These threads have their priorities boosted to between 50 and 59.

Q36. What is the priority range for Solaris interrupt threads?

A.0-59
B.60-99
C.100-159
D.160-169 βœ…
πŸ’‘ Difficulty: easy | βœ… Correct: D

πŸ“– Explanation: Solaris interrupt threads execute at the highest priority range of 160-169. These threads do not belong to any scheduling class and are dedicated to servicing hardware interrupts.

Q37. What is the main benefit of the fair-share scheduling class in Solaris?

A.It gives higher priority to real-time threads
B.It allows CPU resources to be allocated to projects βœ…
C.It provides the highest priority for interrupt handling
D.It simplifies the scheduling algorithm
πŸ’‘ Difficulty: hard | βœ… Correct: B

πŸ“– Explanation: The fair-share scheduling class uses CPU shares instead of priorities to make scheduling decisions. CPU shares are allocated to a set of processes (known as a project), allowing CPU resources to be divided among projects according to their entitlement.

Q38. Which Solaris scheduling class is reserved exclusively for kernel use?

A.Time Sharing (TS)
B.Interactive (IA)
C.System (SYS) βœ…
D.Real Time (RT)
πŸ’‘ Difficulty: easy | βœ… Correct: C

πŸ“– Explanation: The System (SYS) class is reserved exclusively for kernel use. Kernel threads such as the scheduler and paging daemon run in this class. User processes running in kernel mode are not in the system class.

Q39. What is the effect of boosting a thread's priority when it returns from sleep?

A.It prevents the thread from running
B.It gives the thread better response time βœ…
C.It reduces the thread's CPU time
D.It moves the thread to a lower priority
πŸ’‘ Difficulty: medium | βœ… Correct: B

πŸ“– Explanation: Boosting a thread's priority when it returns from sleep gives the thread better response time. This is particularly important for interactive and I/O-bound threads, which need to respond quickly when the I/O they were waiting for becomes available.

Q40. What is the priority range for the fair-share class in Solaris?

A.0-59 βœ…
B.60-99
C.100-139
D.140-169
πŸ’‘ Difficulty: medium | βœ… Correct: A

πŸ“– Explanation: The fair-share class (FSS) has the same priority range as the time-sharing class (0-59). However, unlike time-sharing, fair-share uses CPU shares instead of priorities to make scheduling decisions.

Q41. What is the priority range for the fixed-priority class in Solaris?

A.0-59 βœ…
B.60-99
C.100-139
D.140-169
πŸ’‘ Difficulty: medium | βœ… Correct: A

πŸ“– Explanation: The fixed-priority class (FP) has the same priority range as the time-sharing class (0-59). However, priorities in the fixed-priority class are not dynamically adjusted, unlike in the time-sharing class.

Q42. What is the priority range for the real-time class in Solaris?

A.0-59
B.60-99 βœ…
C.100-139
D.140-169
πŸ’‘ Difficulty: medium | βœ… Correct: B

πŸ“– Explanation: The real-time class (RT) in Solaris has priorities in the range of 60-99. These priorities are higher than the time-sharing and interactive classes (0-59), ensuring that real-time threads run before other threads.

Q43. How does Solaris handle threads with the same priority?

A.It uses a first-come, first-served algorithm
B.It uses a round-robin queue βœ…
C.It uses a priority inheritance algorithm
D.It uses a random selection algorithm
πŸ’‘ Difficulty: easy | βœ… Correct: B

πŸ“– Explanation: When multiple threads have the same priority, the Solaris scheduler uses a round-robin queue. This ensures fairness by giving each thread at the same priority level a chance to run in a cyclic order.

Q44. What is the main purpose of the Solaris scheduling classes?

A.To make scheduling simpler
B.To provide different scheduling policies for different types of threads βœ…
C.To ensure all threads get equal CPU time
D.To eliminate the need for priorities
πŸ’‘ Difficulty: hard | βœ… Correct: B

πŸ“– Explanation: Solaris uses scheduling classes to provide different scheduling policies for different types of threads. Each class has its own priorities and scheduling algorithms, allowing the system to accommodate threads with different requirements (real-time, interactive, background, etc.).

Q45. What happens to a thread that blocks (e.g., for I/O) in Solaris?

A.It is removed from the system
B.It remains running
C.It is placed in a waiting state βœ…
D.It is terminated
πŸ’‘ Difficulty: medium | βœ… Correct: C

πŸ“– Explanation: When a thread blocks (for example, waiting for I/O), it is placed in a waiting state. When the I/O becomes available, the thread returns from sleep and its priority is boosted, giving it high priority to continue execution.

Q46. What is the priority range for the system class in Solaris?

A.0-59
B.60-99
C.100-139 βœ…
D.140-169
πŸ’‘ Difficulty: medium | βœ… Correct: C

πŸ“– Explanation: The system class (SYS) in Solaris has priorities in the range of 100-139. These priorities are higher than the real-time class (60-99), but lower than interrupt threads (160-169). System threads include the scheduler and paging daemon.

Q47. What is the main difference between the time-sharing and fixed-priority classes in Solaris?

A.Time-sharing uses round-robin; fixed-priority uses FIFO
B.Time-sharing adjusts priorities dynamically; fixed-priority does not βœ…
C.Time-sharing has more priority levels
D.Time-sharing is only for kernel threads
πŸ’‘ Difficulty: hard | βœ… Correct: B

πŸ“– Explanation: The main difference is that the time-sharing class dynamically adjusts priorities based on thread behavior, while the fixed-priority class does not. This makes fixed-priority suitable for threads that need predictable priorities without dynamic adjustment.

Q48. What is the main purpose of the 'return from sleep' priority boost in Solaris?

A.To penalize CPU-bound threads
B.To give high priority to threads that have been waiting for I/O βœ…
C.To ensure all threads get equal CPU time
D.To reduce context switching overhead
πŸ’‘ Difficulty: hard | βœ… Correct: B

πŸ“– Explanation: The 'return from sleep' priority boost gives high priority to threads that have been waiting for I/O. This improves response times for interactive and I/O-bound threads by ensuring they get CPU time quickly when the I/O they need becomes available.

Q49. What is the priority of a thread that returns from sleep in the Solaris dispatch table?

A.It is set to the base priority of its class
B.It is boosted to between 50 and 59 βœ…
C.It is lowered to the lowest priority
D.It is set to the priority it had before sleeping
πŸ’‘ Difficulty: medium | βœ… Correct: B

πŸ“– Explanation: According to the Solaris dispatch table, a thread returning from sleep is boosted to a priority between 50 and 59. This high priority ensures that interactive and I/O-bound threads get immediate CPU access when they wake up.

Q50. What is the priority of a CPU-intensive thread after using its full time quantum in Solaris?

A.It is increased
B.It is lowered βœ…
C.It remains the same
D.It is boosted to maximum
πŸ’‘ Difficulty: medium | βœ… Correct: B

πŸ“– Explanation: A CPU-intensive thread that uses its full time quantum without blocking has its priority lowered. This prevents such threads from monopolizing the CPU and ensures fair CPU allocation among threads.

Q51. What is the maximum priority in the Solaris time-sharing class?

A.0
B.20
C.40
D.59 βœ…
πŸ’‘ Difficulty: medium | βœ… Correct: D

πŸ“– Explanation: The maximum priority in the Solaris time-sharing class is 59. This priority has the smallest time quantum (20 milliseconds) and is used for the highest-priority threads in the time-sharing class.

Q52. What is the minimum priority in the Solaris time-sharing class?

A.0 βœ…
B.20
C.40
D.59
πŸ’‘ Difficulty: medium | βœ… Correct: A

πŸ“– Explanation: The minimum priority in the Solaris time-sharing class is 0. This priority has the largest time quantum (200 milliseconds) and is used for the lowest-priority threads in the time-sharing class.

Q53. What is the main characteristic of the system class in Solaris?

A.Priorities are dynamically adjusted
B.Priorities are fixed once established βœ…
C.Threads in this class have the highest priority
D.Threads in this class use CPU shares
πŸ’‘ Difficulty: medium | βœ… Correct: B

πŸ“– Explanation: The system class (SYS) is characterized by fixed priorities. Once the priority of a system thread is established, it does not change. This class is reserved for kernel threads such as the scheduler and paging daemon.

Q54. What is the priority range for interrupt threads in Solaris?

A.0-59
B.60-99
C.100-159
D.160-169 βœ…
πŸ’‘ Difficulty: easy | βœ… Correct: D

πŸ“– Explanation: Interrupt threads in Solaris have the highest priority in the system, ranging from 160 to 169. These threads do not belong to any scheduling class and are used exclusively for servicing hardware interrupts.

Q55. What is the relationship between a thread's behavior and its priority in the time-sharing class?

A.Priority is fixed and does not change based on behavior
B.Priority is increased for CPU-bound threads and decreased for I/O-bound threads
C.Priority is decreased for CPU-bound threads and increased for I/O-bound threads βœ…
D.Priority changes randomly
πŸ’‘ Difficulty: hard | βœ… Correct: C

πŸ“– Explanation: In the time-sharing class, CPU-bound threads (which use their full time quantum) have their priorities lowered, while I/O-bound threads (which return from sleep) have their priorities boosted. This dynamic adjustment provides good response for interactive threads and throughput for CPU-bound threads.

Q56. What is the main benefit of the dynamic priority adjustment in the time-sharing class?

A.It ensures all threads get equal CPU time
B.It provides good response time for interactive processes and good throughput for CPU-bound processes βœ…
C.It eliminates the need for preemption
D.It simplifies the scheduling algorithm
πŸ’‘ Difficulty: hard | βœ… Correct: B

πŸ“– Explanation: The dynamic priority adjustment provides good response time for interactive processes (which typically have higher priority) and good throughput for CPU-bound processes (which typically have lower priority). This balances responsiveness with overall system efficiency.

Q57. Which Solaris scheduling class is used for kernel threads like the scheduler and paging daemon?

A.Time Sharing (TS)
B.Interactive (IA)
C.System (SYS) βœ…
D.Real Time (RT)
πŸ’‘ Difficulty: easy | βœ… Correct: C

πŸ“– Explanation: The System (SYS) class is used for kernel threads such as the scheduler and paging daemon. This class is reserved for kernel use, and user processes running in kernel mode are not in the system class.

Q58. What is the purpose of the fair-share scheduling class?

A.To give the highest priority to real-time threads
B.To allocate CPU resources based on shares assigned to projects βœ…
C.To provide the same priority range as time-sharing
D.To reserve priorities for kernel use
πŸ’‘ Difficulty: hard | βœ… Correct: B

πŸ“– Explanation: The fair-share scheduling class uses CPU shares instead of priorities to make scheduling decisions. CPU shares indicate entitlement to available CPU resources and are allocated to a set of processes known as a project, allowing fair allocation of CPU time among projects.

Q59. What is the purpose of the fixed-priority class?

A.To provide dynamic priority adjustment
B.To give threads with fixed priorities that do not change βœ…
C.To allocate CPU resources based on shares
D.To reserve priorities for kernel use
πŸ’‘ Difficulty: medium | βœ… Correct: B

πŸ“– Explanation: The fixed-priority class provides threads with fixed priorities that do not change. This is useful for threads that need predictable priorities without the dynamic adjustment that occurs in the time-sharing class.

Q60. What is the effect of lowering a CPU-bound thread's priority?

A.It increases the thread's CPU time
B.It reduces the thread's CPU time βœ…
C.It prevents the thread from running
D.It gives the thread higher priority
πŸ’‘ Difficulty: medium | βœ… Correct: B

πŸ“– Explanation: Lowering a CPU-bound thread's priority reduces the amount of CPU time it receives relative to higher-priority threads. This prevents CPU-bound threads from monopolizing the CPU and allows interactive and I/O-bound threads to get CPU time.

Q61. What is the effect of boosting an I/O-bound thread's priority?

A.It reduces the thread's CPU time
B.It increases the thread's CPU time βœ…
C.It prevents the thread from running
D.It gives the thread lower priority
πŸ’‘ Difficulty: medium | βœ… Correct: B

πŸ“– Explanation: Boosting an I/O-bound thread's priority increases the amount of CPU time it receives, ensuring that it gets CPU access quickly when the I/O it needs becomes available. This improves system responsiveness.

Q62. What is the priority range for interrupt threads in Solaris?

A.0-59
B.60-99
C.100-139
D.160-169 βœ…
πŸ’‘ Difficulty: easy | βœ… Correct: D

πŸ“– Explanation: Interrupt threads in Solaris execute at the highest priorities in the system, ranging from 160 to 169. This ensures that hardware interrupts are handled with the highest priority, without being delayed by other threads.

Q63. What is the relationship between the Solaris scheduling classes and global priorities?

A.Class-specific priorities are converted to global priorities βœ…
B.Each class uses its own global priority scheme
C.Global priorities are the same as class-specific priorities
D.Global priorities are not used
πŸ’‘ Difficulty: medium | βœ… Correct: A

πŸ“– Explanation: The Solaris scheduler converts class-specific priorities into global priorities. The scheduler then selects the thread with the highest global priority to run. This provides a unified scheduling decision across all classes.

Q64. What is the priority range for the time-sharing class in Solaris?

A.0-59 βœ…
B.60-99
C.100-139
D.140-169
πŸ’‘ Difficulty: medium | βœ… Correct: A

πŸ“– Explanation: The time-sharing class in Solaris has priorities in the range of 0-59. This is the widest priority range among the scheduling classes, providing 60 different priority levels for time-sharing threads.

Q65. What is the priority range for the interactive class in Solaris?

A.0-59 βœ…
B.60-99
C.100-139
D.140-169
πŸ’‘ Difficulty: medium | βœ… Correct: A

πŸ“– Explanation: The interactive class in Solaris has the same priority range as the time-sharing class (0-59). However, threads in the interactive class receive higher priority for windowing applications, providing better performance for GUI applications.

Q66. What is the priority range for the real-time class in Solaris?

A.0-59
B.60-99 βœ…
C.100-139
D.140-169
πŸ’‘ Difficulty: medium | βœ… Correct: B

πŸ“– Explanation: The real-time class in Solaris has priorities in the range of 60-99. These priorities are higher than the time-sharing and interactive classes, ensuring that real-time threads get CPU access before other threads.

Q67. What is the priority range for the system class in Solaris?

A.0-59
B.60-99
C.100-139 βœ…
D.140-169
πŸ’‘ Difficulty: medium | βœ… Correct: C

πŸ“– Explanation: The system class in Solaris has priorities in the range of 100-139. These priorities are higher than the real-time class, ensuring that kernel threads get CPU access before real-time threads.

Q68. What is the priority range for interrupt threads in Solaris?

A.0-59
B.60-99
C.100-139
D.160-169 βœ…
πŸ’‘ Difficulty: easy | βœ… Correct: D

πŸ“– Explanation: Interrupt threads in Solaris execute at the highest priorities in the system, ranging from 160 to 169. This ensures immediate response to hardware interrupts.

Q69. What is the main purpose of the Solaris dispatcher?

A.To create new threads
B.To select the next thread to run βœ…
C.To terminate threads
D.To allocate memory
πŸ’‘ Difficulty: easy | βœ… Correct: B

πŸ“– Explanation: The Solaris dispatcher is responsible for selecting the next thread to run. It converts class-specific priorities into global priorities and selects the thread with the highest global priority, managing the execution of threads on the CPU.

Q70. What is the main purpose of the 'return from sleep' priority boost in Solaris?

A.To penalize CPU-bound threads
B.To give high priority to threads that have been waiting for I/O βœ…
C.To ensure all threads get equal CPU time
D.To reduce context switching overhead
πŸ’‘ Difficulty: hard | βœ… Correct: B

πŸ“– Explanation: The 'return from sleep' priority boost gives high priority to threads that have been waiting for I/O. This improves response times for interactive and I/O-bound threads by ensuring they get CPU time quickly when the I/O they need becomes available.

Q71. What is the main characteristic of the fair-share scheduling class?

A.It uses priorities
B.It uses CPU shares βœ…
C.It uses dynamic priority adjustment
D.It uses fixed priorities
πŸ’‘ Difficulty: medium | βœ… Correct: B

πŸ“– Explanation: The fair-share scheduling class uses CPU shares instead of priorities to make scheduling decisions. CPU shares indicate entitlement to available CPU resources and are allocated to projects, allowing fair allocation of CPU time.

Q72. What is the main characteristic of the fixed-priority scheduling class?

A.It uses dynamic priority adjustment
B.It uses CPU shares
C.It has fixed priorities that do not change βœ…
D.It has the highest priority
πŸ’‘ Difficulty: medium | βœ… Correct: C

πŸ“– Explanation: The fixed-priority scheduling class has fixed priorities that do not change. This is different from the time-sharing class, where priorities are dynamically adjusted based on thread behavior.

Q73. What is the global priority range for all Solaris scheduling classes?

A.0-59
B.0-99
C.0-139
D.0-169 βœ…
πŸ’‘ Difficulty: hard | βœ… Correct: D

πŸ“– Explanation: The global priority range in Solaris spans from 0 to 169. This includes all scheduling classes (0-59 for TS/IA, 60-99 for RT, 100-139 for SYS) and interrupt threads (160-169), with higher numbers indicating higher priority.

Q74. What is the purpose of the multilevel feedback queue in the time-sharing class?

A.To simplify the scheduling algorithm
B.To dynamically alter priorities and assign time slices βœ…
C.To ensure all threads get equal CPU time
D.To eliminate the need for preemption
πŸ’‘ Difficulty: hard | βœ… Correct: B

πŸ“– Explanation: The multilevel feedback queue in the time-sharing class dynamically alters priorities and assigns time slices of different lengths. Threads that are CPU-intensive have their priorities lowered, while I/O-bound threads have their priorities boosted, providing balanced scheduling.

Q75. What is the main benefit of the interactive class in Solaris?

A.It gives higher priority to windowing applications βœ…
B.It uses CPU shares
C.It has fixed priorities
D.It has the highest priority
πŸ’‘ Difficulty: medium | βœ… Correct: A

πŸ“– Explanation: The interactive class gives higher priority to windowing applications, such as those created by KDE or GNOME. This ensures that GUI applications remain responsive, improving the user experience.

Q76. What is the main purpose of the real-time class in Solaris?

A.To provide guaranteed response within a bounded period βœ…
B.To give higher priority to windowing applications
C.To use CPU shares
D.To reserve priorities for kernel use
πŸ’‘ Difficulty: hard | βœ… Correct: A

πŸ“– Explanation: The real-time class provides guaranteed response within a bounded period. Real-time threads have the highest priority among scheduling classes, ensuring they run before any other threads and meet their timing requirements.

πŸ”— Related Topics (MCQs)