hw3 - COP 3530 Fall 2010 Data Structures and Algorithms...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
COP 3530 Fall 2010 Data Structures and Algorithms Assignment 3 Due: Sept. 22 , 2010 The purpose of this assignment is to implement the ChainList Data Structure studied in class. A ChainList is like an ArrayList with the difference that the data is not stored like an array but as a sequence of elements with each element pointing to its successor like links of a Chain. Thus in actual physical storage a ChainList can have an arbitrary ordering even though it is well ordered on a logical level. The main purpose of ChainLists are situations where we do not know beforehand how many elements our List might contain. The Assignment is divided into 2 parts as follows 1) Implementing a ChainList Class (Source Code) 40 points 2) Deploying a working ChainList. - 60 points In Part I 50 Points the first part of the assignment you have to implement a Templated ChainList Class using the code discussed in class ppts. The class must implement the following features: 1) Constructor for creating ChainList 2) Destructor for safely deleting the list 3) Insert Element at position X where X is an input. 4)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

hw3 - COP 3530 Fall 2010 Data Structures and Algorithms...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online