Revision

2. Encapsulating the data and methods within a class definition
5. The front index is set to 0, the rear index is set to -1
8. Checking the queue is not empty
9. A queue is an abstract data type that holds an ordered, linear sequence of items
11. Vertices on a graph
12. Removing the top of the stack
13. An abstract data type that serves as a collection of elements
15. An algorithm to find the shortest path between a set of points
16. Lines between nodes

1. When a hashing algorithm creates an identical hash for two keys
3. When edges have direction
4. Checking the queue is not full
6. A unique identifier for a record
7. Looking at the top of the stack
10. Allows you to traverse edges in either direction
12. Add value to a stack
14. An abstract data type that can be used to represent complex non linear relationships between objects