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

HCL Delphi Interview Questions
Questions Answers Views Company eMail

How to Display a file's associated icon?

1527

what is SQL Parameter binding?

1524

Post New HCL Delphi Interview Questions


HCL Delphi Interview Questions


Un-Answered Questions

Is primary key a clustered index?

526


How would you best describe iot? Why has it gained so much buzz in recent years?

1


What is ctrl w?

320


How to make a helper file in laravel?

390


What does div stands for?

274






Explain the client concept of sap.

573


Which is faster ado.net or linq?

509


How do you explain independent and dependent variables?

487


What are dispatcher servlet and context loader listener?

139


What is batch in machine learning?

51


What is cls, cts and clr in net?

476


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 you know that a test case is a regression test case

3047


How to shut off message alerts in ios?

473


What does 'indemnity' term means? : insurance sales

338