TCS Company

Alok and Bhanu play the following min-max game.Given the expression

N=26+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 and 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

a)-55
b)107
c)44
d)26

Read Solution (Total 8)

TCS Other Question

30 teams enter a hockey tournament.A team is out of the tournament if it loses 2 games. What is the maximum number of games to be played to decide one winner?
a) 61
b) 59
c) 30
d) 60
A lady has fine gloves and hats in her closet- 18 blue, 32 red, and 25 yellow. The lights are out and it is totally dark. In spite of the darkness, she can make out the difference between a hat and a glove. She takes out an item out of the closet only if she is sure that it is a glove. How many gloves must she take out to make sure she has a pair of each color?
a) 50
b) 8
c) 60
d) 42