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?

💡 Explanation

The NOT C term becomes always false because C is always true; therefore, the expression simplifies to (A AND B) OR FALSE, which is equivalent to (A AND B). However, that section is then not OR'd with any other true value, which means regardless of A and B values, the expression would still lead to the alarm always being disarmed, rather than only when A and B are true.

• An engineer is designing a compiler that translates regular expressions into finite automata. If the regular expression contains nested quantifiers, which effect dominates during automaton construction?
• Which outcome occurs when a context-free grammar (CFG) is used to define a formal language with inherently ambiguous structures?
• A wireless router allocates bandwidth to connected devices using a greedy algorithm; which consequence follows?
• If a sorting algorithm's progress is measured by a monovariant that strictly decreases with each swap until the array is sorted, which property holds?
• A decision tree classifies network packets to detect intrusions; which outcome is most likely if the Information Gain splitting criterion excessively favors attributes with many values?
• If a Las Vegas algorithm runs for an unusually long duration on an embedded system, which consequence follows?