csat-suneung 2013 Q5

csat-suneung · South-Korea · csat__math-science 3 marks Combinations & Selection Lattice Path Counting

As shown in the figure, there is a road network connected in a diamond shape. Starting from point A and traveling the shortest distance to point B without passing through point C or point D, how many ways are there? [3 points]
(1) 26
(2) 24
(3) 22
(4) 20
(5) 18

As shown in the figure, there is a road network connected in a diamond shape. Starting from point A and traveling the shortest distance to point B without passing through point C or point D, how many ways are there? [3 points]\\
(1) 26\\
(2) 24\\
(3) 22\\
(4) 20\\
(5) 18

Paper Questions

Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8 Q9 Q10 Q11 Q12 Q13 Q14 Q15 Q16 Q17 Q18 Q19 Q20 Q21 Q22 Q23 Q24 Q25 Q26 Q27 Q28 Q29 Q30