send mail to support@abhimanu.com mentioning your email id and mobileno registered with us! if details not recieved
Resend Opt after 60 Sec.
By Loging in you agree to Terms of Services and Privacy Policy
Claim your free MCQ
Please specify
Sorry for the inconvenience but we’re performing some maintenance at the moment. Website can be slow during this phase..
Please verify your mobile number
Login not allowed, Please logout from existing browser
Please update your name
Subscribe to Notifications
Stay updated with the latest Current affairs and other important updates regarding video Lectures, Test Schedules, live sessions etc..
Your Free user account at abhipedia has been created.
Remember, success is a journey, not a destination. Stay motivated and keep moving forward!
Refer & Earn
Enquire Now
My Abhipedia Earning
Kindly Login to view your earning
Support
Type your modal answer and submitt for approval
Four cities A, B, C & D are connected by a road network as shown in the figure. In how many ways can you start from any city on the vertex of the triangle and come back to it without traveling on the same road more than once?
8
12
16
None of the above
Number of options for the first city visited = 3. (A, D or C). Number of options for the second city visited = 2. (Either of the 2 cities not yet visited.) Number of ways to return to B = 2. (Either directly back to B or to the one city not yet visited and then directly back to B.) To combine these options, we multiply: 3*2*2 = 12.
Hence, option 2 is the correct answer.
By: Amit Kumar ProfileResourcesReport error
Access to prime resources
New Courses