Operating System

31. Which of the following wait is undesirable for a process?
निम्न में से कौन-सा wait किसी process के लिए undesirable है?
(RPSC C.S. 2016 (PAPER-I))
A. Waiting in ready queue
B. Waiting for input/output
C. Waiting for semaphore
D. Busy waiting

Correct Answer: D

Explanation (EN): Busy waiting wastes CPU cycles by repeatedly checking a condition.

Explanation (HI): Busy waiting में process बार-बार condition check करता रहता है, जिससे CPU cycles waste होती हैं।

32. On a system using fixed partition with sizes 2^16, 2^24, 2^32, how many bits must the limit register have?
एक system में fixed partitions के sizes 2^16, 2^24, 2^32 हैं। Limit register में कितने bits होने चाहिए?
(RPSC C.S. 2016 (PAPER-I))
A. 32 Bits
B. 24 Bits
C. 16 Bits
D. All of these

Correct Answer: A

Explanation (EN): The limit register must represent the largest partition size, which is 2^32 bytes, so 32 bits are needed.

Explanation (HI): Limit register को सबसे बड़े partition size 2^32 bytes को represent करना होगा, इसलिए 32 bits चाहिए।

33. Which is false statement:
निम्न में से कौन-सा कथन गलत है?
(RPSC C.S. 2016 (PAPER-I))
A. The dispatcher module gives control to CPU to process the selected short term scheduler process
B. The dispatcher may invoke during process context switch
C. Dispatch latency is the time to stop one process and start another process
D. The dispatcher is not used in CPU scheduling

Correct Answer: D

Explanation (EN): The dispatcher is an essential part of CPU scheduling, so saying it is not used is false.

Explanation (HI): Dispatcher CPU scheduling का essential भाग है, इसलिए यह कहना कि इसका उपयोग नहीं होता, गलत है।

34. The process arrive in a system at the rate of 10 processes/minute and average service time for each job is 3 seconds. What will be the system load?
किसी system में processes 10 processes per minute की दर से आते हैं और प्रत्येक job का average service time 3 seconds है। System load क्या होगा?
(RPSC C.S. 2016 (PAPER-I))
A. ρ = 0.5
B. ρ = 3.3
C. ρ = 0.3
D. ρ = 1

Correct Answer: A

Explanation (EN): Arrival rate = 10/60 per second and service time = 3 seconds, so load ρ = λ×T = (10/60)×3 = 0.5.

Explanation (HI): Arrival rate = 10/60 per second और service time = 3 seconds, इसलिए load ρ = λ×T = (10/60)×3 = 0.5।

35. On a system using non preemptive scheduling, process with expected runtime of 5, 18, 9, 12 are in ready queue. In what order they should be run to minimize wait time?
Non-preemptive scheduling वाले system में ready queue में 5, 18, 9, 12 runtime वाले processes हैं। Waiting time न्यूनतम करने के लिए इन्हें किस order में चलाना चाहिए?
(RPSC C.S. 2016 (PAPER-I))
A. 5, 18, 9, 12
B. 5, 9, 12, 18
C. 18, 12, 9, 5
D. 18, 5, 9, 12

Correct Answer: B

Explanation (EN): Shortest Job First order minimizes average waiting time, so the order is 5, 9, 12, 18.

Explanation (HI): Shortest Job First average waiting time को minimize करता है, इसलिए order 5, 9, 12, 18 होगा।

36. RAID stands for?
RAID का full form क्या है?
(RPSC C.S. 2016 (PAPER-I))
A. Redundant Array of Inexpensive Disks
B. Relative Array of Inexpensive Disks
C. Redundant Array of Inter-related Disks
D. Relative Array of Inter-related Disks

Correct Answer: A

Explanation (EN): RAID stands for Redundant Array of Inexpensive Disks.

Explanation (HI): RAID का full form Redundant Array of Inexpensive Disks है।

37. Which of the statement is not true related to threads?
Threads के संबंध में कौन-सा कथन सही नहीं है?
(RPSC C.S. 2016 (PAPER-I))
A. Thread is a light weight process
B. User level threads are managed by thread library
C. Kernel level threads are faster to create and manage than user level threads
D. Thread minimize context switching time

Correct Answer: C

Explanation (EN): Kernel level threads involve more overhead and are generally slower to create and manage than user level threads.

Explanation (HI): Kernel level threads में अधिक overhead होता है, इसलिए वे user level threads की तुलना में धीमे होते हैं।

38. Which of the following instruction need not to be executed in kernel mode?
निम्न में से किस instruction को kernel mode में execute करना आवश्यक नहीं है?
(RPSC C.S. 2016 (PAPER-I))
A. Change memory management registers
B. Set the time of day clock
C. Change processor priority
D. Write the program counter

Correct Answer: D

Explanation (EN): The program counter is updated during normal instruction execution and need not be a privileged kernel-only operation.

Explanation (HI): Program counter normal instruction execution के दौरान update होता है और इसे kernel mode में ही execute करना आवश्यक नहीं है।

39. Which of the following process state transition is not possible?
निम्न में से कौन-सा process state transition संभव नहीं है?
(RPSC C.S. 2016 (PAPER-I))
A. Run → Ready
B. Run → Blocked
C. Blocked → Run
D. Run → Terminated

Correct Answer: C

Explanation (EN): A blocked process must first move to the ready state before it can run.

Explanation (HI): Blocked process सीधे run state में नहीं जा सकता; पहले उसे ready state में आना पड़ता है।

40. Following are applications and scheduling algorithms: A. Guaranteed Scheduling B. Real Time Scheduling C. Thread Scheduling. Which of the below combination suits better?
निम्न applications और scheduling algorithms के लिए सही combination कौन-सा है? A. Guaranteed Scheduling B. Real Time Scheduling C. Thread Scheduling
(RPSC C.S. 2016 (PAPER-I))
A. A-1, B-2, C-3
B. A-3, B-2, C-1
C. A-2, B-3, C-1
D. A-3, B-1, C-2

Correct Answer: B

Explanation (EN): Guaranteed Scheduling matches Fare Share Scheduling, Real Time Scheduling matches Rate Monotonic Scheduling, and Thread Scheduling matches Gang Scheduling.

Explanation (HI): Guaranteed Scheduling का संबंध Fare Share Scheduling से, Real Time Scheduling का Rate Monotonic Scheduling से, और Thread Scheduling का Gang Scheduling से है।

Prev12345678910111213141516171819202122Next