there are N number of matchboxes numbered 1...N.each matchbox contain various number of stick.Two player can alternatevely pick some amount of stick from the higest stick containing box . The player is condidered win if there is no stick after his move.Find the final move so that the move player win. Note:In case the number of stick is equal ,pick the stick from the higest numbered box. eg: 3 box contain stick as:1,1,1. if u take 1 stick from 3rd numbred box you will any how win the match.

2420

---

Are you concerned that older browsers don't support javascript and thus exclude a set of web users? Individual users?

582

---

Sir can u send me few interview questions and answers based on Deputy Superintendent(materials) of APSRTC. I have selected in written.reply to bhanudammoju@gmail.com thank u.

1373

---

Explain how does tuple-oriented relational calculus differ from domain-oriented relational calculus?

705

---

What is mappedby?

165

---

---

Whats is means by pega robotic automation?

186

---

Why is IP called ‘best-effort delivery’ protocol?

2394

---

Write a program to check for a prime number in java?

554

---

What are SAP Business Objects BI 4 reporting tools?

51

---

How many return statement are allowed in a function?

453

---

What is the purpose of a watchdog timer?

443

---

discuss formatting pane in tableau?

176

---

How does MapReduce framework view its input internally?

586

---

A box has 12 red cards and 12 black cards. Another box has 24 red cards and 24 black cards. You want to draw two cards at random from one of the two boxes, which box has a higher probability of getting cards of same colour and why?

360

---

Q.3. One of the serious problems faced by the Public Enterprise Management in our country is that: (a). Very little managerial autonomy. (b). More bureaucratization (c).Excessiveinvestment. (d). Excess of accountability.

1799

---