Company Name Starts with ...
#  A  B  C  D  E   F  G  H  I  J   K  L  M  N  O   P  Q  R  S  T   U  V  W  X  Y  Z

Hexaware Interview Questions
Questions Answers Views Company eMail

How do you implement one-to-one, one-to-many and many-to- many relationships while designing tables?

1 9152

who is the founder of c++?

15 34187

Where do you see yourself five years from now?

5 6519

Tell us about yourself.

47 113329

Hexaware Pattern, Group Discussion.

5 25940

What is INSTEAD OF trigger ?

13 57660

what are the main customizations in sqr in people soft hrms module ?

2750

What are release notes and what it contents?

2 5004

TCS Freshers Online CAmpus Selection Procedure Apr 2 2007

2 15985

3 persons started placementpapers with a capital of Rs.3000 . B invest Rs.600 less than A, C invest Rs.300 less than B. Then what is the share amount of B in a profit of Rs.886 ?

11 19716

What is the first action to perform a query? Suppose I have four tables and five joins and my query is getting slow day by day.

4 10722

TCS Interview with JNTU Kakinada

3 26839

Hi Giving the good example for High priority with low severioty bug examle?

10 19184

what is diffrerence between build and version

4 10439

who will prepare Functional requirements specification(FRS)

10 30530

Post New Hexaware Interview Questions


Hexaware Interview Questions


Un-Answered Questions

How do you combine formulas in excel?

279


What is difference between investment order, internal order and accrual orders? : cost center accounting

572


How to initiate variable in angularjs?

433


What are the sources generating big data?

264


What is ip multicast?

669






Implement two stacks using a single array.

564


At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with these names could be kept in that shelf as in this example: bottom of shelf ---> [AAAJKRDFDEWAAYFYYKK]-----Top of shelf. All these packets are to be loaded on cars. The cars are lined in order, so that the packet could be loaded on them. The cars are also named [A, B, C, D, E,………….]. Each Car will load the packet with the same alphabet. So, for example, car ‘A’ will load all the packets with name ‘A’. Each particular car will come at the loading point only once. The cars will come at the loading point in alphabetical order. So, car ‘B’ will come and take all the packets with name ‘B’ from the shelf, then car ‘C’ will come. No matter how deep in the shelf any packet ‘B’ is, all of the ‘B’ packets will be displaced before the ‘C’ car arrives. For that purpose, some additional shelves are provided. The packets which are after the packet B, are kept in those shelves. Any one of these shelves contains only packets, having the same name. For example, if any particular shelf is used and if a packet with name X is in it, then only the packets having names X will be kept in it. That shelf will look like [XXXXXXX]. If any shelf is used once, then it could be used again only if it is vacant. Packets from the initial shelf could be unloaded from top only. Write a program that finds the minimum total number of shelves, including the initial one required for this loading process.

1725


How do you incorporate current design trends in your work?

484


what is multitask win95

548


What is ore?

439


How many strategies are there? : sap bobi

536


How do I install joomla on windows 10?

69


To delete a branch what is the command that is used?

5


What is named native query in hibernate?

168


What is jsp api?

476