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

Serco General Knowledge_Current Affairs Interview Questions
Questions Answers Views Company eMail

Which of the following is considered as the ?Electronic City? of India? (a) Hyderabad (b) Bangalore (c) Kolkata (d) Mumbai

3 7717

Post New Serco General Knowledge_Current Affairs Interview Questions




Un-Answered Questions

What is the process to use classic link?

77


What are the different types of recording available in uipath

181


What is Apache Avro?

44


Explain routeprovider in angularjs?

480


What is encapsulation in object-oriented programming(oop)?

1






What is Typecasting ?

1183


List the functions of Spark SQL?

377


Explain javascript debounce function?

542


what's the formula for calculate pcc for matt(45mm aggregate)?

2151


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


Is linux free of cost?

589


What do you understand by database migrations in laravel? How can we use it?

391


Explain when do we analyze the tables? How do we do it?

603


How do I make my word document bigger on screen?

349


What is worker node in Apache Spark cluster?

205