25_asynchronous_computing - CSCI-1200 Data Structures -...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Final Exam General Information The final exam will be held Monday, Dec 20th, 2010, 11:30am-2:30pm, Sage 3303 . A makeup exam will only be offered if required by the RPI rules regarding final exam conflicts -OR- if a written excuse from the Dean of Students office is provided. Contact Professor Cutler ASAP if you require a makeup exam. Coverage: Lectures 1-25, Labs 1-14, HW 1-10. Closed-book and closed-notes or printed . Computers, cell-phones, palm pilots, calculators, PDAs, MP3 players, etc. are not permitted and must be turned off. All students must bring their Rensselaer photo ID card. The best thing you can do to prepare for the final is practice. Try the review problems (posted on the course exercises from lecture, lab, homework and the textbook. Solutions to the review problems will be posted next week. What is garbage? Memory which cannot (or should not) be accessed by the program. It is available for reuse. Explicit memory management (C++) vs. automatic garbage collection. Cyclical data structures, memory overhead, incremental vs. pause in execution, ratio of good to garbage, defragmentation. 25.1 Today’s Class Computing with multiple threads/processes and one or more processors Deadlock: the Dining Philosopher’s Problem 25.2 The Role of Time in Evaluation Sometimes the order of evaluation does matter, and sometimes it doesn’t. The behavior of objects with state depends on sequence of events that have occurred. Referential transparency : when equivalent expressions can be substituted for one another without changing the value of the expression. For example, a complex expression can be replaced with its result if repeated evaluations always yield the same result, independent of context. What happens when objects don’t change one at a time but rather act concurrently? We may be able to take advantage of this by letting threads/processes run at the same time (a.k.a., in parallel). However, we will need to think carefully about the interactions and shared resources.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/21/2012 for the course CSCI 1200 taught by Professor Cutler during the Fall '08 term at Rensselaer Polytechnic Institute.

Page1 / 6

25_asynchronous_computing - CSCI-1200 Data Structures -...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online