A, B and C are three places such that there are three different roads from A to B, four different roads from B to C and three different roads from A to C. In how many different ways can one travel from A to C using these roads?

To solve this, we just need to list the distinct ways to get from A to C. We can see there are two separate types of journeys available:\n\n**Case 1: The Direct Route**\n- The question says there are **3** different roads directly from A to C.\n\n**Case 2: The Indirect Route (via B)**\n- Here, we have a sequence of steps: First go A to B, *AND* then go B to C.\n- As seen in the 2014 PYQ analysis, when steps are sequential ('AND'), we multiply the possibilities [1], [33].\n- Ways to go A to B = 3.\n- Ways to go B to C = 4.\n- Total ways via B = 3 x 4 = **12**.\n\n**Final Calculation:**\n- A traveler can choose Case 1 *OR* Case 2. In logic, 'OR' means we add the possibilities [14], [15].\n- Total Ways = (Direct Ways) + (Indirect Ways)\n- Total Ways = 3 + 12 = 15.