• Jan 05, 2017 News![CFP] 2017 the annual meeting of IJFCC Editorial Board, ICCTD 2017, will be held in Paris, France during March 20-22, 2017.   [Click]
  • Mar 24, 2016 News! IJFCC Vol. 4, No. 4 has been indexed by EI (Inspec).   [Click]
  • Mar 24, 2017 News!Vol.6, No.1 has been published with online version.   [Click]
General Information
    • ISSN: 2010-3751
    • Frequency: Bimonthly (2012-2016); Quarterly (Since 2017)
    • DOI: 10.18178/IJFCC
    • Editor-in-Chief: Prof. Mohamed Othman
    • Executive Editor: Ms. Nancy Y. Liu
    • Abstracting/ Indexing: Google Scholar, Engineering & Technology Digital Library, and Crossref, DOAJ, Electronic Journals LibraryEI (INSPEC, IET).
    • E-mail:  ijfcc@ejournal.net 
Editor-in-chief
Prof. Mohamed Othman
Department of Communication Technology and Network Universiti Putra Malaysia, Malaysia
It is my honor to be the editor-in-chief of IJFCC. The journal publishes good papers in the field of future computer and communication. Hopefully, IJFCC will become a recognized journal among the readers in the filed of future computer and communication.
IJFCC 2014 Vol.3(2): 98-101 ISSN: 2010-3751
DOI: 10.7763/IJFCC.2014.V3.276

Implementation of Enhanced Singly Linked List Equipped with DLL Operations: An Approach towards Enormous Memory Saving

Devishree Naidu and Abhishek Prasad Jr
Abstract—A linked list is a complex data structure, especially useful in systems or application programming. Linked list uses dynamic allocation of memory by which it allocates memory at the runtime alike of array so it is also called as dynamic data structure. As dynamic list is used for runtime allocation of memory, This feature is very useful in making operating system to keep track of running process that are alive or in sleep mode. This requires either a node to be inserted in between or to be removed. On other side doubly linked list that helps in moving forward or backward mode. We Proposed singly linked list itself to implement operation of doubly linked list as well as singly linked list. Our approach makes use of EX-OR Technique to acquire next node and previous node, To traverse in both the direction but the problem with doubly linked list is that, it requires large amount of memory to store addresses and therefore singly linked list can perform same task of traversing in both direction without increasing its memory requirement. This concept can be usefully applicable to the system or application programming where memory requirement is more viz MRU list , cache in Browser that allow to hit back.

Index Terms—SLL, DLL, traversing, MRU, exclusive-OR

Devishree Naidu is with Computer science and Engineering Department, Rashtrasant Tukdoji Maharaj Nagpur University, India (e-mail: devishree. naidu@ gmail.com).
Abhishek Prasad is with Wireless Research and Development, Marvell Technology Pvt. Ltd. Pune, India (e-mail: Prasad.abhishek86@gmail.com).

[PDF]

Cite:Devishree Naidu and Abhishek Prasad Jr, "Implementation of Enhanced Singly Linked List Equipped with DLL Operations: An Approach towards Enormous Memory Saving," International Journal of Future Computer and Communication vol. 3, no. 2, pp. 98-101, 2014.

Copyright © 2008-2016. International Journal of Future Computer and Communication. All rights reserved.
E-mail: ijfcc@ejournal.net