54 Comments Alok and Bhanu play the following min-max game. Given the expression N = 38 + 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?

1247

---

What are the different government policies towards unemployment?

147

---

Explain me scenario in which only ondestroy is called for an activity without onpause() and onstop()?

55

---

What is use of count() function in php?

91

---

An automated bank teller system?

640

---

---

How will you prepare traceability matrix if there is no Business Doc and Functional Doc?

1227

---

difference between Clustered index and non clustered index ?

125

---

Described the different storage methods in android?

60

---

all clients are using at once if any problem raise?

1371

---

Give me the calculation steps to design an electromagnet to be work in 230V 50 Hz AC Supply. Also give force that is created by that electromagnet when it gets energized.

1316

---

How hashset works internally in java?

84

---

what things abutsbi

1049

---

What is a monad in scala? Explain

1

---

How to connect xml with the database?

81

---

Which cloud technology is best?

1

---