Search

====== Week 2 ====== * Office hours: posted! * Article discussion (postponed: Wed) * [[http://... -guide.pdf|PDF}} * Reading assignment for next week: * Ben-Ari Ch 1: What is Concurrent Programm

l information disseminated in class that day. ^ Week ^ Topics of the Week ... ^ Readings ^ Mon ^ Wed ^ ^ [[week1|-1-]] | What is Concurrent Programming? ... | Ben-Ari Ch. 1 ^ | 1/23 | ^ [[week2|-2-]] | The Concurrent Programming Abstractio

hortly before lectures. The material covered each week will build on what was covered in prior weeks. As... === Labs === This course has weekly lab sessions held in OLB 105 (and spreading to ... ^ | 30%^ |Assignments (8 to 10) ^ | ^ | 15%^ |Weekly Labs (8 to 10) ^ | ^ | 5%^ |Class Participati

l information disseminated in class that day. ^ Week ^ Topics of the Week ... adings ^ Mon ^ Wed ^ Fri ^ ^ [[week1|-1-]] | Decomposition, Abstraction; Understan... skov 1, 2 ^ | 1/23 | 1/25 | ^ [[week2|-2-]] | Procedural Abstraction: Specification

====== Week 1 ====== ~~NOTOC~~ * Introductions * Course overview (syllabus) ===== Lecture Notes ===== * Lecture notes: {{courses:cs377-201301:cs377-s13-lect01.pdf|PDF}} * A familiar problem: findMax * Ben-Ari slides: {{courses:cs377-201301:slides.pdf|PDF}} ===== Assignments ===== * First programming assignment: * implement 3 versions of findMax in C * use the Vim editor to type in your program (see sidebar for Vim resources) * {{courses:cs377-201301:assign-1.pdf|PDF}} * due: next Wed, Jan 30 * Read for next class: * [[http://queue.acm.org/detail.cfm?id=1095421|Software and the Concurrency Revolution]] (ACM Queue, 3(7), Sep. 2005) * written summary due next class: Mon, Jan 28 * Ben-Ari Text: * Chapters 1 and 2 for next week

hortly before lectures. The material covered each week will build on what was covered in prior weeks. As... u.// === Labs === This course has weekly lab sessions held in OLB 105 (and spreading to ... ld be viewed as a warm-up to prepare you for that week's assignment. When you are finished with each lab

==== CS 240 Schedule ==== //Slides for each week's lectures are available by clicking on the topic for that week.// The following schedule roughly estimates the day we will cover given material and is s

====== Week 9 ====== ~~NOTOC~~ ===== Type Hierarchy ===== //**Liskov Substitution Principle: **// //

====== Week 11 ====== ~~NOTOC~~ ===== Assignment 3 ===== **//It's in the bag...//** * due: toda

====== Week 9 ====== ~~NOTOC~~ ===== Dining Philosophers ===== * UPC Solution * Assignment: Din

====== Week 11 ====== ~~NOTOC~~ **// Channels, CSP, and kroc//** ===== Communicating Sequential Pro

====== Week 10 ====== ~~NOTOC~~ ===== Monitors ===== * Ben-Ari slides: {{courses:cs377-201301:slides

====== Week 10 ====== ~~NOTOC~~ ===== Polymorphic Abstractions ===== * We've used generic types (e.

====== Week 4 ====== ~~NOTOC~~ ===== Homework ===== * Written HW: Ben-Ari p. 39: * Exercises 2