Unformatted text preview:

MIT OpenCourseWare http://ocw.mit.edu 6.189 Multicore Programming Primer, January (IAP) 2007 Please use the following citation format: Saman Amarasinghe and Rodric Rabbah, 6.189 Multicore Programming Primer, January (IAP) 2007. (Massachusetts Institute of Technology: MIT OpenCourseWare). http://ocw.mit.edu (accessed MM DD, YYYY). License: Creative Commons Attribution-Noncommercial-Share Alike. Note: Please use the actual date you accessed this material in your citation. For more information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms6.189 Multicore Programming Primer Mini-Quiz #4 (1/19/2007) Name: ____________________________________________ Instructions: Write out your answers clearly in the space provided. You may use both sides of the page if necessary. Please write legibly. Question 1: In 1968, ACM published Edsger Dijkstra’s letter titled Go To Statement Considered Harmful. Dijkstra argued that GOTO statements should be abolished because they lead to unstructured control flow and complicate the analysis and verification of programs. In 1974, Don Knuth presented an alternative viewpoint in Structured Programming with go to Statements. He showed that for some common programming tasks, GOTOs are the best language construct to use. This was more than 30 years ago. Today (and looking into the future) the programming landscape is changing because of the new software crisis. How would structured programming help programmers more rapidly express their parallel computation? What are some of the tradeoffs they might


View Full Document

MIT 6 189 - Mini-Quiz 4

Download Mini-Quiz 4
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Mini-Quiz 4 and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Mini-Quiz 4 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?