University of Sunderland
Faculty of Applied Sciences
Department of Computing, Engineering & Technology
ELX304 – Electronic System Design
EXAMINATION
Date: Tuesday 12th January 2016 Time: 9.30-12.30
Instructions to Candidates:
Time allowed: 3 hours.
There are SIX questions set and FOUR
questions are to be answered.
This is a closed book Examination.
The use of programmable calculators and
dictionaries is forbidden.
Candidates are required to answer the
required number of questions only. Any
additional questions answered will not be
marked.
Students should put a cross through any
work that they do not wish to be marked.
This examination contributes 100% to the overall module mark.
1
, Q1 Figure Q1 shows the state flow diagram of a sequential system :
0 to A
C 0 G
0 0 0 1 1
1 to B
A
0 1 1 to A
D H 0
0 0 0 1 to B
0 to A
E 0 I
0 0 0 1
1 to B
B
0 1 1
0 to A
1 F J
0 0 1 1 to B
Figure Q1 : 3-Step Sequential System
a) Construct its state output table (3 marks)
b) Show that the above problem reduces to the states :
A, B, C, D, G, H
and hence form the minimised state output table for the system.
If merges are possible then the higher alphabetically
ordered states were replaced by the lower alphabetically
ordered states in the merges, i.e. if A merges with B
then replace B with A. (5 marks)
c) For the minimised system identify all the state assignment
rules and confirm which rules are not satisfied by the following
state assignment :
State A B C D G H
Q1Q2Q3 000 001 011 010 111 110
(5 marks)
d) Use the above assignment to develop a D-type flip-flop
solution to your design for Q1b.
You need not sketch the final design. (10 marks)
e) Identify the operation performed by the circuit. (2 marks)
2
Faculty of Applied Sciences
Department of Computing, Engineering & Technology
ELX304 – Electronic System Design
EXAMINATION
Date: Tuesday 12th January 2016 Time: 9.30-12.30
Instructions to Candidates:
Time allowed: 3 hours.
There are SIX questions set and FOUR
questions are to be answered.
This is a closed book Examination.
The use of programmable calculators and
dictionaries is forbidden.
Candidates are required to answer the
required number of questions only. Any
additional questions answered will not be
marked.
Students should put a cross through any
work that they do not wish to be marked.
This examination contributes 100% to the overall module mark.
1
, Q1 Figure Q1 shows the state flow diagram of a sequential system :
0 to A
C 0 G
0 0 0 1 1
1 to B
A
0 1 1 to A
D H 0
0 0 0 1 to B
0 to A
E 0 I
0 0 0 1
1 to B
B
0 1 1
0 to A
1 F J
0 0 1 1 to B
Figure Q1 : 3-Step Sequential System
a) Construct its state output table (3 marks)
b) Show that the above problem reduces to the states :
A, B, C, D, G, H
and hence form the minimised state output table for the system.
If merges are possible then the higher alphabetically
ordered states were replaced by the lower alphabetically
ordered states in the merges, i.e. if A merges with B
then replace B with A. (5 marks)
c) For the minimised system identify all the state assignment
rules and confirm which rules are not satisfied by the following
state assignment :
State A B C D G H
Q1Q2Q3 000 001 011 010 111 110
(5 marks)
d) Use the above assignment to develop a D-type flip-flop
solution to your design for Q1b.
You need not sketch the final design. (10 marks)
e) Identify the operation performed by the circuit. (2 marks)
2
