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.

1562

---

can oracle driver be directly connected with odbc driver??

1269

---

What is medium term scheduling in operating system (os)?

607

---

Explain how to achieve polymorphism in vb.net?

541

---

Does sap transportation management come bundled with geographical information systems (gis) capabilities? : transportation management

590

---

---

What is the use of object relational mapping?

409

---

What is the use of dual table in mysql?

509

---

What are the new features added to JDBC 4.0?

529

---

How do you define universe parameters? : sap bobi

466

---

Where do we specify the buyer seller relationship?

414

---

please send me database stored procedure checklist.

2424

---

What is ipc 610 620?

664

---

What is a lvalue

647

---

What are the features of hibernate?

143

---

Explain what are the authentication modes in sql server?

493

---