| Discuss Midterm |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | Review
for the Midterm |
||||||||||||
| – | The
midterm is closed book, closed notes |
||||||||||||
| – | it
will cover position oriented abstractions such as |
||||||||||||
| stacks,
queues, absolute ordered lists and relative |
|||||||||||||
| ordered
lists |
|||||||||||||
| – | it
will cover array, linear linked list, circular linked |
||||||||||||
| list,
and doubly linked list representations |
|||||||||||||
| – | it
may also cover dummy head node and derivations of |
||||||||||||
| the
standard linked list |
|||||||||||||