Question:
A store sells four products — P, Q, R, and S — across four days (Mon–Thu), exactly one product per day.
P is not sold on Monday or Wednesday.
R is sold before Q.
S is not sold on Thursday.
Exactly one of P or Q is sold on Tuesday.
How many valid schedules are possible?
A store sells four products — P, Q, R, and S — across four days (Mon–Thu), exactly one product per day.
P is not sold on Monday or Wednesday.
R is sold before Q.
S is not sold on Thursday.
Exactly one of P or Q is sold on Tuesday.
How many valid schedules are possible?
P is not sold on Monday or Wednesday.
R is sold before Q.
S is not sold on Thursday.
Exactly one of P or Q is sold on Tuesday.
How many valid schedules are possible?
Show Hint
When scheduling across days with ordering constraints, break the problem into cases based on the strongest restriction—here, the Tuesday condition on P and Q.
Updated On: Nov 30, 2025
Hide Solution
Verified By Collegedunia
Correct Answer: 2
Solution and Explanation
We must assign P, Q, R, and S to Monday–Thursday, one per day, while meeting all conditions.
Step 1: Apply restrictions on P.
P is not sold on Monday or Wednesday. Therefore, P can only be on Tuesday or Thursday.
Step 2: Apply restriction on S.
S is not sold on Thursday.
Step 3: Apply the Tuesday condition.
Exactly one of P or Q is sold on Tuesday. This gives two cases: Case 1: P is on Tuesday.
Then Q is not on Tuesday. R must be before Q. S cannot be on Thursday. We check all placements under these constraints. This case produces exactly 1 valid schedule.
Case 2: Q is on Tuesday.
Then P is not on Tuesday. Since P can only go to Thursday (because Wednesday and Monday are forbidden), we assign P = Thursday. But S cannot be Thursday, so this is allowed. Now R must be before Q (Tuesday). Therefore, R must be on Monday. The only remaining product for Wednesday is S. This case also produces 1 valid schedule.
Step 4: Count valid schedules.
Each case yields exactly one valid arrangement, giving: \[ \boxed{2 \text{ valid schedules}} \] Final Answer: \(\boxed{2}\)
Step 1: Apply restrictions on P.
P is not sold on Monday or Wednesday. Therefore, P can only be on Tuesday or Thursday.
Step 2: Apply restriction on S.
S is not sold on Thursday.
Step 3: Apply the Tuesday condition.
Exactly one of P or Q is sold on Tuesday. This gives two cases: Case 1: P is on Tuesday.
Then Q is not on Tuesday. R must be before Q. S cannot be on Thursday. We check all placements under these constraints. This case produces exactly 1 valid schedule.
Case 2: Q is on Tuesday.
Then P is not on Tuesday. Since P can only go to Thursday (because Wednesday and Monday are forbidden), we assign P = Thursday. But S cannot be Thursday, so this is allowed. Now R must be before Q (Tuesday). Therefore, R must be on Monday. The only remaining product for Wednesday is S. This case also produces 1 valid schedule.
Step 4: Count valid schedules.
Each case yields exactly one valid arrangement, giving: \[ \boxed{2 \text{ valid schedules}} \] Final Answer: \(\boxed{2}\)
Was this answer helpful?
0
0
Top Questions on Logical Reasoning
- Four teams T1, T2, T3, T4 play a tournament where each team plays exactly two matches.
Rules:
1. No match ends in a draw.
2. T1 defeats T3.
3. T4 plays exactly one match before it plays T2.
4. T2 wins exactly one match.
5. T3 does not defeat T4.
6. Total matches = 4.
How many valid sequences of wins/losses across all matches are possible?
- Four companies C1, C2, C3, C4 must interview candidates P, Q, R, S over four time slots (T1--T4).
Each candidate gets one unique slot and each company interviews exactly one candidate per slot.
Constraints:
1. P cannot be interviewed by C1 or C3.
2. Q must be interviewed in either T1 or T4.
3. R must be interviewed before S.
4. C4 only interviews in T2 or T3.
5. No company interviews the same candidate as last year:
(C1--P), (C2--Q), (C3--R), (C4--S).
How many valid interview schedules are possible?
- Five lectures L1, L2, L3, L4, L5 must be scheduled from Monday to Friday (one each day).
Five professors A, B, C, D, E will take one lecture each. Constraints:
1. A takes L3.
2. L2 must be scheduled after L5.
3. C does not teach on Wednesday or Friday.
4. D teaches before E.
5. B does not teach L4.
How many valid schedules are possible?
- A delivery driver must travel from Source (S) to Destination (D).
Possible paths:
S → A → C → D,
S → B → C → D,
S → A → E → D,
S → B → F → D.
Rules:
1. A route cannot repeat a node.
2. A route cannot have more than 3 edges.
3. C cannot be visited if E is visited.
4. B cannot be used if F is used.
How many valid routes exist from S to D?
- Six employees A, B, C, D, E, F are to be assigned to three projects (P1, P2, P3), each with exactly two employees, under the following constraints:
A and D cannot be together;
B must be with C or F;
E must be in a project different from C;
F cannot be in P1.
How many valid assignments are possible?
View More Questions
Questions Asked in CAT exam
- Arun, Tarun and Varun work for 24, 21 and 15 days respectively and get paid 2160, 2400 and 2160 rupees respectively. They get paid the same even if they work for a partial day. If the work has to be completed within 10 days or less, what is the minimum amount that has to be paid to complete the entire task?
- CAT - 2025
- Time and Work
If \((2m+n) + (2n+m)=27\), find the maximum value of \((2m-3)\), assuming m and n are positive integers.
- CAT - 2025
- Algebra
- A shopkeeper sells an item at a profit of 20%. If he had bought it at 10% less and sold it for 60 more, his profit would become 60%. What is the cost price of the item?
- CAT - 2025
- Profit & Loss
- A container has a mixture of milk and water in the ratio 5 : 2. If 14 liters of this mixture is removed and replaced with water, the ratio becomes 5 : 4. What is the initial quantity of the mixture?
- CAT - 2025
- Ratio and Proportion
- Two circles of radii 6 cm and 6 cm intersect each other. The distance between their centers is 8 cm. What is the length of their common chord?
- CAT - 2025
- Geometry
View More Questions