2030a
Quiz ECE #8
Spring 2007
Name:
Student #: * Closed Book * No Notes * No Calculators *
1. (5 points) A finite state machine (FSM) with one input (X) and one output (Z) is defined by the state diagram below. Answer the following questions about this FSM.
0/0 1/0
1/0
a) Assume the FSM starts in state A. Given the following sequence of input (X) values, what is the resulting sequence of output (Z) values? X: Z: 1 0 0 1 0 1 1 0 1 0 1 0
A
1/1 0/0
B
0/0
b) What state is the FSM in at the end of the above sequence? state = c) What input sequence is "detected" by this FSM? (Equivalently, what is the shortest input sequence, starting from state A, what will generate an output of "1"?) X = d) Does this FSM detected "overlapped" input sequences? YES NO
C
2. (5 points) As discussed in class, a larger memory system can be created by combining smaller individual memory ICs. Each row in the following table describes a different memory system configuration. Fill in all of the missing entries.
# of memory address lines # of memory data lines Size of individual memory ICs Number of memory ICs needed
Memory Configuration
Total bits in memory
8G x 32 233 30 24 16
1G x 1 64M x 8 1M x 4
ECE 2030a
Quiz #8
Spring 2007
Name:
Student #: * Closed Book * No Notes * No Calculators *
1. (5 points) A finite state machine (FSM) with one input (X) and one output (Z) is defined by the state diagram below. Answer the following questions about this FSM.
1/0 0/0
0/0
a) Assume the FSM starts in state A. Given the following sequence of input (X) values, what is the resulting sequence of output (Z) values? X: Z: 0 1 1 0 1 0 0 1 0 1 0 1
A
0/1 1/0
B
1/0
b) What state is the FSM in at the end of the above sequence? state = c) What input sequence is "detected" by this FSM? (Equivalently, what is the shortest input sequence, starting from state A, what will generate an output of "1"?) X = d) Does this FSM detected "overlapped" input sequences? YES NO
C
2. (5 points) As discussed in class, a larger memory system can be created by combining smaller individual memory ICs. Each row in the following table describes a different memory system configuration. Fill in all of the missing entries.
# of memory address lines # of memory data lines Size of individual memory ICs Number of memory ICs needed
Memory Configuration
Total bits in memory
8G x 32 24 233 30 16
1G x 1 1M x 4 64M x 8
ECE 2030a
Quiz #8
Spring 2007
Name:
SOLUTION
Student #:
* Closed Book * No Notes No * Calculators * 1. (5 points) A finite state machine (FSM) with one input (X) and one output (Z) is defined by the state diagram below. Answer the following questions about this FSM.
0/0 1/0
1/0
a) Assume the FSM starts in state A. Given the following sequence of input (X) values, what is the resulting sequence of output (Z) values? X: Z: 1 0 0 0 0 0 1 0 0 0 1 1 1 0 0 0 1 1 0 0 1 1 0 0
A
1/1 0/0
B
0/0
b) What state is the FSM in at the end of the above sequence? state = C c) What input sequence is "detected" by this FSM? (Equivalently, what is the shortest input sequence, starting from state A, what will generate an output of "1"?) X = 101 d) Does this FSM detected "overlapped" input sequences? YES NO
C
2. (5 points) As discussed in class, a larger memory system can be created by combining smaller individual memory ICs. Each row in the following table describes a different memory system configuration. Fill in all of the missing entries.
# of memory address lines # of memory data lines Size of individual memory ICs Number of memory ICs needed
Memory Configuration
Total bits in memory
8G x 32 1G x 8 16M x 16
238 233 228
33 30 24
32 8 16
1G x 1 64M x 8 1M x 4
256 16 64
ECE 2030a
Quiz #8
Spring 2007
Name:
SOLUTION
Student #:
* Closed Book * No Notes * No Calculators * 1. (5 points) A finite state machine (FSM) with one input (X) and one output (Z) is defined by the state diagram below. Answer the following questions about this FSM.
1/0 0/0
0/0
a) Assume t...