E.W. Dijkstra (1930-2002)

4. The numerical value assigned to a connection in a graph is a ____ weight.
6. The deadlock problem became crucial in identifying new _____________ primitives.
7. _______ Commands introduced by Dijkstra are operations used to handle non deterministic operations.
11. Dijkstra algorithm’s first real-world use case was to determine the shortest path between two
14. The data structure used in the application of Dijkstra’s Algorithm is a ________ Queue.
17. Dijkstra published the “dining __________” problem which identifies deadlocks between peers sharing resources.
18. In 1984 he accepted a professorship position at the University of Texas at _____.
19. Dijkstra’s algorithm solves for the _____ path between two nodes in a graph.

1. The type of graph used in the application of Dijkstra’s Algorithm where edges can only be traveled in a single is a ________ Graph.
2. He won the ACM ____ Award in 1972, computing science’s highest honor.
3. A branch of mathematics called Graph ______ that E.W. Dijkstra contributed to; dealing with nodes and edges.
5. Dijkstra developed a theory of __________ which delved into the behavior of systems where actions can result in different outcomes.
8. Dijkstra was a professor at the Technische Hogeschool _______ in the Netherlands.
9. Dijkstra introduced the concept of _________ to manage concurrent computing processes.
10. A subset of a graph that connects all vertices without cycles is a _________ Tree.
12. He was involved in creating the “_____ 60” programming language; predecessor to Pascal and a standard for the publication of algorithms.
13. The paper published on Dijkstra’s algorithm is titled, “A Note on Two Problems in Connection with _____” and was published in 1959.
15. E.W. Dijkstra originally went to study _____ at the University of Leiden.
16. Most of Dijkstra’s later career involved refining and presenting his style for the construction of ______.