The discussion regarding the Queue Array based implementation will be completed. In particular, the "wrap-around" indexing will be described in greater detail. Next we will briefly look over the array based sequence and vector implementations. After completing the array based implementations, linked list (double and single) will be introduced. Linked List implementations will be provided for the Stack, Queue, List and Sequence ADTs. Finally, time permitting, Loop Invariants and Recursion will be introduced (you can be sure that these two topics will be the topic of next weeks lectures!!).
| Pages | Section |
| 80-83 | 3.2.2 |
| 125-126 | 4.2.4 |
| 117-118 | 4.1.2 |
| 86-99 | 3.3-3.4.4 |
| 126-132 | 4.2.5 |
| Pages | Section |
| 152-155 | 4.2.2 |
| 209-210 | 5.3.3 - 5.3.4 |
| 187-191 | 5.1.2-5.1.3 |
| 159-171 | 4.3-4.4.3 |
| 198-205 | 5.2.4 |
Additional Material;