Alok and Bhanu play the following min-max game. Given the expression N=40+X+Y-Z, where X, Y and Z are variables representing single digits (0 to 9), Alok would like to maximize N while Bhanu would like to minimize it. Towards this end, Alok chooses a single digit number and Bhanu substitutes this for a variable of her choice (X, Y or Z). Alok then chooses the next value and Bhanu, the variable to substitute the value. Finally Alok proposes the value for the remaining variable. Assuming both play to their optimal strategies, the value of N at the end of the game would be
7 18574Post New Goldman Sachs General Aptitude Interview Questions
what is story board in silverlight?
In which scenario Hive is good fit?
Infinite loops often arise in embedded systems. How does you code an infinite loop in c?
What are elliptic curves ?
List out some of the examples for liability accounts?
What is the use of updatepanel?
Where can I find bash in linux?
Write a program to insert an element and in the specific position in the array?
Which event do you use to check whether the pivot table is modified or not?
What is http tunneling? How can we configure it on weblogic?
What is the bootstrapping in AngularJS?
Where to create knowledge objects, dashboards, and reports?
Why do we need HTML 5 server-sent events?
What is a clr (common language runtime)?
Does diesel engine have spark plug?