No
|
Task |
0
|
Implement the stack ADT using
the STL vector
class. |
1
|
Implement the stack ADT using the STL list class. |
2
|
Implement the queue ADT using
STL vector
class. |
3
|
Implement the queue ADT using
an array. |
4
|
Implement the queue ADT using STL list class. |
5
|
Implement the queue ADT using
a singly linked list.
|
6
|
Complete the implementation
of class LinkedDeque
using doubly linked list.
|
7
|
Implement the deque ADT with
an array used in circular fashion.
|
8
|
Implement the deque ADT using the STL list class |
9
|
Implement the Stack interfaces
with a unique class that is derived from class LinkedDeque.
|
10
|
Implement the Queue interfaces
with a unique class that is derived from class LinkedDeque. |
11
|
Implement the vector ADT by
means of an extendable array used in a circular fashion, so
that insertions and deletions at the beginning and end of
the vector run in constant time.
|
12
|
Implement the sequence ADT by
means of an extendable array used in a circular fashion, so
that insertions and deletions at the beginning and end of
the sequence run in constant time. |
13
|
Implement the sequence ADT by
means of a singly linked list. |
14
|
Implement the sequence ADT using the STL list class. |
15
|
Implement the ObjectIterator
ADT to the NodeList class and complete print function.
|