Across
- 3. commonly used algorithm to find the distance between two nodes on a weighted graph
- 6. adding an item to the top of a stack
- 7. A queue where the locations for the items loop around so a fixed range of memory addresses is used
- 10. programming using objects
- 12. graphs where at least one edge is unidirectional
- 14. Remove an item from a queue
- 16. A data structure that stores its items in a last in first out fashion
- 20. A queue which stores its items across an increasing range of addresses and doesn't loop back around
- 21. graphs where the edges have values (weights) assigned to them
Down
- 1. removing an item from the top of a stack
- 2. where a hashing algorithm results in the same hash from two different keys
- 4. checking what the top item in a stack is
- 5. items on a graph
- 8. Linear data structure where each data structure points to the next so their positions in memory don't matter
- 9. connections/pathways between nodes
- 11. Create and define the parameters and/or values of an object
- 13. Add an item to a queue
- 15. graphs where the edges have no direction
- 17. A data structure that stores its items in a First-In-First-Out fashion
- 18. a collection of nodes connected by edges
- 19. a value that is hashed by a hashing algorithm to create a hash