* (no subject)
@ 2021-09-02 6:22 4AI19CS069 Nithyanjali H Gowda
0 siblings, 0 replies; only message in thread
From: 4AI19CS069 Nithyanjali H Gowda @ 2021-09-02 6:22 UTC (permalink / raw)
To: gcc-help
An e-commerce company's warehouse has N number of storage cells. Each cell
is uniquely recognized by a numeric value, known as the identification
number (10), labeled 0 to N-1. These storage cells store items where each
item is uniquely identified by their item ID. These items are stored
sequentially in the storage cell and one item can be stored in one cell
only. The warehouse system has all the data related to these cells. The
company has a new item of stock for storage where X represents the item ID.
The company wishes to know whether item X is available in the warehouse or
not. If available, the system must return the ID of the cell where this
item is stored. If X is not available, the system must return the 10 of the
cell where the item would be stored. the call for item X. write an
algorithm to return the cell for item Xwrite an algorithm to return the
cell for item X
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~2021-09-02 6:23 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2021-09-02 6:22 4AI19CS069 Nithyanjali H Gowda
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for read-only IMAP folder(s) and NNTP newsgroup(s).