Problem
1. Find more information about one of the following people and explain why he or she is important to structured programming: Edsger Dijkstra, Corrado Bohm, Giuseppe Jacopini, and Grace Hopper.
2. Computer programs can contain structures within structures and stacked structures, creating very large programs. Computers can also perform millions of arithmetic calculations in an hour. How can we possibly know the results are correct?
3. Develop a checklist of rules you can use to help you determine whether a flow chart or pseudocode segment is structured.