Logical Reasoning – Networks & Cubes

Directions for questions 1 - 4: Based on information given below answer the following questions.

Nine buildings in a city's downtown area are connected by a series of overhead walkways. The city engineer's map of
the city identifies the buildings simply with the letters R, S, T, U, V, W, X, Y, and Z. Anyone visiting these buildings must
begin the visit at Building R. From there, the other buildings may be visited via a series of overhead walkways,
connecting the buildings as follows:
 Walkways connect Building R to Buildings S, T, and W.
 A walkway connects Building S to Building U.
 Walkways connect Buildings S and T to Building X.
 Building W is connected to Buildings T, V, and Z.
 Building X is connected to Building Z.
 Buildings X and Z are connected to Building Y.

1. Without visiting any building more than once, what is the maximum no. of buildings a person can visit?
a) 4 b) 5 c) 8 d) 7

2. If a visitor must travel from Building R to Building Y by crossing the fewest number of walkways, which of the
following statements must be true?
a) The visitor may visit Building U or Building V, but not both.
b) The visitor will not visit Building Z.
c) If the visitor goes to Building T, he or she must then go to Building W
d) If the visitor goes to Building W, he or she must then go to Building Z

3. If a visitor wants to travel to both Building U and Building V, which of the following must be false?
a) The visitor will go to every building except Building T.
b) The visitor will go to Building S only once.
c) The visitor will visit no building more than once.
d) The visitor will not visit Building Y.

4. If a new walkway is built connecting Building V to Building Z, then which of the following could be true?
a) A visitor may visit all the buildings without visiting any building more than once.
b) The shortest path from Building R to Building Y includes Building V.
c) A visitor may visit Building V immediately after Building T.
d) A visitor may visit Buildings S, T, and W in that order.

CUBIX Educational Institute Pvt. Ltd. Data Interpretation Networks & Cubes
Directions for Questions 5 to 8: Read the following paragraph and answer the questions that follow.

A third world undeveloped country with no telephone system wants to develop one and decides to start by connecting all
its major cities at the minimum possible cost. To build such a network we don’t have to have direct lines between every pair
of cities but each of the cities must be connected to some other city. The costs of setting up the network between each pair
of the city it given below:
175
1 2

300
400 500

450
275
5 3
325
295
150
250
4

5. What is the most economical cost of setting up the network?

a) 1075 b) 870 c) 475 d) 850

6. Which would be the least cost path?

a) 1 2 b) 1 2

3 3
5 4 5 4

c) 1 2 d) 1 2

3 3

5 4 5 4

7. What would be the most economical cost if the cost of connecting cities 2 & 4 changes to 225?
a) 870 b) 800 c) 475 d) 1075

8. Which would be the least cost path after the change?

a) 1 2 b) 1 2
3 3
5 4 5 4

c) 1 2 d) None of these
3
5 4

CUBIX Educational Institute Pvt. Ltd. Data Interpretation Networks & Cubes
Direction for questions 9 to 13: Based on information given below to answer the following questions.
The diagram below depicts the network of pipelines carrying oil for distribution among ten towns A to J. The value
given next to the towns represents the consumption of oil (in ‘000 litres) for that town. The maximum capacity of all
the pipelines shown is 100,000 Litres. The oil flows in the direction pointed by arrows. The slack in any pipeline is the
extra oil that can flow through it to utilise the optimum capacity. No town uses more than the required amount,
neither can it survive in anything less.
50 30
B H
20
30 E
A

C 20 F 10 J 80

D I
60 G 50
30
The file containing all the information regarding the pipelines was lost due to negligence. With the help of certain
efficient people knowing their work well, the following information was retrieved.

Pipeline Slack Oil flow, In ‘000 litres

BE 30
AC 20
AD 10
GI 40
CG 90
EF 80
FH 10

9. How much oil is flowing in pipeline connecting C to E (in ’000 litres)

a) 90 b) 10 c) 50 d) 30

10. If oil flowing through pipe line connecting A and E is 30,000 L, what is the flow of oil from F to I (in ‘000 L)?
a) 40 b) 30 c) 70 d) can’t be determined.

11. What is the difference (in L) between the slack in pipeline from A to G and the flow of oil in the pipeline between I
to J (use data from previous question)
a) 40000 b) 0 c) 30000 d) 20000

12. If the pipeline to A has an optimum capacity of 500,000 litres, then what is the slack at which it would be flowing
(in ‘000 litres)?
a) 120 b) 160 c) 200 d) can’t be determined

13. What could be the maximum flow in the pipeline from A to G (in ‘000 L) if the maximum capacity of each pipeline
is increased to 150000 L?
a) 110 b) 120 c) 90 d) 100

CUBIX Educational Institute Pvt. Ltd. Data Interpretation Networks & Cubes
Directions for questions 14 – 20: The following questions are based on cubes and solid figures. Answer the questions
independent of each other.

14. What is the maximum no. of pieces that can be made of a cube using 12 cuts?
a) 125 b) 64 c) 27 d) 100

15. What is the maximum no. of pieces that can be made of a cube using 11 cuts?
a) 48 b) 100 c) 45 d) 96

16. What is the minimum no. of cuts required to cut a cube in 64 pieces?
a) 10 b) 15 c) 9 d) 12

17. What is the minimum no. of cuts required to cut a cube in 90 pieces?
a) 10 b) 13 c) 14 d) 11

18. A cube is cut in maximum pieces using 12 cuts. What is the percentage increase in surface area as a result?
a) 400% b) 200% c) 100% d) 50%

19. A solid figure is bounded by straight lines. It has 12 faces & 15 vertices. How many edges does it have?
a) 23 b) 25 c) 27 d) 29

20. In how many ways can you paint a cube using only 2 colors (you need not necessarily use both colors)?
a) 8 b) 15 c) 10 d) 12

Directions for questions 21 – 24: Refer to the information given below to answer the questions that follow.
A cube is painted green on all faces. It is now cut with 5 cuts each along each direction to get 216 small cubes.

21. How many cubes have no color?

a) 64 b) 50 c) 60 d) 125

22. How many cubes have only one face colored?

a) 80 b) 96 c) 150 d) 120

23. How many cubes have 2 faces colored?

a) 18 b) 50 c) 48 d) 60

24. How many cubes have 3 faces colored?

a) 6 b) 4 c) 10 d) 8

Directions for questions 25 – 26: Refer to the information given below to answer the questions that follow.
A cube is painted green on opposite faces, red on opposite faces and yellow on opposite faces. It is now cut with 4
cuts each along each direction to get 125 small cubes.

25. How many cubes have only one color?

a) 80 b) 54 c) 150 d) 120

26. How many cubes have 2 colors?

a) 18 b) 50 c) 36 d) 60

Directions for questions 27 – 29: Refer to the information given below to answer the questions that follow.

CUBIX Educational Institute Pvt. Ltd. Data Interpretation Networks & Cubes
A cube is painted green on adjacent faces, red on adjacent faces and yellow on adjacent faces. It is now cut with 4
cuts each along each direction to get 125 small cubes.

27. How many cubes have only one color?

a) 84 b) 63 c) 100 d) 90

28. How many cubes have 2 colors?

a) 24 b) 45 c) 33 d) 56

29. How many cubes have 3 colors?

a) 6 b) 8 c) 4 d) 2

CUBIX Educational Institute Pvt. Ltd. Data Interpretation Networks & Cubes