Introduction to Computer Engineering

Flashcards covering key concepts related to Boolean equations, types of logic circuits, and circuit specifications.

Boolean Equations

Mathematical expressions that use boolean variables and operators to represent logical functions.

Combinational Logic

Logic circuits without memory where outputs are determined only by the current values of inputs.

Sequential Logic

Logic circuits with memory where outputs depend on both previous and current values of inputs.

Inputs

Variables that are fed into a logic circuit for processing.

Outputs

Results produced by a logic circuit based on the inputs.

Minterm

A product of literals; it is true for only one specific combination of variable values.

Maxterm

A sum of literals; it is false for only one specific combination of variable values.

Sum-of-Products (SOP) Form

A way of writing boolean expressions where each term is an AND of literals.

Product-of-Sums (POS) Form

A way of writing boolean expressions where each term is an OR of literals.

Implicant

A product term that can be used in a sum-of-products representation.

Complement

The inversion of a variable, represented with a bar over the variable.

Literal

A variable or its complement in a boolean expression.

Karnaugh Maps

A method for simplifying boolean expressions by organizing minterms and maxterms into a visual grid.

Functional Specification

Description of the relationship between inputs and outputs in a logic circuit.

Timing Specification

The time parameters that define the operation and performance of a logic circuit.

Memoryless Circuit

A circuit in which outputs depend solely on current inputs.

Cyclic Path

A path in a circuit that leads back to a prior node, which is not allowed in combinational logic.