Can you modify the maximum depth for a recursive function in Python? If yes how?

836

What does truncate mean in python?

953

Explain different ways to create an empty numpy array in python?

922

Explain scalar type declarations in php7?

959

How to create Creating a Controller ?

1333

How can you execute php script from the command line?

1012

How to get current route name?

714

Explain what is the difference between text files and binary files?

1160

An expression to whose value an operater is applied a) operand b) variable c) constant d) all of the above

1171

In what case you don't see plugin menu?

165

Is php coding easy?

956

What is r vector?

200

Who calls dealloc method?

1

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.

2189

Where can I host my wordpress site?

184