Question 19

What is the total number of ways to reach A to B in the network given, such that no node is included twice and one can only move from left to right?

Solution

4 first level nodes are connected to A => 4 ways.

Each of these first level nodes are connected to 1 second level node by four connections => 4 ways

Each of these second level nodes are connected to 2 third level nodes => 2 ways.

Each of these third level nodes are connected to B by 1 route => 1 way

=> 4 * 4 * 2 * 1 = 32 ways.


Create a FREE account and get:

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

cracku

Boost your Prep!

Download App