Breadcrumb

 
 

A comparison of data structures in C++

Title:

A comparison of data structures in C++

Zhou, Weining (2001) A comparison of data structures in C++. Other thesis, Concordia University.

[img]
Preview
PDF
1775Kb

Abstract

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 > Faculty of Engineering and Computer Science > Computer Science and Software Engineering
Item Type:Thesis (Other)
Authors:Zhou, Weining
Pagination:vii, 57 leaves : ill. ; 29 cm.
Institution:Concordia University
Degree Name:Major reports (M.Comp.Sc.)
Program:Computer Science and Software Engineering
Date:2001
Thesis Supervisor(s):Grogono, Peter
ID Code:1408
Deposited By:Concordia University Libraries
Deposited On:27 Aug 2009 13:19
Last Modified:08 Dec 2010 10:20
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

Document Downloads

More statistics for this item...

Concordia University - Footer