Premalatha, and Vidyadhar, Mudkavi (1995) An Implementation of linked Lists Using C++. Technical Report. National Aerospace Laboratories, Bangalore, India.
![[img]](https://nal-ir.nal.res.in/style/images/fileicons/application_pdf.png) |
PDF
tr_pdcf9523_R86284.pdf Restricted to Repository staff only Download (7MB) |
![[img]](https://nal-ir.nal.res.in/style/images/fileicons/other.png) |
Indexer Terms (Generate index codes conversion from application/pdf to indexcodes)
indexcodes.txt Restricted to Repository staff only Download (6kB) |
Abstract
All the necessary classes for the implementation of a singly linked list are developed and presented in full. The list is non intrusive and depends on an iterator class which is also presented. The ease of use of the list developed is demonstrated through an example. The example also shows that the list can store objects of any complex structure. The entire approach to the development is based on object oriented programming principles. The list implementation can be easily adopted to doubly linked lists, binary and multiway trees and general graphs.
| Item Type: | Monograph (Technical Report) |
|---|---|
| Uncontrolled Keywords: | Linear Lists;Data Structures;Container Classes;Templates;13; C++;Object Oriented |
| Subjects: | MATHEMATICAL AND COMPUTER SCIENCES > Computer Programming and Software |
| Depositing User: | Smt Bhagya Rekha KA |
| Date Deposited: | 15 May 2006 |
| Last Modified: | 28 Aug 2015 10:24 |
| URI: | http://nal-ir.nal.res.in/id/eprint/1081 |
Actions (login required)
 |
View Item |
