Abstract
List accessing problem is associated with the searching and sorting of unordered records arranged linearly. Many approaches are followed and invented since more than four decades such as self-organizing linear lists in order to obtain a minimal cost for accessing the list. This paper introduces a hybrid method that is the combination of Move to Front (MTF) and transposes (TRANS) methods for the list accessing problem which results in a minimum of total access costs as compared to the cost of accessing of list using individual methods. Our paper also uses the randomized bit algorithm and look ashead concepts for obtaining the self-organizing linear list.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
