# Help with comp arch practice problems

*label*Computer Science

*timer*Asked: Apr 28th, 2015

**Question description**

Please answer these questions with the steps used to solve them :)

Show how floating point value -3.3125 would be stored using single precision.

2. A = 10110101 is encoded with CRC polynomial X^3 + X^1 + 1. What is the length of the encoded word?

3. a finite state machine will generate 3 codes: 100, 010, and 001. If current state of FSM is S0 and input is 0, it generates the code 010 and moves to state S1; if current state is S0 and input to it is 1, generates code 001 and moves to state S2. If current state of FSM is S1 and input to it is 0, it generates code 001 and moves to the state S2; if current state of FSM is S2 and input to it is 0, it will generate code 100 & move to state S0; if current state is S2 and input to it is 1, generates code 010 and moves to state S1.

1. construct a state transition table for the FSM

2. what is a binary representation for state of FM?

3. Rewrite state transition table

4. write all necessary boolean functions

5. implement FSM using AND, OR , NOT logic elements and D flip flops for implementation