CUET UG Applied Mathematics Booster Test 3 - Scheduling, Races, and Inequalities
📌 Answers are locked once submitted — results and explanations appear at the end.
QUESTION 1 OF 20
Evaluate the difference between Response Time and Waiting Time in a strictly Non-Pre-emptive scheduling system.
QUESTION 2 OF 20
Match the specific business partnership data to their resulting profit or investment ratios.
| List 1 | List 2 |
|---|---|
| 1. P invests ₹6000 more than Q; Q invests ₹5000 more than R (Total ₹64000) | a. Equivalent Capital Ratio is 20 : 16 : 15 |
| 2. A puts in ₹5000/month (12 months), B puts ₹3000/month (4 months) + ₹4500/month (8 months), C puts ₹4000/month (9 months) + ₹3000/month (3 months) | b. Profit Share Ratio is 6 : 7 : 8 |
| 3. Profit ratio is 6 : 7 : 8, Time ratio is 2 : 3 : 4 | c. Investment Ratio is 27 : 21 : 16 |
| 4. A, B, C share a profit of ₹21000 from capitals ₹36000, ₹42000, ₹48000 | d. Investment Ratio is 9 : 7 : 6 |
QUESTION 3 OF 20
Consider 4 processes arriving at AT = 0 with Burst Times: P1 = 25, P2 = 4, P3 = 7, P4 = 3. Which of the following evaluations mathematically hold true?
(1) Under FCFS, P1 executes first, and Average Waiting Time = 22.5 units.
(2) Under SJF, P4 executes first (BT = 3), followed by P2, P3, P1.
(3) Under SJF, Average Waiting Time = 6 units.
(4) FCFS produces a smaller Average Turnaround Time than SJF.
QUESTION 4 OF 20
Which of the following statements regarding the non-pre-emptive Shortest Job First (SJF) algorithm is algebraically INCORRECT when assessing arrival times > 0?
QUESTION 5 OF 20
In a mixed CPU environment, if process A (Priority 1, high) arrives at 5ms while process B (Priority 5, low) has been running since 0ms and needs 10ms total, what occurs under Non-Pre-emptive Priority Scheduling?
QUESTION 6 OF 20
A processor handles constraints. If idle time occurs because P1 completes at 4 units but P2 does not arrive until 5 units, what is the length of the Idle Time constraint region?
QUESTION 7 OF 20
Equating the metrics: Process P3 has AT=1, BT=2, and CT=3. What are its Turnaround Time (TAT) and Waiting Time (WT) respectively?
QUESTION 8 OF 20
Calculate the moving average waiting time for 4 processes scheduled in FCFS: P1(WT=0), P2(WT=2), P3(WT=6), P4(WT=9).
QUESTION 9 OF 20
What is the probabilistic formula linking Completion Time (CT), Arrival Time (AT), and Turnaround Time (TAT)?
QUESTION 10 OF 20
If the vector of execution is purely FCFS with processes P1(AT=0, BT=2), P2(AT=1, BT=2), P3(AT=5, BT=3). What is the CT of P3?
QUESTION 11 OF 20
If A runs 3 times as fast as B, and A gives B a head start of 40 metres, what must be the total linear area (length) of the racecourse so that A and B reach the goal at the exact same time?
QUESTION 12 OF 20
Integrating the ratios in a 1000m race: A defeats B by 100m, and B defeats C by 100m. What is the integrated ratio of the distances covered by A, B, and C in the same amount of time?
QUESTION 13 OF 20
Based on the integrated ratio 100:90:81, by how many metres does A defeat C in a 1000m race?
QUESTION 14 OF 20
In a 500m race, A defeats B by 60 metres OR 12 seconds. What is the time taken by A to complete the race?
QUESTION 15 OF 20
A, B, and C enter a partnership. B contributes 1/3 of the capital. A contributes as much as B and C together. What is the ratio of their capitals (A:B:C)?
QUESTION 16 OF 20
Priya invests Rs 40,000. After 4 months, Rekha joins with Rs 50,000. They earn Rs 220,000 profit at the end of the year. What is the exact profit share of Rekha?
QUESTION 17 OF 20
Evaluate the inequality: (y - 1) / 3 + (y - 5) / 5 > (y + 3) / 6 + (y + 2) / 2. Which numerical inequality operation must be carefully monitored if multiplying by the LCM across the inequality?
QUESTION 18 OF 20
If A = 2, B = 4, evaluate the quantities AB and A+B. Why can we NOT definitively establish a universal static inequality like AB > A+B for all positive integers?
QUESTION 19 OF 20
According to the passage, how is B's speed strictly derived if A beats B by 60 metres and 12 seconds?
QUESTION 20 OF 20
Using the derived speed (5 m/s) from the passage scenario, how much time does B take to complete a full 500m racecourse?
Test Complete!
Answer Review
1 Evaluate the difference between Response Time and Waiting Time in a strictly Non-Pre-emptive scheduling system.
�� In non-pre-emptive systems, execution starts only once. �� Response time measures first CPU allocation delay. �� Waiting time equals response time here.
In a strictly non-pre-emptive scheduling system: • A process starts execution once and continues until completion. • Response Time = Time from arrival until first CPU allocation. • Waiting Time = Total time spent waiting in ready queue. Since the process is never interrupted, the first response delay equals the total waiting delay. Thus: Hence option C is correct. Option A and B are incorrect because neither quantity exceeds the other in strictly non-pre-emptive scheduling. Option D is wrong because both metrics apply to all scheduling algorithms.
- �� Option A → Response time does not exceed waiting time in non-pre-emptive systems.
- �� Option B → Waiting time is not greater separately here.
- �� Option D → Both concepts apply universally in CPU scheduling.
Used: Contextual/Tonal Matching
Application: Match non-pre-emptive behavior with timing definitions.
Final Logic: No interruption means response delay equals waiting delay.
"No pre-emption = Same response & wait."
2 Match the specific business partnership data to their resulting profit or investment ratios.
| List 1 | List 2 |
|---|---|
| 1. P invests ₹6000 more than Q; Q invests ₹5000 more than R (Total ₹64000) | a. Equivalent Capital Ratio is 20 : 16 : 15 |
| 2. A puts in ₹5000/month (12 months), B puts ₹3000/month (4 months) + ₹4500/month (8 months), C puts ₹4000/month (9 months) + ₹3000/month (3 months) | b. Profit Share Ratio is 6 : 7 : 8 |
| 3. Profit ratio is 6 : 7 : 8, Time ratio is 2 : 3 : 4 | c. Investment Ratio is 27 : 21 : 16 |
| 4. A, B, C share a profit of ₹21000 from capitals ₹36000, ₹42000, ₹48000 | d. Investment Ratio is 9 : 7 : 6 |
�� Partnership profit is proportional to Capital × Time. �� Equivalent capital converts varying investments into a common ratio. �� Profit and investment ratios are obtained using partnership formulas.
Partnership is based on the relation: Profit Ratio ∝ Capital × Time 1 → c Let the investment of R be x. Then, Q = x + 5000 P = x + 11000 Given, P + Q + R = 64000 (x + 11000) + (x + 5000) + x = 64000 3x + 16000 = 64000 3x = 48000 x = 16000 Therefore, R = 16000 Q = 21000 P = 27000 Investment Ratio = 27000 : 21000 : 16000 = 27 : 21 : 16 Hence, 1 → c. 2 → a Capital × Time: A = 5000 × 12 = 60000 B = (3000 × 4) + (4500 × 8) = 12000 + 36000 = 48000 C = (4000 × 9) + (3000 × 3) = 36000 + 9000 = 45000 Equivalent Ratio = 60000 : 48000 : 45000 = 20 : 16 : 15 Hence, 2 → a. 3 → d Investment Ratio = Profit Ratio ÷ Time Ratio = 6/2 : 7/3 : 8/4 = 3 : 7/3 : 2 Multiplying by 3, = 9 : 7 : 6 Hence, 3 → d. 4 → b Capital Ratio = 36000 : 42000 : 48000 = 6 : 7 : 8 Since the investment period is the same, the profit-sharing ratio is also 6 : 7 : 8. Hence, 4 → b. Therefore, the correct matching is: 1 → c 2 → a 3 → d 4 → b Hence, Option A is correct.
- �� Option B → Incorrect because Question 1 matches Investment Ratio 27 : 21 : 16, not Equivalent Capital Ratio 20 : 16 : 15.
- �� Option C → Incorrect because Question 2 gives the Equivalent Capital Ratio 20 : 16 : 15, not Investment Ratio 27 : 21 : 16.
- �� Option D → Incorrect because Question 4 corresponds to the Profit Share Ratio 6 : 7 : 8, not Investment Ratio 9 : 7 : 6.
Used: Option Grouping
Application:
- Evaluate each partnership case independently using Capital × Time and then compare the complete mapping with the given options.
Final Logic:
- Only Option A correctly matches all four business partnership situations.
Capital × Time = Profit.
3 Consider 4 processes arriving at AT = 0 with Burst Times: P1 = 25, P2 = 4, P3 = 7, P4 = 3. Which of the following evaluations mathematically hold true?
(1) Under FCFS, P1 executes first, and Average Waiting Time = 22.5 units.
(2) Under SJF, P4 executes first (BT = 3), followed by P2, P3, P1.
(3) Under SJF, Average Waiting Time = 6 units.
(4) FCFS produces a smaller Average Turnaround Time than SJF.
�� FCFS executes processes in arrival order. �� SJF schedules the process with the smallest burst time first. �� SJF minimizes the average waiting time.
Under FCFS: Execution Order: P1 → P2 → P3 → P4 Waiting Times: P1 = 0 P2 = 25 P3 = 29 P4 = 36 Average Waiting Time = (0 + 25 + 29 + 36) / 4 = 90 / 4 = 22.5 units Hence, Statement (1) is correct. Under SJF: Execution Order: P4 → P2 → P3 → P1 Waiting Times: P4 = 0 P2 = 3 P3 = 7 P1 = 14 Average Waiting Time = (0 + 3 + 7 + 14) / 4 = 24 / 4 = 6 units Hence, Statements (2) and (3) are correct. Average Turnaround Time under SJF is also lower than FCFS because shorter jobs finish earlier. Therefore, Statement (4) is false. Hence, Option B is correct.
- �� Option A → Incorrect because Statement (3) is also correct.
- �� Option C → Incorrect because Statement (4) is false.
- �� Option D → Incorrect because FCFS does not produce a lower average turnaround time than SJF in this case.
Used: Substitution
Application:
- Compute the waiting times directly for FCFS and SJF using the given burst times and compare the results.
Final Logic:
- The calculated waiting times confirm that only Statements (1), (2), and (3) are correct.
Shortest Job First → Smallest Wait.
4 Which of the following statements regarding the non-pre-emptive Shortest Job First (SJF) algorithm is algebraically INCORRECT when assessing arrival times > 0?
�� Non-pre-emptive SJF does not interrupt running jobs. �� New short process must wait. �� Pre-emption belongs to SRTF.
In non-pre-emptive SJF: • Once execution starts, the running process continues until completion. • A later-arriving short process cannot interrupt execution. Therefore, statement C is incorrect because pre-emption is not allowed. Statement A is correct for simultaneous arrivals. Statement B correctly explains waiting behavior. Statement D correctly describes FCFS tie-breaking.
- �� Option A → Correct ascending burst-time ordering.
- �� Option B → Non-pre-emptive scheduling forces waiting.
- �� Option D → FCFS resolves equal burst-time conflicts.
Used: Elimination
Application: Identify statement contradicting "non-pre-emptive."
Final Logic: Pre-emption cannot occur in non-pre-emptive SJF.
"Non-pre-emptive = No interruption."
5 In a mixed CPU environment, if process A (Priority 1, high) arrives at 5ms while process B (Priority 5, low) has been running since 0ms and needs 10ms total, what occurs under Non-Pre-emptive Priority Scheduling?
�� Non-pre-emptive systems do not interrupt running tasks. �� Higher priority waits until CPU becomes free. �� Process B completes first.
Process B starts at 0 ms and requires 10 ms. At 5 ms, process A arrives with higher priority. In non-pre-emptive priority scheduling: • The currently running process is not interrupted. • B continues until completion at 10 ms. • A starts afterward. Hence option C is correct.
- �� Option A → Running processes are not terminated arbitrarily.
- �� Option B → High-priority processes are queued, not rejected.
- �� Option D → Pausing is pre-emptive behavior.
Used: Contextual/Tonal Matching
Application: Apply non-pre-emptive scheduling rule.
Final Logic: Running process completes before switching.
"Finish first, switch later."
6 A processor handles constraints. If idle time occurs because P1 completes at 4 units but P2 does not arrive until 5 units, what is the length of the Idle Time constraint region?
�� Idle time occurs when CPU waits. �� P1 ends at 4. �� P2 arrives at 5.
Idle Time is: Substitute values: Hence idle time = 1 unit.
- �� Option A → CPU is not continuously busy.
- �� Option C → Incorrect subtraction logic.
- �� Option D → Total timeline, not idle gap.
Used: Substitution
Application: Compute difference between completion and next arrival.
Final Logic: CPU remains idle for exactly one unit.
"Gap between jobs = Idle time."
7 Equating the metrics: Process P3 has AT=1, BT=2, and CT=3. What are its Turnaround Time (TAT) and Waiting Time (WT) respectively?
�� TAT = CT − AT. �� WT = TAT − BT. �� Process begins immediately.
Use formulas: Substitute values: TAT = 3 − 1 = 2 WT = 2 − 2 = 0 Thus, option B is correct.
- �� Option A → Incorrect TAT calculation.
- �� Option C → TAT and WT reversed incorrectly.
- �� Option D → Values exceed actual execution metrics.
Used: Substitution
Application: Insert values into standard formulas.
Final Logic: TAT = 2 and WT = 0 satisfy scheduling equations.
"TAT minus BT gives WT."
8 Calculate the moving average waiting time for 4 processes scheduled in FCFS: P1(WT=0), P2(WT=2), P3(WT=6), P4(WT=9).
�� Average WT = Sum of WT / Number of processes. �� Add all waiting times. �� Divide by 4.
Average Waiting Time: Hence option A is correct.
- �� Option B → Incorrect arithmetic averaging.
- �� Option C → Represents total waiting time only.
- �� Option D → Incorrect division result.
Used: Substitution
Application: Apply average formula directly.
Final Logic: Sum divided by process count gives 4.25.
"Average = Total ÷ Count."
9 What is the probabilistic formula linking Completion Time (CT), Arrival Time (AT), and Turnaround Time (TAT)?
�� TAT measures total process duration. �� It starts at arrival. �� It ends at completion.
Turnaround Time is defined as total elapsed time from arrival to completion. Formula: Thus option B is correct. Other options incorrectly rearrange or misuse variables.
- �� Option A → Incorrect addition relation.
- �� Option C → Wrong rearrangement.
- �� Option D → Division has no scheduling meaning here.
Used: Elimination
Application: Identify standard scheduling equation.
Final Logic: TAT equals completion minus arrival.
"Completion minus Arrival = Turnaround."
10 If the vector of execution is purely FCFS with processes P1(AT=0, BT=2), P2(AT=1, BT=2), P3(AT=5, BT=3). What is the CT of P3?
�� FCFS executes by arrival order. �� P1 finishes at 2. �� P3 arrives later at 5.
Execution sequence: • P1: 0 → 2 • P2: 2 → 4 • CPU idle: 4 → 5 • P3: 5 → 8 Therefore, Completion Time of P3 = 8. Hence option C is correct.
- �� Option A → Equals arrival time only.
- �� Option B → Ignores full burst duration.
- �� Option D → Adds unnecessary delay.
Used: Substitution
Application: Construct FCFS execution timeline stepwise.
Final Logic: P3 starts at 5 and runs 3 units, finishing at 8.
"FCFS follows arrival queue."
11 If A runs 3 times as fast as B, and A gives B a head start of 40 metres, what must be the total linear area (length) of the racecourse so that A and B reach the goal at the exact same time?
�� Speed ratio A:B = 3:1 �� B gets 40 m head start �� Equal finishing time forms proportional distance relation
- Let total race length be x metres. → A runs x metres while B runs only (x − 40) metres. → Since A is 3 times as fast as B: → Therefore, the total racecourse length is 60 metres. → Option B is correct. → Option A, C, and D do not satisfy the proportional speed condition.
- �� Option A → 120 m gives distance ratio 120:80 = 3:2, not 3:1.
- �� Option C → 80 m gives ratio 80:40 = 2:1, incorrect.
- �� Option D → 100 m gives ratio 100:60 = 5:3, incorrect.
Used: Substitution
Application: Convert the race condition into a speed-distance proportional equation and solve algebraically.
Final Logic: Equal finishing time implies distance ratio equals speed ratio.
"Same Time ⇒ Speed Ratio = Distance Ratio"
12 Integrating the ratios in a 1000m race: A defeats B by 100m, and B defeats C by 100m. What is the integrated ratio of the distances covered by A, B, and C in the same amount of time?
�� A:B = 1000:900 �� B:C = 1000:900 �� Multiply proportional relations carefully
- If A defeats B by 100 m in a 1000 m race: → If B defeats C by 100 m: → Combine both: → Hence, Option C is correct. → Option A ignores compounded proportional effect. → Option B is incomplete scaling. → Option D incorrectly assumes linear subtraction.
- �� Option A → Uses simple subtraction instead of chained ratios.
- �� Option B → Does not preserve the second proportional relation properly.
- �� Option D → Treats differences directly rather than using ratios.
Used: Substitution
Application: Convert race margins into speed ratios and integrate sequentially.
Final Logic: Combined race ratios multiply proportionally.
"Race Defeat → Convert to Speed Ratio First"
13 Based on the integrated ratio 100:90:81, by how many metres does A defeat C in a 1000m race?
�� Ratio A:C = 100:81 �� A finishes 1000 m first �� C covers proportional reduced distance
- From the ratio: → When A runs 1000 m, C runs: → Therefore, A defeats C by: → Hence, Option B is correct.
- �� Option A → Overestimates the margin.
- �� Option C → Numerical confusion from ratio term 81.
- �� Option D → Ignores compounded race ratio.
Used: Substitution
Application: Use integrated ratio directly to compute remaining distance.
Final Logic: Distance lag = Total race distance − proportional covered distance.
"100:81 ⇒ 19% behind"
14 In a 500m race, A defeats B by 60 metres OR 12 seconds. What is the time taken by A to complete the race?
�� B covers 60 m in 12 sec �� B's speed = 5 m/s �� Use race ratio for A's speed
- B covers remaining 60 m in 12 sec: → When A finishes 500 m, B covers 440 m. → Therefore: → A's speed: → Time taken by A: → Hence, Option A is correct.
- �� Option B → Assumes incorrect equal speed relation.
- �� Option C → Overestimates completion time.
- �� Option D → Gives faster speed than ratio permits.
Used: Dimensional/Unit Analysis
Application: Convert metres and seconds into speed, then compute race completion time.
Final Logic: Use "remaining distance ÷ extra time" to derive speed.
"Beat by metres + seconds ⇒ Find speed first"
15 A, B, and C enter a partnership. B contributes 1/3 of the capital. A contributes as much as B and C together. What is the ratio of their capitals (A:B:C)?
�� Let total capital = 1 �� B contributes 1/3 �� A = B + C
- Let total capital be 1. → B contributes: → Remaining for A and C: → Given: → Since: then: Also: Substituting: Then: So: Multiply by 6: → Hence, Option B is correct.
- �� Option A → Does not satisfy A = B + C.
- �� Option C → Makes A equal to B + C false.
- �� Option D → Produces incorrect total proportion.
Used: Substitution
Application: Form equations from partnership conditions and simplify ratios.
Final Logic: Translate verbal relations into algebraic equations.
"A equals B+C → Largest share"
16 Priya invests Rs 40,000. After 4 months, Rekha joins with Rs 50,000. They earn Rs 220,000 profit at the end of the year. What is the exact profit share of Rekha?
�� Profit ∝ Capital × Time �� Priya invests for 12 months �� Rekha invests for 8 months
- Priya's investment-time: → Rekha's investment-time: → Ratio: → Total parts: → Rekha's share: → Hence, Option A is correct.
- �� Option B → Assumes larger contribution than actual ratio.
- �� Option C → Incorrect proportional division.
- �� Option D → Underestimates Rekha's investment-time effect.
Used: Substitution
Application: Use Capital × Time proportionality for partnership profit sharing.
Final Logic: Profit share follows effective investment ratio.
"Profit ∝ Money × Months"
17 Evaluate the inequality: (y - 1) / 3 + (y - 5) / 5 > (y + 3) / 6 + (y + 2) / 2. Which numerical inequality operation must be carefully monitored if multiplying by the LCM across the inequality?
�� Multiplying by positive numbers preserves inequality �� Denominators are all positive �� No sign reversal occurs
- In inequalities, multiplying or dividing by a positive number keeps the inequality direction unchanged. → Here denominators are: All are positive. Their LCM is also positive. → Therefore, multiplying throughout by the LCM does NOT reverse the sign. → Hence, Option C is correct.
- �� Option A → Sign changes only for negative multiplication/division.
- �� Option B → LCM being 1 is irrelevant.
- �� Option D → Subtraction does not automatically flip inequality signs.
Used: Elimination
Application: Remove options violating standard inequality rules.
Final Logic: Positive multiplication preserves inequality direction.
"Positive keeps direction; negative flips."
18 If A = 2, B = 4, evaluate the quantities AB and A+B. Why can we NOT definitively establish a universal static inequality like AB > A+B for all positive integers?
�� Product and sum vary with values �� No universal inequality exists �� Counterexamples disprove universal claims
- For A=2 and B=4: So: → But for A=1 and B=4: So: → Since both outcomes occur, no universal inequality is always true. → Hence, Option A is correct.
- �� Option B → Product and sum are not always equal.
- �� Option C → Inequalities apply broadly, not only to fractions.
- �� Option D → B need not be negative.
Used: Substitution
Application: Use numerical examples to test universal claims.
Final Logic: One counterexample disproves a universal inequality.
"Counterexample breaks universality."
19
According to the passage, how is B's speed strictly derived if A beats B by 60 metres and 12 seconds?
�� Remaining distance = 60 m �� Extra time = 12 sec �� Speed = Distance ÷ Time
- When A finishes, B is 60 m behind. → B covers this remaining distance in 12 seconds. Therefore: → Hence, Option B is correct.
- �� Option A → Multiplies instead of dividing.
- �� Option C → No averaging principle exists here.
- �� Option D → Reverses speed formula.
Used: Dimensional/Unit Analysis
Application: Apply the standard speed formula carefully with correct units.
Final Logic: Speed always equals distance divided by time.
"Speed = D/T"
20
Using the derived speed (5 m/s) from the passage scenario, how much time does B take to complete a full 500m racecourse?
�� Speed of B = 5 m/s �� Distance = 500 m �� Time = Distance ÷ Speed
- Given: → Therefore: → Hence, Option B is correct.
- �� Option A → Corresponds to another race scenario.
- �� Option C → Assumes slower speed.
- �� Option D → Gives incorrect division result.
Used: Dimensional/Unit Analysis
Application: Use standard motion formula directly.
Final Logic: Time equals distance divided by speed.
"T = D/S"
