Off-Line List Accessing Algorithms with Circular Doubly Linked List and Partial Cost Model
キーワード:
Algorithms、 Data Structures、 Linear search、 List Accessing、 Linked List要旨
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発行日
巻号
セクション
ライセンス
Declaration and Copyright Transfer Form
(to be completed by authors)
I/ We, the undersigned author(s) of the manuscript entitled ‘______________’, hereby declare, that the above manuscript which is submitted for publication in the Journal, is not published already in part or whole (except in the form of abstract) in any journal or magazine for private or public circulation, and, is not under consideration of publication elsewhere.
I/ We have read the final version of the manuscript and am/ are responsible for the thought contents embodied in it. The work dealt in the manuscript is my/ our own, and my/ our individual contribution to this work is significant enough to qualify for authorship. We also agree to the authorship of the article in the following order:
Author’s name Signature (s)
1. ________________
2. ________________
3. ________________
4. ________________
