Bissoy.com
Doctors Medicines MCQs Q&A

Which one of the following Boolean expressions is NOT a tautology?

Which one of the following Boolean expressions is NOT a tautology? Correct Answer <span class="math-tex">\((a↔c)→(∼b→(a∧c))\)</span>

(i) Tautology: Implication is transitive.

(ii). Contingency: Truth value of this formula depends upon the values of a, b and c.

(iii). Tautology: Consequent clearly follows from antecedent.

(iv). Tautology: a->b is false only when a is true and b is false.

Related Questions

A tautology is a Boolean formula that is always true. Which of the following is a tautology? 
interface Base{ boolean m1 (); byte m2(short s);}

which two code fragments will compile?
1. interface Base2 implements Base {}2. abstract class Class2 extends Base { public boolean m1(){ return true; }}3. abstract class Class2 implements Base {}4. abstract class Class2 implements Base { public boolean m1(){ return (7 > 4); }}5. abstract class Class2 implements Base { protected boolean m1(){ return (5 > 7) }}
Which one of the following Boolean expressions is a tautology?
Which of the following problems is NOT NP-complete? I. Checking satisfiability of arbitrary Boolean formulae II. Checking satisfiability of Boolean formulae in conjunctive normal form (CNF/product of sums) III. Checking satisfiability of Boolean formulae in disjunctive normal form (DNF/sum of products)
Any set of Boolean operators that is sufficient to represent all Boolean expressions is said to be complete. Which of the following is not complete?
Suppose we want to design a synchronous circuit that processes a string of 0’s and 1’s. Given a string, it produces another string by replacing the first 1 in any subsequence of consecutive 1’s by a 0. Consider the following example. Input sequence: 00100011000011100 Output sequence: 00000001000001100 A Mealy Machine is a state machine where both the next state and the output are functions of the present state and the current input. The above mentioned circuit can be designed as a two-state Mealy machine. The states in the Mealy machine can be represented using Boolean values 0 and 1. We denote the current state, the next state, the next incoming bit, and the output bit of the Mealy machine by the variables s, t, b and y respectively. Assume the initial state of the Mealy machine is 0. What are the Boolean expressions corresponding to t and y in terms of s and b ?
Consider the following Boolean expressions: I: x.y + x'y' II: XOR (x', y') III: XOR (x', y) Which of the above expressions represents exclusive NOR operation?
BOOLEAN is a type of data type which basically gives a tautology or fallacy.
You are given a boolean expression which consists of operators &, | and ∧ (AND, OR and XOR) and symbols T or F (true or false). You have to find the number of ways in which the symbols can be parenthesized so that the expression evaluates to true. This is the boolean parenthesization problem. Which of the following methods can be used to solve the problem?
Which one of the following statements is not a tautology?