ExamPass EngineeringExamPass Engineering Start free
FE Electrical and Computer · Knowledge area 4 of 17

Digital Systems on the FE Electrical and Computer exam

Digital Systems accounts for 9 of the 110 questions — 8.2% of your exam. It sits in the middle of the paper by weight: too big to skip, not big enough to dominate your plan.

Questions9
Share of exam8.2%
Rank by weight4/17
In our bank29

What Digital Systems covers

On the FE Electrical and Computer exam this area covers number systems and codes, Boolean algebra, logic gates, combinational design, Karnaugh maps, flip-flops, counters and registers, and state machines.

What the questions look like: Simplifying an expression, reading a truth table, or tracing a sequential circuit.

Worth knowing cold: Karnaugh maps are faster and safer than algebraic simplification under time pressure.

3 free Digital Systems practice problems

These come from our FE Electrical and Computer bank, written to the same specification as the exam. Try each one before opening the solution.

Problem 1

A synchronous sequential Mealy circuit is designed to detect the serial bit sequence "1011" on an external serial data line $X$, allowing bit overlapping. The state assignment uses two D flip-flops with state variables $(Q_1, Q_0)$ assigned as follows: - $S_0 = 00$ (Reset / Idle) - $S_1 = 01$ (Got "1") - $S_2 = 10$ (Got "10") - $S_3 = 11$ (Got "101") The state transition graph is shown in the diagram, where the output $Z$ asserts high ($Z = 1$) in the clock cycle when the fourth bit of "1011" arrives. What are the minimized Boolean excitation equations for flip-flop inputs $D_0, D_1$ and output $Z$?

  1. AD₀ = X, D₁ = Q₀·X' + Q₁·Q₀'·X, Z = Q₁·Q₀·Xcorrect
  2. BD₀ = Q₁·X, D₁ = Q₀·X, Z = Q₁·Q₀
  3. CD₀ = X', D₁ = Q₁·X + Q₀, Z = Q₁·X
  4. DD₀ = Q₀·X, D₁ = Q₁·X', Z = Q₀·X
Show the solution

**Step 1: Construct the Mealy State Transition Table** From the FE Reference Handbook (Digital Systems / Sequential Logic): Present State $(Q_1, Q_0)$, Input $X$, Next State $(Q_1^+, Q_0^+) = (D_1, D_0)$, Output $Z$: | Present State | State Name | Next State ($X=0$) | Next State ($X=1$) | Output $Z$ ($X=0$) | Output $Z$ ($X=1$) | |:---:|:---:|:---:|:---:|:---:|:---:| | 00 | $S_0$ | 00 | 01 | 0 | 0 | | 01 | $S_1$ | 10 | 01 | 0 | 0 | | 10 | $S_2$ | 00 | 11 | 0 | 0 | | 11 | $S_3$ | 10 | 01 | 0 | 1 | **Step 2: Derive Equation for D₀ (Q₀⁺)** Looking at the $Q_0^+$ column: - For $X = 0$: $Q_0^+ = 0$ in all states ($S_0, S_1, S_2, S_3$). - For $X = 1$: $Q_0^+ = 1$ in all states ($S_0, S_1, S_2, S_3$). Therefore, $Q_0^+$ depends solely on the input: $$D_0 = Q_0^+ = X$$ **Step 3: Derive Equation for D₁ (Q₁⁺)** $Q_1^+ = 1$ in the following minterms $(Q_1, Q_0, X)$: - In $S_1(01)$ with $X=0$: $(0, 1, 0) \implies \overline{Q_1} Q_0 \overline{X}$ - In $S_2(10)$ with $X=1$: $(1, 0, 1) \implies Q_1 \overline{Q_0} X$ - In $S_3(11)$ with $X=0$: $(1, 1, 0) \implies Q_1 Q_0 \overline{X}$ Grouping the terms with $\overline{X}$: $$\overline{Q_1} Q_0 \overline{X} + Q_1 Q_0 \overline{X} = (\overline{Q_1} + Q_1) Q_0 \overline{X} = Q_0 \overline{X}$$ Adding the remaining minterm: $$D_1 = Q_0 \overline{X} + Q_1 \overline{Q_0} X = Q_0 X' + Q_1 Q_0' X$$ **Step 4: Derive Output Equation Z** $Z = 1$ occurs if and only if the current state is $S_3$ ($Q_1 = 1, Q_0 = 1$) and the input is $X = 1$: $$Z = Q_1 Q_0 X$$ Conclusion: The excitation equations are **D₀ = X**, **D₁ = Q₀·X' + Q₁·Q₀'·X**, and **Z = Q₁·Q₀·X**. Distractor Analysis: - Option A: Correct. Derives D_0 and D_1 excitation from transition table and Mealy output condition Z = Q_1 Q_0 X. - Option B: Incorrectly treats circuit as a Moore machine with state-only output. - Option C: Inverts input logic polarity on flip-flop D_0. - Option D: Fails to account for overlapping sequence detection return states.

Problem 2

A 4-bit synchronous binary counter ($Q_D Q_C Q_B Q_A$) operates from a system master clock frequency $f_{clk} = 50.0\text{ MHz}$. An external NAND logic gate decodes state $10_{10} = 1010_2$ ($Q_D = 1$ and $Q_B = 1$) and feeds the active-low synchronous clear input ($\overline{\text{SCLR}}$), resetting the counter back to $0000_2$ on the next rising clock edge. The component timing parameters are: - Clock-to-output propagation delay: $t_{cq} = 8.0\text{ ns}$ - NAND decode gate propagation delay: $t_{gate} = 4.5\text{ ns}$ - Synchronous clear setup time: $t_{setup} = 3.5\text{ ns}$ What are the fundamental output frequency $f_{out}$ of the terminal count pulse and the maximum allowable clock frequency $f_{clk,max}$ for reliable operation?

  1. A5.00 MHz (with maximum clock frequency f_clk,max = 62.5 MHz)correct
  2. B3.13 MHz (with maximum clock frequency f_clk,max = 50.0 MHz)
  3. C6.25 MHz (with maximum clock frequency f_clk,max = 75.0 MHz)
  4. D10.00 MHz (with maximum clock frequency f_clk,max = 80.0 MHz)
Show the solution

**Step 1: Determine Counter Modulo and Output Frequency** From the FE Reference Handbook (Digital Systems / Sequential Logic / Counters): Because the clear is **synchronous**, state $10_{10} = 1010_2$ is detected during clock period 9, and the clear is executed on the 10th rising clock edge. Thus, the counter cycles through exactly 10 distinct states: $0, 1, 2, 3, 4, 5, 6, 7, 8, 9$. This is a Modulo-10 (decade) frequency divider: $$f_{out} = \frac{f_{clk}}{10} = \frac{50.0\text{ MHz}}{10} = 5.00\text{ MHz}$$ **Step 2: Analyze the Critical Timing Path** For reliable synchronous operation, the clear signal generated by the NAND gate must become stable and valid before the next clock edge by at least the required setup time $t_{setup}$: The minimum clock period $T_{min}$ is bounded by: $$T_{min} \ge t_{cq} + t_{gate} + t_{setup}$$ Substituting the given delays: $$T_{min} = 8.0\text{ ns} + 4.5\text{ ns} + 3.5\text{ ns} = 16.0\text{ ns}$$ **Step 3: Calculate Maximum Clock Frequency $f_{clk,max}$** $$f_{clk,max} = \frac{1}{T_{min}} = \frac{1}{16.0 \times 10^{-9}\text{ s}} = 62.5 \times 10^6\text{ Hz} = 62.5\text{ MHz}$$ Since the nominal operating frequency $f_{clk} = 50.0\text{ MHz}$ is less than $62.5\text{ MHz}$, the system operates with a timing slack of: $$\text{Slack} = T_{clk} - T_{min} = 20.0\text{ ns} - 16.0\text{ ns} = +4.0\text{ ns}$$ Conclusion: The output frequency is **$5.00\text{ MHz}$** and the maximum clock frequency is **$62.5\text{ MHz}$**. Distractor Analysis: - Option A: with maximum clock frequency f_clk,max = 62.5 MHz (Correct) - Option B: with maximum clock frequency f_clk,max = 50.0 MHz - Option C: with maximum clock frequency f_clk,max = 75.0 MHz - Option D: with maximum clock frequency f_clk,max = 80.0 MHz

Problem 3

A 4-input combinational logic function is specified by the minterm canonical list: $$F(A, B, C, D) = \sum m(0, 2, 5, 7, 8, 10, 13, 15)$$ Using Karnaugh map minimization principles from the NCEES FE Reference Handbook, the minimal sum-of-products (SOP) expression for $F(A, B, C, D)$ is:

  1. AF = B' D' + B Dcorrect
  2. BF = A' C' + A C
  3. CF = B' C + A D'
  4. DF = A' B D + A B' D'
Show the solution

Step 1: Plot the minterms on a 4-variable K-map (rows AB, columns CD with Gray codes 00, 01, 11, 10): - Row $AB = 00$: $m_0(0000) = 1$, $m_1(0001) = 0$, $m_3(0011) = 0$, $m_2(0010) = 1$ - Row $AB = 01$: $m_4(0100) = 0$, $m_5(0101) = 1$, $m_7(0111) = 1$, $m_6(0110) = 0$ - Row $AB = 11$: $m_{12}(1100) = 0$, $m_{13}(1101) = 1$, $m_{15}(1111) = 1$, $m_{14}(1110) = 0$ - Row $AB = 10$: $m_8(1000) = 1$, $m_9(1001) = 0$, $m_{11}(1011) = 0$, $m_{10}(1010) = 1$ Step 2: Identify maximal prime implicant groupings: Group 1 (Four Corners): Cells $m(0, 2, 8, 10)$: - In rows $AB = 00$ and $10$, variable $A$ changes from 0 to 1 (eliminates), while $B = 0$ ($B'$). - In columns $CD = 00$ and $10$, variable $C$ changes from 0 to 1 (eliminates), while $D = 0$ ($D'$). This group of 4 cells yields the essential prime implicant term: $B' D'$. Group 2 (Center 2x2 Quad): Cells $m(5, 7, 13, 15)$: - In rows $AB = 01$ and $11$, variable $A$ changes from 0 to 1 (eliminates), while $B = 1$ ($B$). - In columns $CD = 01$ and $11$, variable $C$ changes from 0 to 1 (eliminates), while $D = 1$ ($D$). This group of 4 cells yields the essential prime implicant term: $B D$. Step 3: Combine terms to form the minimal SOP: All 8 minterms are completely covered by these two prime implicants: $$F(A, B, C, D) = B' D' + B D$$ Note that this is equivalent to the XNOR function $(B \oplus D)'$. Distractor Analysis: - Option A: Correct. - Option B: Groups along variables A and C incorrectly. - Option C: Erroneously mixes adjacent row and column variables without forming valid rectangular groups. - Option D: Fails to group across adjacent rows, leaving sub-optimal 3-variable product terms.

Find out where you actually stand

A free 20-question diagnostic across every FE Electrical and Computer knowledge area, scored in the real exam interface. You get a projected score and the areas costing you the most — so you know whether Digital Systems is where your time should go at all.

Start the free Electrical & Computer diagnostic

Retaking the FE Electrical and Computer exam?

Copy the scores from your NCEES diagnostic report and see whether Digital Systems is where your next attempt gains the most points, or whether another area deserves the time first.

Analyze my diagnostic report

Other FE Electrical and Computer knowledge areas