Blackboard pictures

The following topics were discussed and addressed:

• Value tables for function definition
• Entering tables in KV diagrams
• Structure of KV diagrams, meaning of the index number
• Reading the Boolean equation from a table or KV. Diagram
• Minimized reading from KV diagrams
• Realization of a formula as a circuit diagram (with examples)
• Development theorem of circuit algebra, connection with multiplexers
• Realization of formulas with multiplexers

The following topics were discussed and addressed:

• Setting up a process idea and a state transition diagram from a text task
• Transferring the transition diagram (state transition graph) to the transition table, if necessary
• State coding
• Block diagram (automaton) and create the gate circuit
• Automata model, states (+representation)
• Example running light with enable (+block diagram)
• Correspondence between model, transition graph, transition table and concrete example
• Hazards (with simple example)

The following topics were discussed and addressed:

• Venn diagrams
• Function realization through MUXes
• Automata structure
• Control equations for flip-flops (JK by comparing coefficients)
• Derive circuit representation from control equations
• Visualize state transitions from FF behaviour (ad hoc)
• Master-slave flip-flop and retarded outputs (reasons and effects)
• Difference between Moore/Mealy automata, block diagram, differentiation criterion (approach)

The following topics were discussed and addressed:

• Timing and flip-flops
• Automata model
• Moore/Mealy conversion
• Clock cycle
• RS flip-flop (latch)
• Setup and hold times
• Timing diagrams