Login | Register

A comparison of data structures in C++


A comparison of data structures in C++

Zhou, Weining (2001) A comparison of data structures in C++. [Graduate Projects (Non-thesis)] (Unpublished)

[thumbnail of MQ59346.pdf]
Text (application/pdf)


Since many C++ libraries have become widely-used by programmers. Pointers are one of the most powerful and flexible features used in C++. Pointers are particularly important for the analysis and design of data structures. The intention of this project is to compare the two implementation methods, "Closed" and "Open" by using two C++ Libraries. In this project, I designed and implemented a phonebook application by using a doubly linked list and a binary search tree as common data structures in the C++ libraries: C++ Standard Template Library (STL) and C++ Data Object Library (OrgC++). In order to explore the performance of the two styles of building data structure libraries in C++, I performed an objective comparison of two implementation methods in terms of ease of coding, time and space efficiency as well as the reliability. The applications were coded in C++

Divisions:Concordia University > Gina Cody School of Engineering and Computer Science > Computer Science and Software Engineering
Item Type:Graduate Projects (Non-thesis)
Authors:Zhou, Weining
Pagination:vii, 57 leaves : ill. ; 29 cm.
Institution:Concordia University
Degree Name:M. Comp. Sc.
Program:Computer Science
Department (as was):Department of Computer Science
Thesis Supervisor(s):Grogono, Peter
Identification Number:QA 76 M26+ 2001 no.9
ID Code:1408
Deposited By: Concordia University Library
Deposited On:27 Aug 2009 17:19
Last Modified:20 Oct 2022 20:44
Related URLs:
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Downloads per month over past year

Research related to the current document (at the CORE website)
- Research related to the current document (at the CORE website)
Back to top Back to top