Friday, October 22, 2010
Bihar elections: Changing paradigms of a failed state
Laloo Prasad Yadav was the first person to realize this. His social engineering found a large audience in the form of poor, underprivileged people in rural sections of Bihar. Development went for a toss and casteist politics became the call of the day. He (mis)ruled the state first himself, and then with a proxy from 1997 till 2005, when JD(U) with the support of BJP first ousted him from the power.
Once a best governed state during independence, Bihar turned into a mess which no one cared to clear. The first winds of change was seen in 2005, when JD(U)-BJP combine won fair number of seats in Assembly and laid claims for forming a coalition government in Patna. With Ram Vilas Paswan playing a "king-maker" role, Laloo was almost certain to be ousted from power. That was when, once a strong ally, and then a power in Center, the great Congress Party came for his help. Congress agent and Bihar Governor, Mr Buta Singh dissolved the assembly and thwarted NDA, which was almost certain to form government in Bihar. President rule was imposed on Bihar and re-election was scheduled for October-November. People of Bihar, sensing the foul play, gave NDA complete majority this time to lay claims for power and Nitish Kumar became the Chief minister.
This was the turn around moment for many's fortunes.
Nitish Kumar, because he got a chance to undo whatever bad was done during Laloo-Rabri-Congress regime. With the extensive work done on improving infrastructure and law and order in Bihar, he established himself as "Vikas Purush", never before heard in the history of the state. People began to see a light at the end of the long dark tunnel of 15 years misrule by RJD.
Laloo Yadav, because he was relegated in the back seat for the first time in his political career. In subsequent elections his vote bank began to erode, so much so that in 2009 general elections he managed to win only 4 seats out of 40.
Congress, sensing that there is no more steam left in Laloo, started distancing itself from him. In 2010 assembly elections, it for the first time went all alone contesting on all seats on offer in Bihar. If exit polls are anything to go by, it clearly shows that Congress can dent hard the vote bank of RJD-LJP combine. For now, we can wait till November end to see the actual results.
Ram Vilas Paswan, once touted as king-maker, now is nowhere near to his glory days. He too suffered the similar fate as that of his now staunch ally Laloo. His disastrous showing in Lok Sabha elections 2009 was a clear signal that people can't be fool again and again on casteist agendas.
Rabri Devi, a reluctant and least qualified person to ever sit on CM's throne, with due respect, can peacefully go back to her kitchen. Seriously, how can you expect a simple housewife with 5th grade education as her only achievement in life to rule over second most populous state. This was a blasphemy and something for which people of Bihar can never forgive Laloo.
And finally Bihar, which till 2005, a laggard state in every aspect, has begun to show some signs of recovery. With increased investment in infrastructure, greater emphasis on education, vastly improved law and order situation and a visibly better governance, Bihar can look forward to attain its long lost glory.
Development is the new theme on which elections are set to be fought over in Bihar now. May the politics over caste and religion be history now and so may Laloo and Paswan.
Thursday, February 4, 2010
Pokharan test II - Its significance in India's modern history
Pokharan test in 1998 in many ways was a landmark incident in modern Indian history. It was the first time when India openly shrugged off her nuclear non-proliferation and disarmament stance against the powerful international lobby despite the numerous sanction threats. Monday, December 22, 2008
National Highways - India
Thursday, December 18, 2008
Do networks bother you?
In how many ways can you reach the Destination from the Source as shown in the network above?
Pretty easy. Right?
Total of 4 ways. Quite clear from the diagram.
- Start - A - C - D - E - G - Destination
- Start - A - C - D - F - G - Destination
- Start - B - C - D - E - G - Destination
- Start - B - C - D - F - G - Destination
But, what if the diagram is:
or, increasing the complexity a bit further:
Would you still be able to picture out all of the possible paths for the given diagram?
We need utmost care to not possibly miss any of the paths, if we go on counting all of the paths in the network.
For all the nodes we need to fetch the following information:
- Total incoming paths to a Node
And, the steps are:
1. Calculate total incoming paths to any node
2. Outgoing paths will contain a value which is the sum of all the incoming paths
3. So, all subsequent nodes from N can be reached by the sum of the number of all the incoming paths.
4. And, last but the most important point to consider: We’ll always assume that the total number of ways to reach our source node is 1. So, all the outgoing paths from source will start with value 1.
That’s it.
Enough of concepts.
Let’s get down with solving the networks we saw earlier.
Problem 1:
Find the total number of ways to reach Destination from Source.
Total incoming paths to B = 1 (As all the paths emanating from Source contain value 1)
Therefore, Outgoing paths from B = 1
Total incoming paths to E = 1
Therefore, Outgoing paths from E = 1
Total incoming paths to D = 1+1+1 = 3
Therefore, Outgoing paths from D = 3
Total incoming paths to C = 1+3 = 4
Therefore, Outgoing paths from C = 4
Total incoming paths to F = 3+1 = 4
Therefore, Outgoing paths from F = 4
So, Total number of ways to reach Destination = From C + From D + From F = 4+3+4 = 11
So, a total of 11 ways to reach the Destination from Source.
Problem 2:
Find the total number of ways to reach Destination from Source.
Total incoming paths to B = 1
Therefore, Outgoing paths from B = 1
Total incoming paths to G = 1
Therefore, Outgoing paths from G = 1
Total incoming paths to E = 1+1+1 = 3
Therefore, Outgoing paths from E = 3
Total incoming paths to C = 1+3 = 4
Therefore, Outgoing paths from C = 4
Total incoming paths to H = 3+1 = 4
Therefore, Outgoing paths from H = 4
Total incoming paths to F = 4+4+3 = 11
Therefore, Outgoing paths from F = 11
Total incoming paths to D = 4+11 = 15
Therefore, Outgoing paths from D = 15
Total incoming paths to I = 4+11 = 15
Therefore, Outgoing paths from I = 15
So, Total number of ways to reach Destination = From D + From F + From I = 15+11+15 = 41
So, a total of 41 ways to reach the Destination from Source.
Hope, problems from networks don’t become a problem for us in future. :)
Cheers.














