------------------------------------------------------------------------------
Mohamed G. Gouda						Midterm 2
CS 356: Computer Networks					Spring 2008
------------------------------------------------------------------------------
Open Book							60 Minutes
------------------------------------------------------------------------------
1. (10 points)

A process p has an input array "data" that is declared as follows

       inp data : array[integer]of integer

Process p sends the elements of array data, one by one, to process q which 
stores them in a variable array "rcvd" that is declared as follows

       var rcvd : array[integer]of integer
	
Each sent message from p to q is of the form msg(d, s), where d is the value
of some element data[i] and s is a sequence number. There are no sent messages
from q to p. Assume that sent messages can be lost, but neither corrupted nor 
reordered. Assume also that the message loss is 1-bounded, i. e. no two 
consecutive sent messages can be lost. Specify the two processes p and q.

------------------------------------------------------------------------------
2. (10 points)

Recall that at most one corruption burst can occur in each sent block of m*n 
data bits followed by n parity bits. We define a corruption burst to be "odd" 
if and only if the number of corrupted bits in the burst is odd. What is the 
length of the longest odd corruption burst that can be detected by the 
corruption detection protocol that uses parity bits in Section 8.1? Explain
your answer.

------------------------------------------------------------------------------