Instructions

There are 5 cities, A, B, C, D and E connected by 7 roads as shown in the figure below:

Design a route such that you start from any city of your choice and walk on each of the 7 roads once and only once, not necessarily returning to the city from which you started.

Question 46

How many different starting cities are possible such that the above restriction is satisfied?

Solution

We can start from either city C or D.

C - A - B - D - C - B - E - D

D - B - A - C - B - E - D - C

We cannot start from any other city.

Create a FREE account and get:

All Quant CAT complete Formulas and shortcuts PDF
35+ CAT previous papers with video solutions PDF
5000+ Topic-wise Previous year CAT Solved Questions for Free

CAT Quant Questions | CAT Quantitative Ability

CAT Quadratic Equations Questions CAT Inequalities Questions CAT Averages Questions CAT Linear Equations Questions CAT Percentages Questions

CAT DILR Questions | LRDI Questions For CAT

CAT Quant Based DI Questions CAT Table with Missing values Questions CAT Selection With Condition Questions CAT Charts Questions CAT Routes And Networks Questions

CAT Verbal Ability Questions | VARC Questions For CAT

CAT Reading Comprehension Questions CAT Verbal Ability Questions CAT Critical Reasoning Questions CAT Odd One Out Questions CAT Vocabulary Questions

CAT 1990 QA Question

How many different starting cities are possible such that the above restriction is satisfied?

CAT Quant Questions | CAT Quantitative Ability

CAT DILR Questions | LRDI Questions For CAT

CAT Verbal Ability Questions | VARC Questions For CAT

Free Quant Questions

Login to your Cracku account

Hello! 👋

Ready to Unlock Your Success?

Please Enter Your OTP

Please enter the following details

Create a free Cracku account