Q. In a scenario where a set is defined by the constraints of being both a square number and less than 50, which of the following is NOT a member of this set?
A.
1
B.
4
C.
9
D.
49
Solution
49 is a square number but is included in the set; however, if the constraint was 'less than or equal to 48', then it would not be included.
Q. In a scenario where resources are limited, which strategy is most effective for prioritizing resource allocation? (2023)
A.
Random selection of projects
B.
Allocating resources based on historical performance
C.
Evaluating projects based on their potential return on investment
D.
Distributing resources equally among all projects
Solution
Evaluating projects based on their potential return on investment is the most effective strategy for prioritizing resource allocation in scenarios with limited resources.
Correct Answer:
C
— Evaluating projects based on their potential return on investment
Q. In a scenario where resources are limited, which strategy is most effective for maximizing output?
A.
Allocating resources equally across all departments.
B.
Prioritizing departments based on their contribution to overall goals.
C.
Investing heavily in one department to boost its performance.
D.
Reducing resources in underperforming departments without analysis.
Solution
Prioritizing departments based on their contribution to overall goals ensures that resources are allocated where they can generate the most value, making option 1 the best strategy.
Correct Answer:
B
— Prioritizing departments based on their contribution to overall goals.
Q. In a scenario where set B is defined as {x | x is a natural number and x < 10}, which of the following elements would violate the constraints of set B?
A.
5
B.
10
C.
0
D.
7
Solution
The element 10 violates the constraint of being less than 10, thus it cannot be included in set B.
Q. In a scheduling scenario, if task A takes 2 hours, task B takes 3 hours, and task C takes 1 hour, which of the following combinations can be completed in 5 hours?
A.
A and B
B.
B and C
C.
A and C
D.
A, B, and C
Solution
B and C can be completed in 4 hours, which is within the 5-hour limit.
Q. In a scheduling scenario, if task A takes 2 hours, task B takes 3 hours, and task C takes 1 hour, which of the following combinations allows for the earliest completion of all tasks if A must be done before B?
A.
A, B, C
B.
C, A, B
C.
B, A, C
D.
A, C, B
Solution
The combination C, A, B allows for the earliest completion since C takes the least time and can be done first.
Q. In a scheduling scenario, if task B cannot start until task A is finished, and task C cannot start until task B is finished, which of the following is a valid conclusion?
A.
A must finish before C
B.
B can start before A
C.
C can start before B
D.
A can start after C
Solution
A must finish before C can start, making the conclusion valid.
Q. In a scheduling scenario, if task X must be completed before task Y, and task Y must be completed before task Z, which of the following is a valid inference?
A.
X can start after Y
B.
Z can start before Y
C.
Y can start after X
D.
Z must start after X
Solution
Z must start after X because X is a prerequisite for Y, which in turn is a prerequisite for Z.
Q. In a scheduling scenario, if task X must be completed before task Y, and task Y must be completed before task Z, which of the following sequences is valid?
A.
Z, Y, X
B.
X, Y, Z
C.
Y, Z, X
D.
Z, X, Y
Solution
The sequence X, Y, Z respects the order that X is before Y and Y is before Z.
Q. In a scheduling set involving five friends, A, B, C, D, and E, if A cannot sit next to B, and C must sit between D and E, which of the following arrangements is valid?
A.
A, C, D, E, B
B.
B, A, C, E, D
C.
D, C, E, A, B
D.
C, D, A, B, E
Solution
The arrangement A, C, D, E, B satisfies the conditions as A is not next to B and C is between D and E.
Q. In a scheduling set involving five tasks A, B, C, D, and E, if task A must be completed before task B, and task C must be completed before task D, which of the following is a valid sequence?
A.
A, B, C, D, E
B.
C, D, A, B, E
C.
B, A, D, C, E
D.
E, A, C, D, B
Solution
The sequence A, B, C, D, E respects the constraints that A is before B and C is before D.
Q. In a scheduling set involving four tasks A, B, C, and D, if task A must be completed before task B, and task C cannot start until task D is finished, which of the following sequences is valid?
A.
A, B, C, D
B.
D, C, A, B
C.
B, A, D, C
D.
C, D, A, B
Solution
The only valid sequence is D, C, A, B, as it respects the constraints given.
Q. In a scheduling set, if task E must be completed before task D, and task D must be completed before task C, which of the following sequences is valid?
A.
C, D, E
B.
E, D, C
C.
D, C, E
D.
E, C, D
Solution
The sequence E, D, C respects the order that E must be completed before D, and D must be completed before C.
