update

slides/pages/qa.md

@@ -8,7 +8,7 @@ Any questions about:
 
 - Second Assignment Sheet
 - Third Assignment Sheet
-- Programming exercises
+- Topics from the lectures
 - Organisation
 
 <br/>

slides/pages/recap.md

@@ -4,35 +4,27 @@ title: Recap I
 
 # Recap & Discussion
 
-### Concurrency
+### Performance
 
-- What is concurrency?
-- What are the essentials?
-- What are the models for concurrency programming?
+- What are the different perspectives on performance?
+- What does these perspectives suggest?
+- How can we optimize the performance of our programs?
 
 <v-click>
 
 <br />
 
-### Concurrency with Threads 
+### What are the requirements for solutions that protect the critical section?
 
 </v-click>
 
 <v-clicks>
 
-- What are threads?
-- What information does a thread hold? What are shared among threads, what not?
-- What kind of issues will we face when we use threads? What is the root of these issues?
-- How to design your program using threads?
+- Critical section should be protected reliably by mutual exclusion
+- Available in high-level programming languages
+- No deadlocks
+- Low overhead
+- Providing **fair** access to the critical section
 
 </v-clicks>
 
-<br />
-
-<v-clicks>
-
-### Reading
-
-See: [MIT 6.005 - Concurrency](http://web.mit.edu/6.005/www/fa16/classes/19-concurrency/)
-
-</v-clicks>