{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

MIT16_36s09_quiz03

# MIT16_36s09_quiz03 - MIT OpenCourseWare http/ocw.mit.edu...

This preview shows pages 1–4. Sign up to view the full content.

MIT OpenCourseWare http://ocw.mit.edu 16.36 Communication Systems Engineering Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms .

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

View Full Document
Name: 16.36 Communication Systems Engineering Quiz - 3, May 20, 2009 Problem 1: Short Answer (45 pts) Please provide brief explanations for your answers in order to receive full credit. 1. (5 pts) Suppose that the string 0110 is used as a flag. a) What would the bit stuffing rule be? b) How would the following string be stuffed? 1101100111110110110101110 2. (6 pts) For each of the following protocols indicate the minimum modulo that can be used for numbering packets. a) Stop and Wait b) Go-Back-N, with N=7 c) Selective Repeat (SRP), with W=7
Name: 3. Buses arrive at a bus stop at a rate of 6 per hour. a) (4 pts) What is the expected amount of time between successive busses? b) (4 pts) You have just arrived at the bus stop. What is the expected amount of time between the last bus to arrive before you and the next bus?

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 8

MIT16_36s09_quiz03 - MIT OpenCourseWare http/ocw.mit.edu...

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

View Full Document
Ask a homework question - tutors are online