Analytical Reasoning Question No. 11
A network system has exactly four message exchanges computers: R, S, T, and U. Messages travel from one computer directly to another computer only as follows:
1. From R to S, but not vice versa
2. From R to T, but not vice versa
3. From R to U, and vice versa
4. From S to T, and vice versa
5. From S to U, but not vice versa
6. From U to T, but not vice versa
7. A single direct path going in one direction from one computer to another is called a leg.
1. If a message is to travel from T to S over as few legs as possible, it must travel in which of the following ways?
(A) Directly from T to S
(B) Via R but no other computer
(C) Via U but no other computer
(D) Via R and U, in that order
(E) Via U and R, in that order
2. Which of the following is a complete and accurate list of computers to which a message can be sent along exactly one leg from U?
(A) R
(B) T
(C) R, T
(D) S, T
(E) R, S, T
3. Which of the following sequences of legs is a path over which a message could travel from S back to S?
(A) From S to R, from R to S
(B) From S to T, from T to R, from R to U, from U to S
(C) From S to T, from T to U, from U to R, from R to S
(D) From S to U, from U to R, from R to T, from T to S
(E) From S to U, from U to T, from T to R, from R to S
4. If all of the legs in the system are equal in length, and if messages always travel along the shortest possible path, then the longest path any message travels in the system is the path from
(A) S to R
(B) T to R
(C) T to U
(D) U to R
(E) U to S
5. If certain restricted messages cannot travel any further than one leg, and if an addition of one leg is to be made to the system so that such restricted messages can be sent from each computer to at least two others and also be received by each computer from at least two others, then that addition must be from
(A) S to R
(B) T to R
(C) T to U
(D) U to R
(E) U to S
