Common Information
1200 vehicles travel every day from Point $A$ to Point $Z$ on a network of oneway roads as shown in the diagram below.
Points $B$, $C$, $M$, $D$ and $E$ are junctions in this network. The number adjacent to the ray depicting each road stands for the cost (in rupees) of travelling on that road. Each vehicle takes the path of least cost from $A$ to $Z$.
If two or more paths have the same cost, then the vehicles are distributed equally on those paths.
Q1. 
Common Information Question: 1/4 What is the cost (in rupees) of the journey for each of the first 600 vehicles which travel from $A$ to $Z$ every day? 
A.  8 

B.  9 

C.  10 

D.  11 

E.  12 
Q4. 
Common Information Question: 4/4 If the costs of travel on the roads $M – Z$ and $D – E$ have to be changed such that 800 vehicles reach E every day, what should be the new costs (in rupees) for these two roads? 
A.  4 and 5 

B.  2 and 6 

C.  6 and 3 

D.  5 and 4 

E.  6 and 2 
Common Information
Two days (Thursday and Friday) are left for campaigning before a major election, and the city administration has received requests from five political parties for taking out their processions along the following routes.
Table below can be scrolled horizontally
Congress:  ACDE 

BJP:  ABDE 
SP:  ABCE 
BSP:  BCE 
CPM:  ACD 
Street BD cannot be used for a political procession on Thursday due to a religious procession. The district administration has a policy of not allowing more than one procession to pass along the same street on the same day. However, the administration must allow all parties to take out their procession during these two days.
Q5. 
Common Information Question: 1/2 Congress procession can be allowed: 
A.  Only on Thursday 

B.  Only on Friday 

C.  On either day 

D.  Only if the religious procession is cancelled 