Edsger W. Dijkstra

High school (ages 12+)
Science & Technology

Name:

Date:

Step 1 · Read the article

Open the article and read it at the level above. Then answer the questions below in your own words.

https://smallwhale.org/articles/edsger-w-dijkstra

Write what each word means, using the article.

Do not copy the article. Write two things you learned, the way you would explain them to a friend.

Answers below are taken from the article’s stored facts, so they match what the student read.

1. When was Edsger W. Dijkstra born?May 11, 1930
2. Where was Edsger W. Dijkstra born?Rotterdam, Netherlands
3. What is the career?Mathematisch Centrum (Amsterdam), Burroughs Corporation, University of Texas at Austin
4. Who was Edsger W. Dijkstra?Edsger W. Dijkstra was a brilliant computer scientist from Rotterdam, Netherlands, born in 1930. He helped make computers easier to use and understand.
5. What is the Dijkstra algorithm?The Dijkstra algorithm finds the shortest path from one point to all other points in a network. It is used in GPS navigation and internet routing to choose the fastest routes.

Structured Programming: A programming paradigm emphasizing logical structure, control flow, and modularity to enhance code readability and maintainability.
Dijkstra's Algorithm: A graph search algorithm that finds the shortest path between nodes in a weighted graph, crucial for network routing and navigation.
Turing Award: The highest distinction in computer science, awarded annually for outstanding contributions to the field, often referred to as the 'Nobel Prize of Computing'.