Before each recitation we will post a short set of written exercises. These are intended to help you prepare for recitation. You must complete them to the best of your ability, and bring them to recitation. Your TAs will note whether you have completed them along with your attendance. These exercises will not be graded for correctness, but you must attempt to answer them and bring your answers to recitation. A portion of your grade depends on your attempting these exercises each week and attending recitation.

Question 1 Suppose you have an 11-bit LFSR with taps at bits 10 and 8. If you start the LFSR with a seed of 11000000011. What are the first five bits that it will produce? (Remember, bit 0 is the rightmost bit, so bits 10 and 8 are the leftmost bit and third bit from the left.)

Question 2 Given a 3-bit LFSR with taps at bits 0 and 2 (the left and right bits) and an initial seed of 001, how many random bits will be generated before the pattern repeats itself?

Question 3 Given a 3-bit LFSR with taps at bits 1 and 2 (the left two bits) and an initial seed of 001, how many random bits will be generated before the pattern repeats itself?