What is a route in network problems?

A specific path from a start node to an end node traveling along available links.

True or False: Simple multiplication works when networks have cycles or backward movement.

False. Simple multiplication only works when movement is strictly forward with no cycles.

Which method efficiently counts routes in networks?
A) Random counting
B) Stage-based method
C) Reverse counting
D) Circle method

B) Stage-based method

Why do we group symmetrical nodes together in route counting?

They have identical onward choices, so we can count once and multiply by node number.

What is the flow rule for network problems?

Total inflow equals total outflow plus demand at that location.

True or False: Pipeline capacity problems require satisfying demand at each location exactly.

True. Demands at all locations must be exactly met in flow problems.

A network has stages 0→1→2→3 with choices 2×3×1. Total routes = _____

6 routes (2 × 3 × 1)

What happens when nodes in a stage behave differently?
A) Ignore differences
B) Split into cases
C) Use averages
D) Skip the stage

B) Split into cases

In asymmetrical networks, how do we handle different node behaviors?

Handle asymmetrical nodes separately and add their counts to symmetrical group counts.

If a pipeline has capacity 1000 and flow 700, free capacity = _____

300 units

True or False: Multiple processions can use the same street on the same day.

False. Policy doesn't allow more than one procession per street per day.

Which constraint makes route scheduling complex?
A) Time limits
B) Street sharing restrictions
C) Weather conditions
D) Traffic signals

B) Street sharing restrictions

When counting routes with blocked links, we use _____ method.

Case-by-case analysis

What determines if two routes are structurally different?

They follow different sequences of stage transitions between start and end nodes.

If Stage 1 has 3 symmetrical nodes, Stage 2 has 2 choices each, routes = _____

6 routes (3 × 2)

True or False: Route counting is often the first step before applying additional constraints.

True. It's typically followed by time, capacity, or cost constraints.

A network problem involves scheduling 5 processions over 2 days with street conflicts. This requires _____ analysis.

Constraint satisfaction

What makes a network problem suitable for competitive exams?
A) Complex diagrams
B) Clean structure, limited nodes
C) Many variables
D) Unclear constraints

B) Clean structure, limited nodes