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

6)how do you determine texts?

4017

You are the project manager working on a research project for a new drug treatment. Your preliminary project schedule runs past the due date for a federal grant application. The manager of the R&D department has agreed to release two resources to work on your project in order to meet the federal grant application date. This is an example of: A. Crashing B. Fast trucking C. Resource leveling D. Adjusting the resource calendar

653

Have you done Migration? How to build in PeopleSoft ? Why build from Oracle?

941

What is the limitation of cin while taking input for character array?

1442

How to create facelets templates?

74

Explain what are the types of hooks in wordpress and mention their functions?

124

What are c# attributes and its significance?

516

Please explain compound trigger in oracle?

592

What are all the newly added frameworks iOS 4.3 to iOS 5.0?

434

What are the different types of php variables?

533

What are ip classes and how can you identify the ip class of given a ip address?

183

What we should must perform to upgrade windows xp to windows 7?

449

What is a singleton pattern and where we can find it in angular?

443

Explain about sybase 365?

483