Network Paths Count
CAT 1991 Slot 1 · Quantitative Ability · Medium · Combinatorics
This is a medium Quantitative Ability question from the CAT 1991 Slot 1 paper. It tests Combinatorics. The full answer key and a step-by-step explanation are below — try it yourself first, then reveal the solution.
What is the total number of ways to reach A to B in the given network?
- Stage 1: Point A connects to 4 nodes in column 1.
- Stage 2: Column 1 (4 nodes) connects straight to Column 2 (2 nodes each group, total 2 paths per node).
- Stage 3: Column 2 connects to Column 3 (2 nodes) with 2 paths.
- Stage 4: Column 3 connects to point B with 1 path.
- A.
12
- B.
16
- C.
20
- D.
22
Answer
B
Explanation
Using path multiplication across stages:
Related Combinatorics questions
- #111Four-digit numbers with mandatory digitsCATQATITAHard
- #892Town Plan Shortest PathsCATQASET · 2QHard
- #949Friends and enemies in pairs set SCATQASET · 2QHard
- #950Total participants in tournament teamsCATQAMCQMedium
- #1028Chess competition games between boys and girlsCATQAMCQEasy
- #1037Sum of units digits in conditional permutationsCATQAMCQHard
- #1097Connecting Towns with Direct Telephone LinesCATQAMCQMedium
- #1286Distribution of balloons, pencils, and erasersCATQATITAMedium
Practise this under exam conditions
Sign in to solve it with a live timer, the on-screen CAT calculator, and streak and accuracy tracking across every question you attempt.
Solve in the workspace