Sign in
Please select an account to continue using cracku.in
↓ →
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?
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:
Book Free CAT Mentorship
Get personalized CAT strategy from a 99%iler
500+ students mentored
OTP Verification
Enter the 6-digit code sent to your phone
Booking Summary
Enter OTP
Didn't receive the OTP?
Start your IIM journey with the right preparation and crack CAT 2026.
Educational materials for CAT preparation