Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2021/digital-systems-linear-algebra-introduction-to-formal-proof/1/c/solution

With , a JK flip-flop obeys at its positive clock edge: holds its old state and sets it. Thus each original stage is a sticky record of a previously sampled high input until Start clears it. A D flip-flop instead obeys , so a later sample of zero can clear the output.
Connect each replacement D input where the corresponding J input was connected, preserving the clocks and asynchronous clear. The first valid sequence after Start still sets both outputs. Afterwards, let fall and apply another rising clock edge to . The D version clears ; the JK version retains . A subsequent rising clock edge of can therefore clear only in the D version. Neither circuit continuously tracks its data input between clock edges.

New to topics? Read the docs here!