Off-Line List Accessing Algorithms with Circular Doubly Linked List and Partial Cost Model

Abstract

List Accessing Problem (LAP) has been an interesting and challenging research area for computer scientists since last four decades. Various algorithms have been developed to access the records by different researchers with an intention to minimize the cost of traversal. This paper describes two newly proposed algorithms, which are variants of FC and MTF for circular doubly linked list with the use of partial cost model. A theoretical as well as experimental comparative study of the proposed algorithms is performed. The total cost of searching of records for different input request sequence is generalized using mathematical expression.

Keywords:  Algorithms, Data Structures, Linear search, List Accessing, Linked List