Toggle navigation
Home
Study Room
AP Eamcet Engineering Online Mock Exams
AP Eamcet Medical Online Mock Exams
Exams
Features
Pricing
Login
Register
Study Room
Study Room
Arithmetic Ability
Lessons
Alligation or Mixture
Area
Average
Banker's Discount
Boats and Streams
Calendar
Chain Rule
Clocks
Compound Interest
Decimal Fractions
HCF and LCM
Height and Distance
Logarithms
Numbers
Odd Man Out and Series
Partnership
Percentage
Permutations and Combinations
Pipes and Cistern
Probability
Problems on Ages
Problems on Numbers
Problems on Trains
Profit and Loss
Races and Games
Ratio and Proportion
Simple Interest
Simplification
Square Roots and Cube Roots
Stocks and Shares
Time and Distance
Time and Work
True Discount
Volume and Surface Area
Goto
Arithmetic Ability
Time and Distance
Take Exam
01
02
03
04
05
06
07
08
09
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
Previous
73 / 86
Next
Q.
Amy has to visit towns B and C in any order. The roads connecting these towns with her home are shown on the diagram. How many different routes can she take starting from A and returning to A, going through both B and C (but not more than once through each) and not travelling any road twice on the same trip?
A.
10
B.
8
C.
6
D.
4
View Answer
Correct choice: B
Explanation:
Amy can travel clockwise or anticlockwise on the diagram. Clockwise, she has no choice of route from A to B, a choice of one out of two routes from B to C, and a choice of one out of two routes from C back to A. This gives four possible routes. Similarly, anticlockwise she has four different routes. Total routes = 8
Previous
73 / 86
Next