CSE4/586 (Spring 2009): Final
Closed books and notes. There are 10 questions. The duration is for 2 hours. Good luck. Name:
1. Predicate logic (10 points) Mark the following predicates as True or False. T [ P Q P Q ] T [ P Q (P Q) ] F [ P Q P Q ] T [ P Q
CSE4/586 (Spring 2009): Homework 7
Due by May 5 Tuesday, in class. 1. (40 points) Consider an undirected and connected (but not fully-connected) graph of n nodes. (In other words, the nodes are in a multihop network.) Execution of nodes is assumed to be s
CSE4/586 (Spring 2009): Homework 5
Due by Apr 23 Thursday, in class. 1. (20 points) In Lamports logical clock based mutual exclusion protocol (Chapter 7) why do we need to have the following check for a process i entering the critical section? For all oth
CSE4/586 (Spring 2009): Homework 6
Due by Apr 23 Thursday, in class. 1. (40 points) Consider the synchronous agreement with crash faults program we studied in Section 12.6. Modify this algorithm to design an early-stopping version of the algorithm that te
CSE4/586 (Spring 2009): Homework 6
Due by Apr 23 Thursday, in class. 1. (40 points) Consider the synchronous agreement with crash faults program we studied in Section 12.6. Modify this algorithm to design an early-stopping version of the algorithm that te
CSE4/586 (Spring 2009): Homework 5
Due by Apr 23 Thursday, in class. 1. (20 points) In Lamports logical clock based mutual exclusion protocol (Chapter 7) why do we need to have the following check for a process i entering the critical section? For all oth
CSE4/586 (Spring 2009): Homework 2
Due by Feb 3, in class.
Consider a coee can containing an arbitrary (but nite) number of beans. The beans come in 3 dierent colors: red, green, and blue. You are asked to perform the following action repeatedly (ie., ove