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

NEA Interview Questions
Questions Answers Views Company eMail

what is the difference between forebay and surgetank in case of hydro electric power plant

2 23923

where can the transformer having vector group Yny0 be used??

3584

Post New NEA Interview Questions




Un-Answered Questions

Planning is looking ahead and control is looking back command

1221


2. What happened when BO object has been called?

1525


If there are 3 modules what would be test for that three modules but that 3 modules are not developed or what are the test case for that 3 modules

1092


Any scope of improvement that you see in yourself and how are you going about it?

719


What is skew data in hive?

428






Why dictionary is used in c#?

542


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.

1730


Why are pointers used?

575


Does Kotlin programming allow macros?

234


Is json rest or soap?

1


How do you add solver to excel?

315


What statement is used in python if the statement is required syntactically but no action is required for the program?

448


What are the 3 arguments of the if function?

327


how to measure the current by compact digital equipment with dislay which fit inside any equipment

1462


Comparison between Secondary NameNode and Checkpoint Node in Hadoop?

270