22-Elec-A4 Digital Systems and Computers · December 2016
Nivaar worked solution (AI-drafted; not reviewed by a licensed engineer)
Paper format. National Exams, December 2016 — 07-Elec-A4 Digital Systems & Computers. Three hours, closed book, one approved Casio or Sharp calculator. Six questions are printed and any five constitute a complete exam; every question is worth 12 points with the per-part breakdown printed on page 1. A flip-flop excitation table and a sheet of Boolean identities are attached as page 6. All six questions are solved below so the set works as a complete study resource.
Reference texts.
Question text not reproduced: the examination questions are © Engineers and Geoscientists BC. Open the official past paper (linked at the top of this page) to read the question, then follow the worked solution below.
Given. Two clocked RS flip-flops $A$ (MSB) and $B$ (LSB); an inverter produces $\overline{X}$; four AND gates and two OR gates form the excitation logic. Find. the four drive equations, the full next-state table, and the state diagram.
Approach. Trace each flip-flop's $R,S$ from the gates, use the RS rule $Q^+ = S + \overline{R}\,Q$ (with $RS=0$) to fill an eight-row table over $(A,B,X)$, then read the two cyclic sequences.
[Figure not reproduced: Excitation network redrawn as a $T$-type realisation: $T_A = X\oplus B$ gates $R_A=A\,T_A$ and $S_A=\overline{A}\,T_A$; the lower flip-flop is wired as an unconditional toggle. See the official exam paper.]
| A | B | X | $R_A S_A$ | $R_B S_B$ | $A^+ B^+$ |
|---|---|---|---|---|---|
| 0 | 0 | 0 | 0 0 | 0 1 | 0 1 |
| 0 | 0 | 1 | 0 1 | 0 1 | 1 1 |
| 0 | 1 | 0 | 0 1 | 1 0 | 1 0 |
| 0 | 1 | 1 | 0 0 | 1 0 | 0 0 |
| 1 | 0 | 0 | 0 0 | 0 1 | 1 1 |
| 1 | 0 | 1 | 1 0 | 0 1 | 0 1 |
| 1 | 1 | 0 | 1 0 | 1 0 | 0 0 |
| 1 | 1 | 1 | 0 0 | 1 0 | 1 0 |
Reading the sequences (part c). With $X=0$ the state $AB$ advances $00\to01\to10\to11\to00$ (binary up-count); with $X=1$ it runs $00\to11\to10\to01\to00$ (down-count). The machine is a 2-bit synchronous up/down counter with $X$ as the direction control; all four states are used, so it is trivially self-correcting.
| Item | Result |
|---|---|
| (a) $R_A,S_A$ | $A(X\oplus B)$, $\overline{A}(X\oplus B)$ |
| (a) $R_B,S_B$ | $B$, $\overline{B}$ (toggle) |
| (b) Next state | $A^+=A\oplus X\oplus B$, $B^+=\overline{B}$ |
| (c) Behaviour | 2-bit up/down counter ($X=0$ up, $X=1$ down) |