In programmable logic controllers (PLCs), if a sensor's boolean output indicates 'NOT (A AND B)', which equivalent expression allows simplified ladder logic implementation?

💡 Explanation

De Morgan's law dictates that NOT (A AND B) is equivalent to (NOT A) OR (NOT B); because this transformation enables direct implementation with available logic gates in the PLC. Therefore, using 'NOT A OR NOT B' simplifies the ladder logic, rather than requiring a combined AND and NOT operation.

• A security system uses a boolean expression to arm the alarm: (A AND B) OR (NOT C). If a sensor C fails, always reading TRUE, which outcome follows?
• Which outcome occurs when a context-free grammar (CFG) is used to define a formal language with inherently ambiguous structures?
• If a university course timetable can be represented as a bipartite graph, where courses and time slots are nodes, which outcome guarantees conflict-free scheduling?
• A database server must handle increasing read queries; which mechanism explains why response time degrades linearly as a function of records using sequential search?
• A large language model struggles to generate coherent summaries. Which algorithm design paradigm best guides creating a more effective, modular summary approach?
• If a network switch is configured to forward packets based on MAC address and all possible MAC addresses are assigned, which outcome is unavoidable?