        ! 51      B.G.Prasanthi 1 , Dr.T.Bhaskara Reddy 2. 1 Department of Computer Science, S.K.University,Anantapur nitai2009@gmail.com 2 Department of Computer Science, S.K.University,Anantapur bhaskareddy_sku@yahoo.co.in ABSTRACT This algorithm describes technique to generate and manage unique integer indexes from a specified range of integers. Generated index can be used in any application where a unique integer from a specified range need to be served as key to a particular record and when record is freed index need to be reused. Efficiency of this algorithm lies in its simplicity and capability to manage large range of index in minimal recourses, such as running time and memory requirement. This Algorithm is best suited for problems where 0 or 1-based unique indexes (however non 0 or 1 based indexes can also be managed with calculating a fix offset) are required to be managed with frequent operation like checking whether a index is free or not, finding first free index, reserving and freeing indexes with optimal memory usage in average case. One of the application but not limited to, is index generation for MIB tables where a unique index need to be used with a conceptual row for creation/retrieval/destroy operations. KEYWORDS Index generation, MIB, Chunk , Arbitrary Index, Reserve index, Bit state memory. 1. ALGORITHM Algorithm works on bit state (0 or 1), one of the states is used to indicate free or used index in the memory. Thus 1 bit memory is required to represent one integer index, and state of this bit can be used to determine whether index is free or occupied. For example to generate 512 integer indexes we need 512 bit memory that is 64 Byte. In addition to this we also need few more byte to make searching of the indexes faster and efficient to use.