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.
No Answer is Posted For this Question
Be the First to Post Answer
In C language what is a 'dangling pointer'?
Explain can static variables be declared in a header file?
write a c programme for add of two numbers with out use of arthematic operators
Why is main function so important?
Describe newline escape sequence with a sample program?
Given a number N, product(N) is the product of the digits of N. We can then form a sequence N, product(N), product(product(N))… For example, using 99, we get the sequence 99, 99 = 81, 81 = 8. Input Format: A single integer N Output Format: A single integer which is the number of steps after which a single digit number occurs in the sequence. Sample Test Cases: Input #00: 99 Output #00: 2 Explanation: Step - 1 : 9 * 9 = 81 Step - 2 : 8 * 1 = 8 There are 2 steps to get to this single digit number. Input #01: 1137638147
What is the code for 3 questions and answer check in VisualBasic.Net?
what are the program that using a two dimensional array that list the odd numbers and even numbers separately in a given 10 inputs values
0 Answers College School Exams Tests,
any function have arguments one or more OR not . it is compulsary a) any function compulsary have one or more arguments b) any function did not have arguments. It is not compulsary c) it is optional it is not compulsary d) none of the above
Is c still used in 2019?
Write a program to generate random numbers in c?
What is indirect recursion? give an example?