Study guide

4.3 Logic Diagrams, Boolean Algebra, and Control Logic

FE Other Disciplines Fundamentals of Engineering

Track your progress as you read

Finished sections get a check mark.

1 Introduction & Exam Strategy

About the FE Other Disciplines Exam How to Use This Study Guide

2 Chapter 1: Mathematics

1.1 Analytic Geometry, Trigonometry, and Vector Operations 1.2 Differential and Integral Calculus 1.3 Ordinary Differential Equations and Laplace Transforms 1.4 Linear Algebra, Matrices, and Systems of Equations 1.5 Numerical Methods, Root-Finding, and Numerical Integration

3 Chapter 2: Probability and Statistics

2.1 Probability Distributions, PMFs, and PDFs 2.2 Expected Value, Mean, Variance, and Descriptive Statistics 2.3 Estimation, Confidence Intervals, and Sample Sizes 2.4 Hypothesis Testing, Goodness of Fit, and Linear Regression

4 Chapter 3: Chemistry

3.1 Stoichiometry, Chemical Reactions, and Solutions 3.2 Chemical Equilibrium, Acids/Bases, and Ideal Gas Laws 3.3 Oxidation-Reduction, Electrochemistry, and Corrosion Basics

5 Chapter 4: Instrumentation and Controls

4.1 Sensors, Transducers, and Signal Conditioning 4.2 Data Sampling, Accuracy/Precision, and A/D Conversion 4.3 Logic Diagrams, Boolean Algebra, and Control Logic

6 Chapter 5: Engineering Ethics and Societal Impacts

5.1 NCEES Model Rules of Professional Conduct and Codes of Ethics 5.2 Public Protection, Licensure Boards, and Professional Liability 5.3 Societal Impacts: Sustainability, Life-Cycle Analysis, and Public Safety

7 Chapter 6: Safety, Health, and Environment

6.1 OSHA Regulations, Industrial Hygiene, and PPE 6.2 Hazard Assessment, Risk Management, and Environmental Rules 6.3 Gas Detection and Monitoring 6.4 Electrical Safety 6.5 Confined Space Entry and Ventilation Rates

8 Chapter 7: Engineering Economics

7.1 Time Value of Money, Interest Formulas, and Cash Flow Diagrams 7.2 Capital Budgeting: Present Worth, Annual Worth, IRR, and B/C Ratio 7.3 Depreciation Methods, Income Taxes, and Breakeven Analysis 7.4 Cost Analysis, Uncertainty, Expected Value, and Decision Trees

9 Chapter 8: Statics

8.1 Statics Equilibrium, Free-Body Diagrams, and Force Systems 8.2 Distributed Loads, Resultants, and Equivalent Force-Couple Systems 8.3 Internal Forces in Rigid Bodies: Trusses, Frames, Machines, and Friction 8.4 Three-Dimensional Equilibrium, Cables, and Pulley Systems 8.5 Area Properties: Centroids, Moments of Inertia, and Radius of Gyration 8.6 Weight, Mass, and Force Units: slug, lbm, lbf, and g_c

10 Chapter 9: Dynamics

9.1 Kinematics of Particles and Rigid Bodies 9.2 Newton's Second Law for Particles and Rigid Bodies 9.3 Angular Motion, Torque, and Mass Moment of Inertia 9.4 Work-Energy Principle, Power, and Efficiency 9.5 Impulse-Momentum, Impact, and Coefficient of Restitution 9.6 Dynamic Friction and Vibrations: Natural Frequency and Damping

11 Chapter 10: Strength of Materials

10.1 Stress Types, Axial Stress-Strain, and Thermal Deformation 10.2 Torsion of Circular Shafts, Polar Moment, and Angle of Twist 10.3 Shear and Moment Diagrams 10.4 Flexural Bending Stress and Transverse Shear Stress 10.5 Stress Transformations, Principal Stresses, and Mohr's Circle 10.6 Beam Deflections and Combined Axial/Bending Loading 10.7 Column Buckling (Euler Formula) and Yield/Failure Criteria

12 Chapter 11: Materials

11.1 Crystal Structure, Phase Diagrams, and Material Processing 11.2 Mechanical Properties, Fatigue, Fracture, and Corrosion 11.3 Thermal Properties of Materials 11.4 Electrical and Chemical Properties of Materials 11.5 Material Selection for Engineering Design

13 Chapter 12: Fluid Mechanics

12.1 Fluid Properties, Hydrostatic Pressure, and Manometry 12.2 Dimensionless Numbers and Flow Regimes 12.3 Continuity Equation, Bernoulli Equation, and Energy Equation 12.4 Impulse-Momentum Equation and Forces on Control Volumes 12.5 Flow in Pipes, Friction Factors (Moody Diagram), and Head Losses 12.6 Turbomachinery: Pumps, Turbines, Fans, and Compressors 12.7 Open-Channel Flow, Manning's Equation, and Drag 12.8 Fluid Transport Systems and Flow Measurement 12.9 Ideal Gas Law, Gas Mixtures, and the Real Gas Law

14 Chapter 13: Basic Electrical Engineering

13.1 Electrical Fundamentals, Ohm's Law, and DC Circuits 13.2 AC Circuits, Phasors, Impedance, and Three-Phase Power 13.3 Magnetic Fields, Induction, Transformers, and Motor Efficiency 13.4 Electrical Measuring Devices: Voltmeter, Ammeter, and Wattmeter

15 Chapter 14: Thermodynamics and Heat Transfer

14.1 First & Second Laws of Thermodynamics and Pure Substance Properties 14.2 Thermodynamic Processes and Property Diagrams (T-s, P-h, P-v) 14.3 Heat Transfer: Conduction, Convection, and Radiation 14.4 Ideal Gas Processes and Power/Refrigeration Cycles 14.5 Mass and Energy Balances on Control Volumes 14.6 Combustion and Combustion Products 14.7 Psychrometrics: Relative Humidity, Wet-Bulb Temperature, and the Psychrometric Chart

4.3 Logic Diagrams, Boolean Algebra, and Control Logic

Key Takeaways Explain This Topic AI

Logic diagrams are an explicitly named NCEES sub-topic under Instrumentation and Controls, listed alongside sensors and data acquisition.

An AND gate outputs 1 only when every input is 1; an OR gate outputs 1 when any input is 1; XOR outputs 1 only when the inputs differ.

De Morgan's theorems convert NOT(A AND B) into (NOT A) OR (NOT B) and NOT(A OR B) into (NOT A) AND (NOT B), which is how NAND and NOR circuits are simplified.

A truth table with n inputs has 2^n rows, and reading the rows where the output is 1 gives the sum-of-products expression directly.

In interlock and permissive logic, safety conditions are wired in series as an AND chain so that any single failed permissive blocks the start.

Last updated: August 2026

4.3 Logic Diagrams, Boolean Algebra, and Control Logic

The NCEES Instrumentation and Controls specification lists exactly three sub-topics: sensors, data acquisition, and logic diagrams . The first two are covered in the preceding two sections. This one is the most frequently skipped and the cheapest to learn — logic items are pure reasoning with no unit conversions and no handbook lookups, so they are among the fastest points available anywhere on the exam.

Gate Definitions and Truth Tables

A logic diagram represents a binary decision network. Each gate maps binary inputs to one binary output.

  • Gate Symbol notation Output is 1 when… Boolean form
  • AND A ⋅ B A \cdot B A ⋅ B All inputs are 1 Y = A B Y = AB Y = A B
  • OR A + B A + B A + B At least one input is 1 Y = A + B Y = A + B Y = A + B
  • NOT (inverter) A ˉ \bar{A} A ˉ The single input is 0 Y = A ˉ Y = \bar{A} Y = A ˉ
  • NAND A ⋅ B ‾ \overline{A \cdot B} A ⋅ B Not all inputs are 1 Y = A B ‾ Y = \overline{AB} Y = A B
  • NOR A + B ‾ \overline{A + B} A + B ​ All inputs are 0 Y = A + B ‾ Y = \overline{A+B} Y = A + B ​

XOR (exclusive OR) A ⊕ B A \oplus B A ⊕ B Inputs differ Y = A B ˉ + A ˉ B Y = A\bar{B} + \bar{A}B Y = A B ˉ + A ˉ B

XNOR A ⊕ B ‾ \overline{A \oplus B} A ⊕ B ​ Inputs match Y = A B + A ˉ B ˉ Y = AB + \bar{A}\bar{B} Y = A B + A ˉ B ˉ

Two-input truth table for the core gates:

  • A A A B B B AND OR NAND NOR XOR
  • 0 0 0 0 1 1 0
  • 0 1 0 1 1 0 1
  • 1 0 0 1 1 0 1
  • 1 1 1 1 0 0 0

A network with n n n inputs requires 2 n 2^n 2 n truth-table rows: 3 inputs give 8 rows, 4 inputs give 16.

Boolean Algebra Identities

  • Law Statement
  • Identity A + 0 = A A + 0 = A A + 0 = A ; A ⋅ 1 = A A \cdot 1 = A A ⋅ 1 = A
  • Null A + 1 = 1 A + 1 = 1 A + 1 = 1 ; A ⋅ 0 = 0 A \cdot 0 = 0 A ⋅ 0 = 0
  • Idempotent A + A = A A + A = A A + A = A ; A ⋅ A = A A \cdot A = A A ⋅ A = A
  • Complement A + A ˉ = 1 A + \bar{A} = 1 A + A ˉ = 1 ; A ⋅ A ˉ = 0 A \cdot \bar{A} = 0 A ⋅ A ˉ = 0
  • Absorption A + A B = A A + AB = A A + A B = A ; A ( A + B ) = A A(A+B) = A A ( A + B ) = A

Distributive A ( B + C ) = A B + A C A(B+C) = AB + AC A ( B + C ) = A B + A C ; A + B C = ( A + B ) ( A + C ) A + BC = (A+B)(A+C) A + BC = ( A + B ) ( A + C )

De Morgan A ⋅ B ‾ = A ˉ + B ˉ \overline{A \cdot B} = \bar{A} + \bar{B} A ⋅ B = A ˉ + B ˉ ; A + B ‾ = A ˉ ⋅ B ˉ \overline{A + B} = \bar{A} \cdot \bar{B} A + B ​ = A ˉ ⋅ B ˉ

De Morgan's theorems are the ones the exam tests. Read them in words: "not (both)" is the same as "either not" , and "not (either)" is the same as "neither" . Every NAND/NOR simplification question is a De Morgan question in disguise.

Worked Example: Simplify a Logic Expression

Simplify Y = ( A ˉ + B ) ‾ + A B Y = \overline{(\bar{A} + B)} + AB Y = ( A ˉ + B ) ​ + A B .

Apply De Morgan to the first term: ( A ˉ + B ) ‾ = A ⋅ B ˉ \overline{(\bar{A} + B)} = A \cdot \bar{B} ( A ˉ + B ) ​ = A ⋅ B ˉ . Y = A B ˉ + A B = A ( B ˉ + B ) = A ⋅ 1 = A Y = A\bar{B} + AB = A(\bar{B} + B) = A \cdot 1 = \boxed{A} Y = A B ˉ + A B = A ( B ˉ + B ) = A ⋅ 1 = A ​

A five-gate network collapses to a wire. Verify with the truth table: when A = 0 A=0 A = 0 , A ˉ + B \bar{A}+B A ˉ + B is 1 so its complement is 0, and A B = 0 AB = 0 A B = 0 , giving Y = 0 Y=0 Y = 0 . When A = 1 A=1 A = 1 and B = 0 B=0 B = 0 : complement of ( 0 + 0 ) (0+0) ( 0 + 0 ) is 1, so Y = 1 Y=1 Y = 1 . When A = 1 A=1 A = 1 and B = 1 B=1 B = 1 : complement of ( 0 + 1 ) (0+1) ( 0 + 1 ) is 0, but A B = 1 AB=1 A B = 1 , so Y = 1 Y=1 Y = 1 . Output tracks A A A exactly. ✓

From Truth Table to Expression: Sum of Products

To read a Boolean expression off a truth table, take every row where the output is 1 , write the AND term ( minterm ) that makes that row true, and OR the minterms together.

Consider a pump that should run when the tank level is low ( L L L ), the manual switch is on ( S S S ), and no fault is present ( F F F ):

  • L L L S S S F F F Run
  • 0 0 0 0
  • 0 1 0 0
  • 1 0 0 0
  • 1 1 0 1
  • 1 1 1 0

Only one row produces a 1, so the sum-of-products expression is a single minterm: Run = L ⋅ S ⋅ F ˉ \text{Run} = L \cdot S \cdot \bar{F} Run = L ⋅ S ⋅ F ˉ

That is a three-input AND with one inverted input — the canonical structure of a permissive chain .

Interlocks, Permissives, and Industrial Control Logic

Process control distinguishes two functions that map onto the two basic gates:

Function Logic Purpose Failure behavior

Permissive AND — all conditions must be satisfied Allows a start only when it is safe to start Any single unsatisfied permissive blocks starting

Interlock / trip OR — any condition trips Shuts equipment down when any hazard appears Any single tripped condition stops the equipment

Redundant sensing AND of two sensors, or "2-out-of-3" voting Suppresses spurious trips from one bad sensor Reduces nuisance trips; a single sensor failure does not trip

The safety logic asymmetry. Permissives are ANDed and trips are ORed, and both choices push the system toward the safe state. This is the same structure as the AND/OR gates in Fault Tree Analysis covered in the Safety, Health, and Environment chapter: an AND gate needs every input event to occur, so it models redundancy and yields a low combined probability; an OR gate needs only one , so it models single-point failure and yields a high combined probability.

Fail-Safe vs. Fail-Danger and Normally Closed Contacts

Safety-critical inputs are wired through normally closed contacts, so that a broken wire, a lost signal, or a power failure looks identical to a genuine trip and shuts the process down. A normally open contact would fail silently — a severed wire and a healthy safe condition are indistinguishable. Enable = E-Stop ‾ ⋅ HighPressure ‾ ⋅ LowLube ‾ ⋅ StartCmd \text{Enable} = \overline{\text{E-Stop}} \cdot \overline{\text{HighPressure}} \cdot \overline{\text{LowLube}} \cdot \text{StartCmd} Enable = E-Stop ​ ⋅ HighPressure ​ ⋅ LowLube ⋅ StartCmd

Reading Ladder Logic

Programmable logic controllers use ladder diagrams , in which each horizontal rung is one Boolean expression:

  • Contacts in series on a rung = AND
  • Contacts in parallel (branches) = OR
  • A slashed contact = NOT (normally closed)
  • The rightmost coil = the output

So a rung with three series contacts and one parallel branch around the middle contact reads Y = A ( B + C ) D Y = A(B + C)D Y = A ( B + C ) D . Series is AND, parallel is OR — that single mapping answers most ladder-logic items.

Worked Example: Two-out-of-Three Voting

A reactor trips on high temperature if at least two of three independent sensors read high. Write the logic and evaluate the trip probability if each sensor has a 2% chance of a spurious high reading.

Two-out-of-three voting ORs the three pairwise ANDs: Trip = A B + B C + A C \text{Trip} = AB + BC + AC Trip = A B + BC + A C

For a spurious trip, at least two must falsely read high. With p = 0.02 p = 0.02 p = 0.02 each and independence, the probability that exactly two do is 3 p 2 ( 1 − p ) = 3 ( 0.0004 ) ( 0.98 ) = 0.001176 3p^2(1-p) = 3(0.0004)(0.98) = 0.001176 3 p 2 ( 1 − p ) = 3 ( 0.0004 ) ( 0.98 ) = 0.001176 , and that all three do is p 3 = 0.000008 p^3 = 0.000008 p 3 = 0.000008 : P ( spurious trip ) = 0.001176 + 0.000008 = 0.00118 ≈ 0.12 % P(\text{spurious trip}) = 0.001176 + 0.000008 = 0.00118 \approx 0.12\% P ( spurious trip ) = 0.001176 + 0.000008 = 0.00118 ≈ 0.12%

Compare to a single sensor tripping the reactor directly, at 2 % 2\% 2% . Two-out-of-three voting cuts nuisance trips by roughly a factor of 17 while still tripping if any two real sensors agree — which is why it is the standard architecture for high-consequence shutdowns.