Please use this identifier to cite or link to this item: http://hdl.handle.net/11718/1135
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAnkolekar, Suresh-
dc.contributor.authorDasGupta, Arindam-
dc.contributor.authorSrinivasan, G.-
dc.date.accessioned2010-03-14T09:12:10Z-
dc.date.available2010-03-14T09:12:10Z-
dc.date.copyright1985-08-
dc.date.issued2010-03-14T09:12:10Z-
dc.identifier.urihttp://hdl.handle.net/11718/1135-
dc.description.abstractThe defective coin problem involves identification of defective coin, if any, and ascertain the nature of t defect (heavier/lighter) from a set of coins containing at the most one defective coin, using an equal-ar -balance. The solution strategy to minimise number of weightings required to detect the defective coin is based on problem reduction approach involving successive decomposition of the problem into subproblems until it is trivially solved. One of the two types of subproblems is visualised as combination of pair of antithetic problems, leading to an optimal solution procedures which is simply a term by term merger of corresponding antithetic procedures. Also, the algorithm is capable of generating all possible optimal solutions.en
dc.language.isoenen
dc.relation.ispartofseriesWP;1985/576-
dc.subjectCoinsen
dc.subjectAlgorithmen
dc.subjectAnalysisen
dc.titleDefective coin problem: an algorithmic analysisen
dc.typeWorking Paperen
Appears in Collections:Working Papers

Files in This Item:
File Description SizeFormat 
WP 1985_576.pdf458.75 kBAdobe PDFView/Open


Items in IIMA Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated.