Question

David hs three credit cards A,B,C and he ows balances on all the cards. Does he owe the gretest balance on card B Statement (I): Sum of balances on B and C is ₹13500, which is three times balance on A.
Statement (II): Balance on card B is \(\frac{4}{3}\) of card A and \(\frac{4}{5}\) of the balance on card C.

• A. Statement (I) alone is sufficient.
• B. Statement (II) alone is sufficient.
• C. Both statements (I) and (II) are sufficient.
• D. Neither statement is sufficient.

Hint:

"Is B the greatest?" is a Yes/No question. A definitive "No" is a sufficient answer.

Answer 1

The Correct Option is B

Step 1: Understanding the Question:
The goal is to pinpoint the CPU scheduling algorithm among the options that is strictly non-preemptive, meaning a running process cannot be interrupted before it voluntarily yields the CPU.


Step 2: Detailed Explanation:
Let's analyze each option:
- Round Robin (RR): This is a preemptive algorithm that relies on a fixed time quantum. Processes are interrupted if they exceed their time slice.
- Shortest Remaining Time First (SRTF): As the preemptive counterpart to Shortest Job First, it interrupts the current process if a newly arrived process has a shorter burst time.
- First-Come, First-Served (FCFS): This algorithm executes processes strictly in their arrival order. Once a process is allocated the CPU, it runs to completion or blocks on its own. Hence, it is strictly non-preemptive.
- Priority Scheduling (Preemptive): The option explicitly states it is preemptive, allowing higher-priority processes to interrupt lower-priority ones.
Consequently, FCFS is the only non-preemptive choice provided.


Step 3: Final Answer:
The correct choice is (C).