0 votes 0 votes The figure below shows the network connecting cities A, B, C, D, E and F. The arrows indicate permissible direction of travel. What is the number of distinct paths from A to F? $9$ $10$ $11$ None of these Quantitative Aptitude cat2001 quantitative-aptitude graphs + – go_editor asked Apr 1, 2016 • edited Sep 28, 2023 by makhdoom ghaya go_editor 13.8k points 2.1k views answer comment Share See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes (E) = 1 (C) = (E) + 1 = 2 (D) = (C) + (E) = 3 (B) = 1 + (C) + (D) + (E) = 7 (A) = (B) + (D) = 10. Arjun answered Apr 17, 2016 • selected Apr 17, 2016 by srestha Arjun 8.6k points comment Share See 1 comment See all 1 1 comment reply srestha 5.2k points commented Apr 17, 2016 reply Share yes. good one :) 1 votes 1 votes Please log in or register to add a comment.
1 votes 1 votes Answer 10 srestha answered Apr 1, 2016 srestha 5.2k points comment Share See all 3 Comments See all 3 3 Comments reply Arjun 8.6k points commented Apr 3, 2016 reply Share how? 0 votes 0 votes srestha 5.2k points commented Apr 16, 2016 reply Share just counted number of directed path, nothing special :) 1 votes 1 votes Arjun 8.6k points commented Apr 17, 2016 reply Share okay :) but can be solved using dynamic programming :) 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes The number of distinct paths from $A\rightarrow F$ is : $ABF$ $ABCF$ $ABCEF$ $ABEF$ $ABDEF$ $ABDCF$ $ABDCEF$ $ADCF$ $ADCEF$ $ADEF$ Option (B) is correct. Hira Thakur answered Apr 22, 2023 Hira Thakur 7.1k points comment Share See all 0 reply Please log in or register to add a comment.