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 19003Post New Goldman Sachs General Aptitude Interview Questions
How many types of object repository in qtp?
Does partitioning help performance?
Which stone is best for wall construction Laterite Stone or Cement Blocks
what are the qualities u have which are totally different form others and we havent judge before?
What is the minimum number of partitions that you need to install linux?
What is lvm in ubuntu?
How is react.js different from other javascript frameworks?
Enlist the media types CSS allows?
What is PL/I?
Why do while loop is used?
What versions of sap tao you have used?
can any one tell difference between 802D and 810D???
What is the shortcut key of powerpoint?
List out some of the JQuery function used for webpage designing?
Explain system bootup in unix.