Data Structures and Algorithms 
with Object-Oriented Design Patterns in C++
 
 
 
 
 
- 
	Complete the implementation of the Array<T> class
	declared in Program 
.
	Write a test suite to verify all of the functionality.
	Try to exercise every line of code in the implementation. - 
	Complete the implementation of the LinkedList<T> class
	declared in Program 
.
	Write a test suite to verify all of the functionality.
	Try to exercise every line of code in the implementation. - 
	Change the implementation of the LinkedList<T> class
	declared in Program 
 by
	removing the tail member variable.
	I.e., implement the singly-linked list variant
	shown in Figure 
 (a).
	Write a test suite to verify all of the functionality.
	Try to exercise every line of code in the implementation. - 
	Change the implementation of the LinkedList<T> class
	declared in Program 
	so that it uses a circular, singly-linked list with a sentinel
	as shown in Figure 
 (c).
	Write a test suite to verify all of the functionality.
	Try to exercise every line of code in the implementation. - 
	The Array2D<T> class declared in Program 
	only supports subscript ranges starting at zero.
	Modify the implementation to allow an arbitrary subscript base
	in each dimension. - 
	Design an implement a three-dimensional array class Array3D<T>
	based on the two-dimensional class Array2D<T>
	declared in Program 
. - 
	A row vector is a  
 matrix and a column vector
	is an  
 matrix.
	Define and implement classes RowVector<T> and
	ColumnVector<T> as classes derived
	from the base class Array2D<T>.
 
 
 
 
 
 
Copyright © 1997 by Bruno R. Preiss, P.Eng.  All rights reserved.