SAT考试数学高频题型单项练习题4

>>2019年SAT考试：SAT考试数学高频题型单项练习题4

>>SATVIP精品直通课程

1. 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

E. 2

9.Correct Answer: 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

以上就是考试高频题型了，大家可要勤加练习哦，如果这一篇不够，在坦途网SAT考试频道还有很多相关内容和SAT考试技巧，小编相信我们整理的内容都会对大家有帮助，如果大家认为这个网站对你有帮助，也可以分享给其他小伙伴哦！小编也会不断的更新更多的内容给大家，希望能帮助大家能考出自己理想的成绩！