Short MCQ-style retrieval prompts. Tap a card to reveal the answer.
PYQTap to reveal →
A combinational logic circuit is one where the output:
B · B. depends only on the current state of the inputs
PYQTap to reveal →
A logic circuit with three inputs needs a truth table with:
C · C. 8 rows
PYQTap to reveal →
Consider the following statements: 1. All cats are mammals. 2. Some mammals are black. Which of the following conclusions logically follows?
D · D. None of the above
PYQTap to reveal →
Given the statement: 'If it rains, then the ground is wet.' Which of the following is logically equivalent?
C · C. If the ground is not wet, then it does not rain.
PYQTap to reveal →
Statements: 1. Either Ramesh is telling the truth or Suresh is lying. 2. Ramesh and Suresh cannot both be telling the truth. Conclusion: Suresh is lying.
A · A. Conclusion definitely follows
PYQTap to reveal →
Statements: I. Eina is older than Fatima. II. Fatima is older than Gina. III. Gina is older than Eina. If I and II are true, then III is:
B · B. False
PYQTap to reveal →
Which of the following is a logical statement? 1. Zero times any real number is zero. 2. 2 + 3 = 6. 3. Where are you?
C · C. 1 and 2 only
PYQTap to reveal →
Statements:
All dogs are mammals.
Some mammals are cats.
Conclusions:
I. All dogs are cats.
II. Some cats are dogs.
Which of the conclusions logically follows?
D · Neither I nor II follows
PYQTap to reveal →
Paul and Brian both finished before Liam. Owen did not finish last. Who was the last to finish?
C · Liam
Paul and Brian finished before Liam, so neither Paul nor Brian was last. Owen did not finish last. Therefore, by process of elimination, Liam must have been the last to finish. Correct answer is C.
PYQTap to reveal →
Statements:
If the ground is wet, then it rained.
The ground is wet.
Conclusions:
I. It rained.
II. If it rained, the ground is wet.
C · Both I and II follow
PYQTap to reveal →
Identify the type of reasoning used in the following statement: 'I got up at nine o’clock for the past week. I will get up at nine o’clock tomorrow.'
A. Inductive B. Deductive C. Both D. Neither
A · Inductive
PYQTap to reveal →
Identify the type of reasoning used in the following statement: 'James Cameron’s last three movies were successful. His next movie will be successful.'
A. Inductive B. Deductive C. Both D. Neither
A · Inductive
PYQTap to reveal →
Identify the type of reasoning used in the following statement: 'In the sequence 1, 2, 4, 7, 11, 16 the next most probable number is 22.'
A. Inductive B. Deductive C. Both D. Neither
A · Inductive
PYQTap to reveal →
Determine the most probable next term in the sequence: 1, 2, 4, 7, 11, 16, ___. Choose the correct option.
A. 20 B. 21 C. 22 D. 23
C · 22
PYQTap to reveal →
The garbage truck comes every other Tuesday. It did not come last Tuesday. It will come this Tuesday. Identify the reasoning type.
A. Inductive B. Deductive C. Both D. Neither
A · Inductive
PYQTap to reveal →
Gas prices have gone down every day this week. Therefore, gas prices will go down tomorrow. Identify the reasoning process.
A. Inductive B. Deductive C. Invalid D. None
A · Inductive
This is **inductive reasoning**, generalizing from specific daily observations to predict tomorrow's trend. Inductive conclusions are probable, not guaranteed.
PYQ · 2021Tap to reveal →
With few exceptions, doctors are untrustworthy. My last doctor was caught taking advantage of insurance policies so he can stuff his pockets.
C · C. Hasty generalization
PYQ · 2021Tap to reveal →
Oh don’t tell me climate change is real. I went to a conference where the speaker said it was a hoax.
B · B. Ad hominem (guilt by association)
PYQ · 2021Tap to reveal →
What fallacy/tactic (if any) is person B committing? Person A: 'The evidence clearly shows climate change is human-caused.' Person B: 'But it could just be natural cycles—it's possible.'
B · B. Appeal to possibility
PYQTap to reveal →
The fallacy that occurs when an arguer bases an inductive argument on an insufficient observations or an unrepresentative sample is known as:
A · A. Hasty Generalization
PYQTap to reveal →
Determine the validity of the following argument:
Premise 1: If I plant a tree, then I will get dirt under my nails.
Premise 2: I didn't get dirt under my nails.
Conclusion: Therefore, I didn't plant a tree.
A · A. Valid
PYQTap to reveal →
Test the validity of the following argument:
Premise 1: If I don't tie my shoes, then I trip.
Premise 2: I didn't tie my shoes.
Conclusion: Hence, I tripped.
B · B. Invalid
PYQTap to reveal →
Determine whether the following argument is valid:
Premise 1: All racers live dangerously.
Premise 2: Gomer is a racer.
Conclusion: Therefore, Gomer lives dangerously.
A · A. Valid
PYQTap to reveal →
Assess the validity of this argument:
Premise 1: If you are kind to a puppy, then he will be your friend.
Premise 2: You weren't kind to that puppy.
Conclusion: Hence, he isn't your friend.
B · B. Invalid
Question bankTap to reveal →
Which of the following is the correct symbol for a NAND gate?
A · A standard AND gate symbol with a small circle (inversion bubble) at the output
A NAND gate is represented as an AND gate symbol with an inversion bubble (small circle) at the output, indicating the NOT operation is applied to the AND output.
Question bankTap to reveal →
What is the output of a NOT gate when the input is 1?
A · 0
A NOT gate inverts the input; if the input is 1, the output will be 0.
Question bankTap to reveal →
Refer to the diagram below. Which gate is represented by the symbol shown?
B · XOR gate
The symbol with a curved input side and a pointed output side with one inversion bubble is an XOR gate symbol.
Question bankTap to reveal →
Refer to the truth table below for two inputs A and B. What is the output for the given inputs if the gate is an AND gate?
A
B
Output
0
0
?
0
1
?
1
0
?
1
1
?
A · 0, 0, 0, 1
An AND gate outputs 1 only when both inputs are 1; otherwise, output is 0.
Question bankTap to reveal →
Refer to the truth table below for inputs A and B. Which logic gate corresponds to this truth table?
A
B
Output
0
0
1
0
1
1
1
0
1
1
1
0
A · NAND gate
This truth table matches the NAND gate output which is the complement of AND gate output.
Question bankTap to reveal →
For a logic circuit with three inputs, how many rows should the complete truth table have?
B · 8
The truth table has \( 2^n \) rows, where \( n \) is the number of inputs. For 3 inputs, rows = \( 2^3 = 8 \).
Question bankTap to reveal →
Refer to the diagram below. What is the Boolean expression of the combinational logic circuit shown?
D · \( (A + B) \cdot \overline{C} \)
The circuit diagram shows an OR gate with inputs A, B, followed by a NOT gate on input C, and then an AND gate combining these outputs resulting in \( (A + B) \cdot \overline{C} \).
Question bankTap to reveal →
Which Boolean expression correctly represents the output of the circuit composed of an AND gate followed by a NOT gate with inputs A and B?
B · \( \overline{A \cdot B} \)
The circuit is a NAND gate, whose output is the complement of AND, i.e., \( \overline{A \cdot B} \).
Question bankTap to reveal →
Refer to the diagram below. What is the output expression for this logic circuit?
B · \( (\overline{A} + B) \cdot C \)
The circuit shows inputs A through a NOT gate, and inputs B, C into an AND gate, then the outputs feed into an AND gate, making the expression \( (\overline{A} + B) \cdot C \).
Question bankTap to reveal →
Simplify the Boolean expression \( A \cdot \overline{A} + A \cdot B \) using Boolean algebra identities.
B · \( A \cdot B \)
Using the complement property, \( A \cdot \overline{A} = 0 \), so the expression simplifies to \( 0 + A \cdot B = A \cdot B \).
Question bankTap to reveal →
Which Boolean identity justifies the simplification of \( A + A \cdot B = A \)?
B · Absorption Law
The absorption law states \( A + A \cdot B = A \), which simplifies expressions by absorbing redundant terms.
Question bankTap to reveal →
Simplify the Boolean expression \( \overline{\overline{A} + B} + A \) to one of the following expressions.
B · \( 1 \)
Using De Morgan's theorem and the complement rule, the expression simplifies to 1 (always true).
Question bankTap to reveal →
Refer to the diagram below. Which of the following best describes the output behavior of this logic circuit for inputs A and B?
B · Output is low only when both inputs are high
The circuit shows an AND gate followed by a NOT gate (NAND gate). The output is low only when both inputs are high.
Question bankTap to reveal →
Refer to the diagram below. What logic function does this circuit implement?
A · XOR of inputs A and B
The circuit consists of an OR gate, two NAND gates, and an AND gate arranged in a standard XOR gate implementation.
Question bankTap to reveal →
Consider the logic circuit composed of two NOT gates and one OR gate as shown in the diagram. What is the simplified Boolean expression of the output?
A · \( A \cdot B \)
By applying De Morgan's Law twice (NOT gates on inputs and OR gate), the output simplifies to \( A \cdot B \).
Question bankTap to reveal →
Which of the following is the correct result of the Boolean operation \( A + 0 \)?
A · A
In Boolean algebra, the OR operation with 0 leaves the variable unchanged, so \( A + 0 = A \).
Question bankTap to reveal →
What is the result of the Boolean expression \( A \cdot 1 \)?
C · A
In Boolean algebra, the AND operation with 1 leaves the variable unchanged, so \( A \cdot 1 = A \).
Question bankTap to reveal →
The Boolean product \( A \cdot \overline{A} \) equals:
A · 0
The product of a variable and its complement is always 0, because both cannot be true simultaneously.
Question bankTap to reveal →
Refer to the diagram below showing a truth table for \( A + B \). What is the output when \( A=0 \) and \( B=1 \)?
A
B
Output (A+B)
0
0
0
0
1
?
1
0
1
1
1
1
B · 1
The OR operation outputs 1 if at least one input is 1. Here, \( B=1 \) so the output is 1.
Question bankTap to reveal →
According to the Boolean identity laws, what is \( A + A \)?
A · A
Idempotent law states \( A + A = A \).
Question bankTap to reveal →
Which Boolean law justifies the expression \( A \cdot (B + C) = A \cdot B + A \cdot C \)?
A · Distributive Law
This is the distributive law of Boolean algebra.
Question bankTap to reveal →
Simplify the Boolean expression \( \overline{\overline{A} + B} \) using Boolean laws.
A · \( A \cdot \overline{B} \)
Using De Morgan's Theorem: \( \overline{\overline{A} + B} = A \cdot \overline{B} \).
Question bankTap to reveal →
Refer to the Karnaugh map below with variables \( A \) and \( B \):
B=0
B=1
A=0
1
0
A=1
1
1
Which is the minimal Boolean expression from this K-map?
B · \( \overline{B} + A \)
Grouping covers cells where output is 1 for \( \overline{B} + A \).
Question bankTap to reveal →
Refer to the truth table below of a logical function \( F \) with inputs \( A \) and \( B \). What logical operation does it represent?
A
B
F
0
0
0
0
1
1
1
0
1
1
1
0
A · XOR
The output is 1 when inputs differ, which is the XOR operation.
Question bankTap to reveal →
If the logical function \( F = A \cdot B + \overline{A} \cdot \overline{B} \), what is the equivalent logical operation?
A · XNOR
Function outputs 1 when inputs are equal; this is XNOR operation.
Question bankTap to reveal →
What is the output for the logic function \( F = A + B \) when both \( A \) and \( B \) are 0 according to the truth table below?
A
B
F
0
0
?
0
1
1
1
0
1
1
1
1
A · 0
Since both inputs are 0, OR operation output is 0.
Question bankTap to reveal →
Which Boolean expression is the simplified form of \( (A + B) \cdot (A + \overline{B}) \)?
A · A
Distributive law and absorption simplify it to \( A \).
Question bankTap to reveal →
Simplify the Boolean expression \( A \cdot \overline{B} + A \cdot B \).
A · A
By factoring \( A \), we get \( A (\overline{B} + B) = A \cdot 1 = A \).
Question bankTap to reveal →
Refer to the Karnaugh map below for variables \( A, B, C \):
AB\C
0
1
00
0
1
01
1
1
11
1
0
10
0
1
. What is the simplified expression?
A · \( B \cdot C + \overline{A} \cdot B \)
Groups cover the 1s corresponding to \( B \cdot C \) and \( \overline{A} \cdot B \).
Question bankTap to reveal →
Which of the following logic gates produces the output \( Y = \overline{A} \)?
A · NOT gate
The NOT gate inverts the input signal \( A \), producing \( \overline{A} \).
Question bankTap to reveal →
Refer to the logic gate circuit diagram below.
What is the Boolean expression for output \( Y \)?
A · \( \overline{A \cdot B} \)
The circuit is an AND gate followed by a NOT gate, so output is NAND: \( \overline{A \cdot B} \).
Question bankTap to reveal →
Which Boolean expression corresponds to the circuit below?
Inputs on the left are \( A \) (top) and \( B \) (bottom).
A · \( A + A \cdot B \)
The OR gate takes input \( A \) and output of AND gate \( A \cdot B \), so output is \( A + A \cdot B \).
Question bankTap to reveal →
Using De Morgan's Theorem, which expression is equivalent to \( \overline{A \cdot B} \)?
A · \( \overline{A} + \overline{B} \)
De Morgan's Theorem states \( \overline{A \cdot B} = \overline{A} + \overline{B} \).
Question bankTap to reveal →
Refer to the diagram below showing the equality of \( \overline{A + B} \) and its equivalent expression.
What is the equivalent expression for \( Y \)?
A · \( \overline{A} \cdot \overline{B} \)
By De Morgan's Theorem, \( \overline{A + B} = \overline{A} \cdot \overline{B} \).
Question bankTap to reveal →
Which of the following expressions is a result of applying De Morgan’s law to \( \overline{A \cdot B \cdot C} \)?
A · \( \overline{A} + \overline{B} + \overline{C} \)
De Morgan's Theorem for multiple variables converts AND inside complement to OR outside complement with complemented variables.
Question bankTap to reveal →
In a Boolean logic circuit, which application does the expression \( F = A \cdot \overline{B} + \overline{A} \cdot B \) represent?
A · Exclusive OR (XOR) gate function
The expression is the standard form for the XOR operation, outputting 1 when inputs differ.
Question bankTap to reveal →
Refer to the logic circuit diagram below which implements a Boolean function:
Inputs \( A \) (top), \( B \) (middle). What Boolean function is implemented by this circuit?
A · \( A \cdot B + \overline{B} \)
The circuit ORs an AND gate output \( A \cdot B \) with a NOT gate output \( \overline{B} \).
Question bankTap to reveal →
Simplify \( (A + B)(\overline{A} + C) \) using Boolean algebra.
A · \( A \cdot C + B \cdot \overline{A} \)
Applying distribution and absorption laws, \( (A + B)(\overline{A} + C) = A \cdot C + B \cdot \overline{A} \).
Question bankTap to reveal →
Refer to the truth table below for inputs \( A, B, C \) and output \( F \). What logic function is represented?
A
B
C
F
0
0
0
0
0
0
1
1
0
1
0
1
0
1
1
0
1
0
0
1
1
0
1
0
1
1
0
0
1
1
1
1
A · \( A \oplus B \oplus C \) (Triple XOR)
Output is 1 if an odd number of inputs are 1; this matches triple XOR operation.
Question bankTap to reveal →
Which Boolean law states that \( A + \overline{A} \cdot B = A + B \)?
A · Absorption Law
The absorption law simplifies expressions by eliminating redundant terms as shown.
Question bankTap to reveal →
Refer to the circuit diagram below showing two NOT gates, an AND gate, and an OR gate:
If inputs \( A \) and \( B \) are applied, what is the output \( F \)?
A · \( \overline{A} + \overline{B} \)
The circuit performs NOT on both inputs and OR results; equivalent to \( \overline{A} + \overline{B} \).
Question bankTap to reveal →
Which of the following statements correctly describes the AND operation in Boolean algebra?
B · The output is 1 only if all inputs are 1
The AND operation results in 1 only when all inputs are 1; otherwise, the output is 0.
Question bankTap to reveal →
What is the output of the Boolean NOT operation when applied to input 0?
B · 1
The NOT operation inverts the input, so NOT 0 = 1.
Question bankTap to reveal →
Which Boolean operation gives output 1 when at least one of the inputs is 1?
B · OR
The OR operation outputs 1 if any input is 1.
Question bankTap to reveal →
If A = 1 and B = 0, what is the result of \( (A \land \overline{B}) \lor (\overline{A} \land B) \)?
Complete the truth table for the function \( F = A \land (B \lor C) \). Refer to the diagram below:
A · F is 1 when A=1 and either B=1 or C=1
The AND with A requires A=1, and inside OR requires either B=1 or C=1 to get output 1.
Question bankTap to reveal →
Refer to the truth table below. Which Boolean function does it represent?
X
Y
F
0
0
1
0
1
0
1
0
0
1
1
0
A · \( \overline{X} \cdot \overline{Y} \)
Output is 1 only when both inputs are 0, so function is \( \overline{X} \cdot \overline{Y} \).
Question bankTap to reveal →
Which of the following truth tables corresponds to the NOR gate?
A · Output is 1 only when both inputs are 0
NOR gate outputs 1 only when all inputs are 0, otherwise output is 0.
Question bankTap to reveal →
In a truth table with three inputs, how many rows will it contain?
D · 8
A truth table for n inputs has \( 2^n \) rows; for 3 inputs, \( 2^3 = 8 \).
Question bankTap to reveal →
Identify the logic gate represented by the symbol with a curved input line, one bubble at the output, and two inputs.
A · NAND gate
A curved symbol with a bubble at output and multiple inputs represents NAND gate.
Question bankTap to reveal →
Refer to the diagram below showing a logic gate with two inputs and an output with a small circle at the output end. Identify the gate.
B · NAND Gate
The small circle (bubble) at the output indicates a NOT operation, so AND followed by NOT is NAND gate.
Question bankTap to reveal →
Which logic gate performs the Boolean operation \( F = \overline{A + B} \)?
B · NOR Gate
The NOR gate output is the complement of the OR operation: \( \overline{A + B} \).
Question bankTap to reveal →
Given the circuit diagram below with inputs A and B going through an OR gate whose output is connected to a NOT gate, what is the output expression?
B · \( \overline{A + B} \)
The NOT gate inverts the OR gate output, so output is \( \overline{A + B} \).
Question bankTap to reveal →
According to De Morgan's Theorems, the expression \( \overline{A \cdot B} \) is equivalent to:
A · \( \overline{A} + \overline{B} \)
De Morgan's first theorem: \( \overline{A \cdot B} = \overline{A} + \overline{B} \).
Question bankTap to reveal →
Simplify \( \overline{A + B} \) using De Morgan's Theorem.
B · \( \overline{A} \cdot \overline{B} \)
De Morgan's second theorem states \( \overline{A + B} = \overline{A} \cdot \overline{B} \).
Question bankTap to reveal →
Refer to the diagram below that illustrates the transformation of \( \overline{(A + B)} \) using De Morgan's theorem. What is the next step?
B · \( \overline{A} \cdot \overline{B} \)
According to De Morgan's theorem, \( \overline{(A + B)} \) converts to \( \overline{A} \cdot \overline{B} \).
Question bankTap to reveal →
Which is the equivalent expression for \( \overline{(A \cdot (B + C))} \) using De Morgan's Theorem?
D · \( \overline{A} + \overline{B} \cdot \overline{C} \)
Question bankTap to reveal →
A logic circuit uses the Boolean expression \( F = \overline{(A + B)} \cdot C \). Which logic gates are required to implement this function?
A · An OR gate, a NOT gate, and an AND gate
The expression \( \overline{(A + B)} \cdot C \) requires an OR gate (for \(A + B\)), a NOT gate to invert the output, and an AND gate to AND with C.
Question bankTap to reveal →
Refer to the logic circuit diagram below. What is the Boolean expression for the circuit?
C · \( \overline{A + B} \cdot C \)
The circuit shows inputs A and B into an OR gate, output connected to a NOT gate, then ANDed with input C, which matches \( \overline{A + B} \cdot C \).
Question bankTap to reveal →
Which simplified Boolean expression represents the output of a logic circuit that has a NAND gate followed by a NOT gate?
A · \( A \cdot B \)
NAND gate output is \( \overline{A\cdot B} \). Passing it through a NOT gate inverts again producing \( A\cdot B \).
Question bankTap to reveal →
Refer to the circuit diagram below. The circuit consists of an AND gate whose output is connected to a NOT gate. The inputs are A and B. What is the truth table output?
A · Output is 0 only if both A and B are 1
This circuit is a NAND gate, whose output is 0 only if both inputs are 1, output is 1 otherwise.
Question bankTap to reveal →
Given three Boolean variables A, B, and C, consider the expression:
F = ((A + B').(A' + C)) + (A.B.C')
Which of the following is logically equivalent to F?
A · A + B'.C
Question bankTap to reveal →
Consider a function F(A,B,C) defined by the expression:
F = (A + B).(A' + C).(B + C') + A'.B'.C
Which of the following expressions is equivalent to F after minimal sum-of-products simplification?
D · A.B + C.(A' + B')
Question bankTap to reveal →
If A, B, and C are Boolean variables where C = A'.B + A.B', find the simplified expression for:
F = (A + B + C) (A'.B + C') + (A.B.C)'
Which of the following represents F?
B · 1 (i.e., always TRUE)
Question bankTap to reveal →
Given the Boolean expression:
F = ((A' + B.C)'.B)' + (A.B')
Which one of the following is the correct simplified equivalent for F?
A · A + B'
Question bankTap to reveal →
Assertion (A): The expression (A + B)'.(A' + B) + A.B = A'.B + A.B' + A.B
Reason (R): Using the consensus theorem, the expression simplifies to A + B
Choose the correct option:
C · A is true, R is false
Question bankTap to reveal →
Consider three Boolean variables A, B, C where C = A XOR B.
Evaluate the Boolean function:
F = (A + B + C')(A' + B' + C)(A + B' + C)
Which of the following represents the minimal equivalent expression of F?
B · 1 (Always True)
Question bankTap to reveal →
Which of the following is the correct minimal form of the Boolean expression:
F = (A + B').(A + C') + (A'.B.C)?
A · A + B'.C' + A'.B.C
Question bankTap to reveal →
Consider the Boolean function:
F = (A + B + C)(A'.B + B.C')(A + B'.C)
Which of the following expressions represents F in minimal sum-of-products form?
C · A.B + B.C'
Question bankTap to reveal →
If F = (A + B.C')(A' + C) + B'(A + C'), then which of the following is F equivalent to?
C · A + C + B'
Question bankTap to reveal →
The function F(A,B,C) is defined as:
F = ((A.B') + (A'.C)) . ((B + C)') + A.B.C
Which one of the following is the correct minimal sum-of-products form for F?
A · A'.B'.C + A.B.C
Question bankTap to reveal →
Find the minimal form of the Boolean expression:
F = ((A + B').C') + ((A'.B) + C).B'
Which is correct?
D · A.C' + B' + A'.B
Question bankTap to reveal →
Given that X and Y are Boolean variables, and Z = X' + Y.'
Evaluate the function:
F = (X + Y + Z) . (X' + Y + Z') . (X + Y' + Z)
Which simplified Boolean expression represents F?
A · X + Y
Question bankTap to reveal →
Which of the following Boolean expressions simplifies to the minimal expression A'.B + A.B' + A.B after applying consensus and absorption theorems?
A · (A + B').(A' + B) + A.B
Question bankTap to reveal →
If F = (A.B + A'.C')(A + B'), then the minimal form of F is:
D · A.B + A'.B'.C'
Question bankTap to reveal →
Given Boolean variables A, B, and C, let:
X = A + B.C'
Y = (A' + B').(C + A)
Find the simplified form of X + Y'?
A · A + B + C'
Question bankTap to reveal →
Which of the following best describes deductive reasoning?
B · Reaching a conclusion that is necessarily true if the premises are true
Deductive reasoning starts from general premises and reaches a conclusion that must be true if the premises are true.
Question bankTap to reveal →
Which statement correctly identifies the nature of a deductive argument?
B · The conclusion follows logically and necessarily from the premises
In deductive arguments, the conclusion necessarily follows from the premises.
Question bankTap to reveal →
Consider the following deductive argument: "All birds have feathers. Penguins are birds. Therefore, penguins have feathers." What type of reasoning is used here?
B · Deductive reasoning
This argument applies general premises to reach a certain conclusion, characteristic of deductive reasoning.
Question bankTap to reveal →
Which of the following is the symbol representing the logical AND operation?
A · \u2227
The symbol \u2227 represents logical AND, meaning both operands must be true.
Question bankTap to reveal →
Which truth table corresponds to the logical OR operation?
A · Input A | Input B | Output 0 | 0 | 0 0 | 1 | 1 1 | 0 | 1 1 | 1 | 1
Logical OR outputs 1 if at least one input is 1.
Question bankTap to reveal →
If \( p \) and \( q \) are propositions, which expression is equivalent to \( eg(p \wedge q) \) according to De Morgan's law?
A · \( eg p \vee eg q \)
De Morgan’s law states that \( eg(p \wedge q) = eg p \vee eg q \).
Question bankTap to reveal →
Refer to the logic circuit diagram below. What logical expression does it represent?
B · \( (A \wedge B) \wedge (A \vee B) \)
The diagram shows an AND gate feeding into an OR gate; the output is the AND of \( A \wedge B \) and \( A \vee B \).
Question bankTap to reveal →
Refer to the truth table below. What logical connective does it represent?
P
Q
Output
0
0
1
0
1
1
1
0
1
1
1
0
A · NAND
The output is false only when both inputs are true, characteristic of the NAND operation.
Question bankTap to reveal →
What is the main purpose of a truth table in logic?
A · To illustrate all possible outcomes of logical expressions
Truth tables demonstrate the output values for all possible input combinations in logical expressions.
Question bankTap to reveal →
Refer to the truth table below and identify the logical expression:
P
Q
Output
0
0
0
0
1
1
1
0
1
1
1
0
C · \( P \oplus Q \) (XOR)
This table matches the exclusive OR operation, which outputs true if inputs differ.
Question bankTap to reveal →
Which of the following statements is valid in a deductive argument?
B · The conclusion must be true if the premises are true and the argument is valid
Validity in deductive arguments ensures that true premises guarantee a true conclusion.
Question bankTap to reveal →
Which of the following indicates an invalid deductive argument?
B · If it rains, the ground is wet. The ground is wet. Therefore, it rains.
This is an example of affirming the consequent, an invalid deductive form.
Question bankTap to reveal →
Identify the fallacy in the argument: "If it is snowing, it is cold. It is cold. Therefore, it is snowing."
A · Affirming the consequent
The conclusion assumes that coldness only results from snowing, affirming the consequent fallacy.
Question bankTap to reveal →
Which of the following is an example of denying the antecedent fallacy?
A · If it rains, the ground is wet. It is not raining. Therefore, the ground is not wet.
Denying the antecedent falsely concludes the negation of the consequent from the negation of the antecedent.
Question bankTap to reveal →
A logical puzzle states: "If the switch is on, the light is on. The light is off. What can you deduce?" Choose the correct conclusion.
B · The switch is off
From the premise and the light being off, by modus tollens, the switch must be off.
Question bankTap to reveal →
Statements P, Q, and R satisfy: (1) P implies Q and R are not both true. (2) Q implies if R then P. (3) R is false only if P is false. What can be concluded?
B · If Q is true, P must be true
Question bankTap to reveal →
Consider: "If S and T are both true, then U is false. If U is true, then at most one of S and T is true." Further, "Exactly two of the three statements S, T, U are true." Which is necessarily false?
D · U is false and exactly one of S or T is false
Question bankTap to reveal →
In a logical setup, statements A, B, C satisfy these: (i) If A is false, then B is true. (ii) If B is false, then C is true. (iii) If C is false, then A is true. Which of the following statements must be true?
B · At least one of A, B, C is true
Question bankTap to reveal →
Given that propositions P, Q, R satisfy: (1) P ∨ Q is true. (2) If R is true, then exactly one of P or Q is false. (3) If P is true, then R is false. Which of the following must hold?
B · If Q is false, then R is false
Question bankTap to reveal →
Assertion (A): "If W implies X, and X implies Y, then W implies Y." Reason (R): "This is an example of transitivity of implication". Choose the correct option:
A · Both A and R are true, and R explains A
Question bankTap to reveal →
If for logical statements A, B, C these conditions hold: (1) A or (B and C) is true. (2) If A is false, then B is false. (3) C is true only if A is true. Which of the following must be false?
D · A is false and C true
Question bankTap to reveal →
In a system of propositions P, Q, R, it is given that: (i) If P then (Q if and only if not R). (ii) If Q then P is false. (iii) Exactly one of P, Q, R is true. Which one of the following is correct?
C · R is true, P and Q are false
Question bankTap to reveal →
Suppose statements X, Y satisfy these properties: (1) If X is true, then Y is false. (2) If Y is true, then X is false. (3) X or Y is true. Which of the following must be true?
A · Exactly one of X or Y is true
Question bankTap to reveal →
Given propositions A, B, C: (i) If A then B is true. (ii) If B is false, then C is true. (iii) C is false only if A is false. Which of the following is false?
C · If B is true, then A is true
Question bankTap to reveal →
Which of the following best describes the Principle of Mathematical Induction?
C · Prove a statement for a base case and then assume it holds for \( k \) to prove for \( k+1 \)
The Principle of Mathematical Induction involves proving the base case and then assuming the statement is true for \( n=k \) to prove it true for \( n=k+1 \).
Question bankTap to reveal →
Refer to the diagram below showing the induction steps. Which step represents the inductive hypothesis?
B · Step 2: Assume the statement is true for \( n=k \)
The inductive hypothesis is the assumption that the statement holds true for some arbitrary \( n=k \), which is step 2 in the induction flow.
Question bankTap to reveal →
Which of the following statements is NOT a valid base case for induction over natural numbers starting at 1?
D · Prove a statement for \( n=-1 \)
For induction starting at 1, base cases should be natural numbers \( \geq 1 \). Negative numbers like \( n=-1 \) are not in the domain, so this is invalid.
Question bankTap to reveal →
Strong induction differs from ordinary induction in that it assumes the truth of the statement for:
B · All cases from the base case up to \( k \)
Strong induction assumes the statement to be true for all values from the base up to \( n=k \), then proves it for \( n=k+1 \).
Question bankTap to reveal →
Refer to the diagram below illustrating a strong induction proof. What is the key difference highlighted compared to ordinary induction?
C · Inductive step assumes statement for all \( n \leq k \)
Strong induction uses the assumption that all previous cases up to \( n=k \) are true to prove \( n = k+1 \), unlike ordinary induction which assumes only \( n = k \).
Question bankTap to reveal →
Which problem is best solved using strong induction instead of ordinary induction?
B · Show that every integer greater than 1 is a product of primes
The Fundamental Theorem of Arithmetic (prime factorization) requires strong induction as the inductive step depends on multiple previous cases.
Question bankTap to reveal →
In the logical structure of induction proof, which component ensures that the induction chain starts?
C · Base case
The base case verifies the initial value for which the statement holds, starting the induction process.
Question bankTap to reveal →
Which of the following is the correct order of components in a typical induction proof?
B · Base case \( \to \) Inductive hypothesis \( \to \) Inductive step
The proof begins with the base case, then assumes the inductive hypothesis, and finally proves the inductive step.
Question bankTap to reveal →
Refer to the flowchart below illustrating induction proof steps. Which statement correctly matches the step labeled 'P(k) assumed'?
B · Inductive Hypothesis
In the flowchart, 'P(k) assumed' corresponds to the inductive hypothesis where the statement for \( n=k \) is assumed true.
Question bankTap to reveal →
Which of the following sums can be most straightforwardly proven by mathematical induction?
A · \( \sum_{i=1}^n i^2 = \frac{n(n+1)(2n+1)}{6} \)
Sum of squares formula is a classic example typically proven by induction; harmonic sums and Basel problem sums require advanced methods.
Question bankTap to reveal →
Refer to the sequence illustrated in the diagram below. Which induction step would be used to prove that \( a_n = 3^n \) for all \( n \geq 1 \)?
A · Assume \( a_k = 3^k \) and prove \( a_{k+1} = 3^{k+1} \)
In induction on sequences, the inductive step uses the assumption for \( n=k \) to prove for \( n=k+1 \).
Question bankTap to reveal →
Which inequality can be proved using induction on inequalities?
A · \( 2^n > n^2 \) for all \( n \geq 5 \)
The inequality \( 2^n > n^2 \) for large \( n \) is a classic induction proof example on inequalities.
Question bankTap to reveal →
Using induction, which divisibility statement is true for all \( n \geq 1 \)?
A · \( 7^n - 1 \) is divisible by 6
Using induction, it can be shown that \( 7^n - 1 \) is divisible by 6 for all \( n \geq 1 \).
Question bankTap to reveal →
Refer to the inequality illustrated in the diagram below for \( n=3 \). Which induction step should be used to prove \( 2^n > n^2 \) holds for all \( n \geq 5 \)?
A · Assume true for \( n=k \) and prove for \( n=k+1 \)
The induction step requires assuming the inequality for \( n=k \) and proving it for \( n=k+1 \).
Question bankTap to reveal →
Which of the following best describes the Principle of Mathematical Induction?
A · A method to verify a statement for all natural numbers by proving it for a base case and an inductive step
Question bankTap to reveal →
In the induction process, why is the base case verification necessary?
A · To establish the truth of the statement for the first natural number, which serves as the starting point for induction
The base case confirms the statement holds for the smallest value, forming the foundation on which the inductive step builds.
Question bankTap to reveal →
Refer to the diagram below which illustrates a flowchart of induction proof steps. Which transition correctly represents the inductive step?
A · From 'Assume P(k) is true' to 'Prove P(k+1) is true'
The inductive step assumes P(k) true and then proves P(k+1) true to complete induction.
Question bankTap to reveal →
For the proposition \( P(n): n^2 + n \) is even for all natural numbers \( n \), what should be the inductive hypothesis?
A · \( P(k): k^2 + k \) is even, assumed true for some arbitrary \( k \)
The inductive hypothesis assumes the proposition holds for an arbitrary natural number \( k \) to prove it for \( k+1 \).
Question bankTap to reveal →
Which of the following is an example of a common pitfall in applying mathematical induction?
A · Assuming the statement is true for \( n=k \) without proving the base case
Skipping or failing to prove the base case invalidates the inductive proof as it lacks a foundation.
Question bankTap to reveal →
Refer to the truth table below. Using induction, which pattern can be proved about the number of 1's in the output of \( n \)-input AND gates as \( n \) increases?
A · The output is 1 only when all inputs are 1, regardless of \( n \)
An AND gate outputs 1 only if all inputs are 1, which holds true for any number of inputs \( n \), and this can be proved by induction.
Question bankTap to reveal →
Refer to the following circuit diagram of a logic gate. Which induction technique is best suited to prove the correctness of outputs for an \( n \)-level recursive gate construction?
A · Structural induction because the circuit builds recursively from smaller subcircuits
Structural induction is suitable for recursively defined structures like circuits built from smaller components.
Question bankTap to reveal →
What is the correct inductive step needed to prove \( \sum_{i=1}^n i = \frac{n(n+1)}{2} \) using mathematical induction?
A · Assuming the formula holds for \( n=k \) and then proving it holds for \( n=k+1 \) by adding \( (k+1) \) to both sides
The inductive step assumes the formula true for \( k \) and then proves for \( k+1 \) by using the assumption and adding \( k+1 \) to the sum.
Question bankTap to reveal →
Refer to the following stepwise flowchart of the inductive proof process. Which part ensures the proof moves from \( n=k \) to \( n=k+1 \)?
A · Inductive step where \( P(k) \) is used to prove \( P(k+1) \)
The inductive step uses the assumption that \( P(k) \) holds to prove \( P(k+1) \), advancing the chain of implication.
Question bankTap to reveal →
Consider the property \( P(n): \) 'The number of subsets of an \( n \)-element set is \( 2^n \)'. Which induction variant and base case are most appropriate to prove \( P(n) \)?
A · Ordinary induction with base case \( n=0 \) where the empty set has 1 subset
Ordinary induction starting from \( n=0 \) (empty set) is standard to prove subset count by doubling in each step.
Question bankTap to reveal →
What is the best definition of a logical fallacy?
A · A mistake in reasoning that weakens an argument
A logical fallacy is an error in reasoning that weakens the argument, making it invalid or unsound.
Question bankTap to reveal →
Which statement best describes a logical fallacy?
A · An argument that appears convincing but contains flawed reasoning
Logical fallacies appear convincing but contain flaws in reasoning that undermine the argument's validity.
Question bankTap to reveal →
Which of the following best represents the core characteristic of a logical fallacy?
A · Invalid reasoning that leads to unreliable conclusions
Logical fallacies stem from invalid reasoning that can produce unreliable or incorrect conclusions despite appearing persuasive.
Question bankTap to reveal →
Which of the following is an example of an ad hominem fallacy?
A · Rejecting someone's argument by attacking their character
An ad hominem fallacy attacks the person making the argument rather than the argument itself.
Question bankTap to reveal →
Which fallacy occurs when someone distorts another's argument to make it easier to attack?
A · Straw Man
The Straw Man fallacy involves misrepresenting or oversimplifying an argument to make it easier to refute.
Question bankTap to reveal →
Which of the following best describes a false cause fallacy?
A · Assuming that because event A preceded event B, A caused B
A false cause fallacy incorrectly assumes causation based on sequence or coincidence without adequate evidence.
Question bankTap to reveal →
Identify the fallacy: "If we allow students to use calculators, next they won't be able to do simple math at all."
A · Slippery Slope
This is a Slippery Slope fallacy, assuming one event will cause a series of negative events without proof.
Question bankTap to reveal →
A politician says: "My opponent can't be trusted because he was once arrested." Which fallacy is committed?
A · Ad Hominem
This is an Ad Hominem fallacy attacking the opponent's character instead of addressing the argument.
Question bankTap to reveal →
Refer to the argument: "Since the new mayor took office, unemployment has risen. Therefore, the mayor caused the unemployment rise." Which fallacy is this?
A · False Cause
This argument assumes causation solely based on sequence, which is a False Cause fallacy.
Question bankTap to reveal →
Analyze this argument to find the fallacy: "Either we ban all cars in the city, or pollution will never decrease."
A · False Dilemma
The argument presents only two options, ignoring other possibilities, a classic False Dilemma fallacy.
Question bankTap to reveal →
In which case is the reasoning valid, avoiding fallacies?
A · Concluding the conclusion logically follows from evidence and premises
Valid reasoning means the conclusion logically follows from true premises without errors in logic.
Question bankTap to reveal →
Which reasoning is fallacious?
A · Equating correlation with causation without proof
Equating correlation with causation without sufficient evidence is a fallacy known as False Cause.
Question bankTap to reveal →
Which scenario best illustrates a harmful impact of logical fallacies in arguments?
A · Decisions made based on faulty arguments causing poor outcomes
Logical fallacies can lead to wrong decisions and poor outcomes when accepted uncritically.
Question bankTap to reveal →
What is a common consequence of ignoring logical fallacies in debates?
A · Propagating misinformation and undermining rational discourse
Ignoring fallacies can mislead audiences and weaken the quality of decision-making and debate.
Question bankTap to reveal →
Which of the following best describes a logical fallacy?
B · An error in reasoning that weakens an argument
A logical fallacy is an error in reasoning that undermines the logic of an argument.
Question bankTap to reveal →
Identify the statement that illustrates a logical fallacy:
B · The earth is round because all my friends believe it.
The argument uses mere belief as evidence, which is fallacious reasoning (appeal to popularity).
Question bankTap to reveal →
Which characteristic is essential for identifying a fallacious argument?
D · Use of ambiguous or misleading reasoning.
Fallacies often arise from ambiguous or misleading reasoning that appears persuasive but is logically flawed.
Question bankTap to reveal →
Which of the following is an example of the Ad Hominem fallacy?
A · You can't trust her argument on climate change because she is not a scientist.
Ad Hominem attacks the person instead of addressing their argument.
Question bankTap to reveal →
Refer to the diagram below showing an argument flow chart. Which fallacy is best illustrated by distorting the original claim to attack a weaker version?
A · Strawman Fallacy
The Strawman Fallacy misrepresents an argument to make it easier to attack, as reflected in the flow chart.
Question bankTap to reveal →
Which of the following arguments best exemplifies the False Cause fallacy?
A · Every time I wear my blue socks, my team wins; therefore, my socks cause the wins.
False Cause assumes a causal connection just because events coincide, which is a logical error.
Question bankTap to reveal →
Identify the example of Circular Reasoning from the options below:
A · I know the Bible is true because it says so in the Bible.
Circular Reasoning uses the conclusion as a premise, assuming what it is supposed to prove.
Question bankTap to reveal →
Which of the following arguments is valid but not logically sound?
B · All cats are reptiles; all reptiles are cold-blooded; therefore, all cats are cold-blooded.
The argument is valid because the conclusion logically follows the premises but unsound because the first premise is false.
Question bankTap to reveal →
Refer to the truth table below representing argument premises P and Q and conclusion R. Identify if the argument is valid or invalid.
P
Q
R
1
1
1
1
0
1
0
1
0
0
0
0
B · Invalid argument
The conclusion R is true even when premise Q is false, indicating an invalid logical argument.
Question bankTap to reveal →
In analyzing an argument, detecting a fallacy helps prevent:
A · Accepting invalid conclusions
Recognizing fallacies helps avoid accepting invalid or unsound conclusions in reasoning and decision making.
Question bankTap to reveal →
Refer to the diagram below illustrating a reasoning argument. Which fallacy is applied if the conclusion is supported only because it was previously assumed true in one of the premises?
A · Circular Reasoning
Circular Reasoning features premises that assume the truth of the conclusion instead of providing independent support.
Question bankTap to reveal →
Which of the following statements contains an error in logical operation?
B · Either P or Q is true; P is true; therefore Q is false.
The statement ignores that in exclusive disjunction either P or Q is true, but that does not guarantee the other is false in inclusive logic.
Question bankTap to reveal →
Identify the error in the logical operation based on the truth table shown below:
P
Q
Output
0
0
1
0
1
1
1
0
1
1
1
0
A · The truth table corresponds to a NAND gate, no error.
The output corresponds correctly to a NAND gate truth table; no logical operation error is present.
Question bankTap to reveal →
How can the impact of logical fallacies affect decision making in real-world scenarios?
B · They can lead to incorrect decisions based on faulty reasoning.
Logical fallacies can mislead reasoning and cause decisions to be based on erroneous or biased arguments.
Question bankTap to reveal →
Which of the following best defines a necessary condition for a statement \( P \)?
A · If \( P \) is true, the necessary condition must also be true
A necessary condition for \( P \) is a condition that must be true whenever \( P \) is true. If \( P \) is true, the necessary condition cannot be false.
Question bankTap to reveal →
Which statement correctly describes a sufficient condition for \( Q \)?
C · If the sufficient condition is true, then \( Q \) is guaranteed true
A sufficient condition means that whenever it is true, the statement \( Q \) is guaranteed to be true, though \( Q \) might be true even without the sufficient condition.
Question bankTap to reveal →
If "Being a mammal" is necessary and sufficient for "Being a dog", which of the following is true?
B · "Being a mammal" and "Being a dog" always occur together
If a condition is both necessary and sufficient, both statements imply each other, so "Being a mammal" and "Being a dog" always occur together in this context.
Question bankTap to reveal →
Which of the following represents the correct logical implication for "If P then Q"?
A · \( P \Rightarrow Q \)
The implication "If P then Q" is symbolized as \( P \Rightarrow Q \), stating that whenever \( P \) is true, \( Q \) is true.
Question bankTap to reveal →
Given the logical statements \( P \Rightarrow Q \) and \( Q \Rightarrow P \), which equivalence holds true?
B · They imply \( P \Leftrightarrow Q \)
If \( P \Rightarrow Q \) and \( Q \Rightarrow P \), then \( P \) and \( Q \) are logically equivalent, represented by \( P \Leftrightarrow Q \).
Question bankTap to reveal →
Refer to the diagram below showing a logical implication circuit. What does the circuit output if input \( P = 1 \) and input \( Q = 0 \)?
A · 0
The implication \( P \Rightarrow Q \) outputs false only when \( P = 1 \) and \( Q = 0 \). For other values, it is true.
Question bankTap to reveal →
Which of the following is NOT an example of a necessary condition?
D · "Owning a car is necessary to be a driver"
"Owning a car is necessary to be a driver" is incorrect, as one can drive without owning a car (e.g., driving a rented car). Hence it's not necessary.
Question bankTap to reveal →
Identify the sufficient condition in the statement: "If it is raining, the ground is wet."
A · "It is raining" is a sufficient condition for "Ground is wet"
"It is raining" guarantees the ground is wet, so it's a sufficient condition; the ground may be wet without rain.
Question bankTap to reveal →
Refer to the Venn diagram below representing sets \( A \) and \( B \). If "Being in \( A \)" is necessary for "Being in \( B \)", what does the diagram suggest?
A · Set \( B \) is entirely contained within \( A \)
If "Being in \( A \)" is necessary for "Being in \( B \)", every element of \( B \) must be in \( A \), so \( B \) is a subset of \( A \).
Question bankTap to reveal →
Which of the following symbolic statements correctly represents: "If P is necessary for Q, then..."?
A · \( Q \Rightarrow P \)
If \( P \) is necessary for \( Q \), then \( Q \) cannot be true unless \( P \) is true, so \( Q \Rightarrow P \).
Question bankTap to reveal →
Complete the truth table for \( P \Rightarrow Q \) given below. What is the output when \( P=0 \) and \( Q=1 \)? Refer to the diagram below.
B · 1
An implication \( P \Rightarrow Q \) is true when \( P=0 \), regardless of \( Q \). Here, output is 1 when \( P=0 \) and \( Q=1 \).
Question bankTap to reveal →
Which symbolic proposition represents the statement "P is sufficient but not necessary for Q"?
A · \( P \Rightarrow Q \) and \( eg(Q \Rightarrow P) \)
"P sufficient for Q" means \( P \Rightarrow Q \); "P not necessary" means \( Q ot\Rightarrow P \).
Question bankTap to reveal →
Refer to the truth table below. What logical connective is represented? \( P \) and \( Q \) inputs produce outputs 1 only when both inputs are 1.
A · Logical AND (\( P \land Q \))
AND outputs 1 only when both \( P=1 \) and \( Q=1 \).
Question bankTap to reveal →
In reasoning, which of the following is a common logical fallacy related to confusing necessary and sufficient conditions?
A · Affirming the consequent
Affirming the consequent assumes that if \( Q \) is true, then \( P \) must be true given \( P \Rightarrow Q \), which confuses necessary and sufficient conditions.
Question bankTap to reveal →
Which logical fallacy is present in the statement: "If it rains, the ground is wet; the ground is wet, so it must have rained."?
A · Affirming the consequent
This is affirming the consequent, assuming the sufficient condition's effect implies its cause.
Question bankTap to reveal →
Which of the following statements best illustrates 'Denying the antecedent' fallacy?
A · If \( P \), then \( Q \). \( eg P \) is true, so conclude \( eg Q \).
Denying the antecedent incorrectly assumes that if \( P \) is false, \( Q \) must be false.
Question bankTap to reveal →
Refer to the diagram below showing a truth table of a conditional statement. Which entries correspond to the statement being false?
A · \( P=1, Q=0 \)
The implication \( P \Rightarrow Q \) is false only when \( P=1 \) and \( Q=0 \).
Question bankTap to reveal →
In solving problems, if a sufficient condition is met, what can be concluded?
A · The conclusion always follows
Meeting a sufficient condition guarantees the conclusion follows.
Question bankTap to reveal →
Which logical reasoning approach correctly identifies the necessary condition in a problem-solving context?
A · If the outcome occurs, then the condition must have occurred
A necessary condition must be present for the outcome; hence the occurrence of outcome implies the presence of condition.
Question bankTap to reveal →
In a reasoning problem, which is an example of incorrect application of necessary and sufficient conditions?
B · Assuming \( P \Rightarrow Q \) implies \( Q \Rightarrow P \)
Assuming the converse \( Q \Rightarrow P \) from \( P \Rightarrow Q \) is a fallacy and incorrect use of sufficiency and necessity.
Question bankTap to reveal →
Which of the following best describes the fallacy of confusing necessity and sufficiency?
A · Mistaking a condition required to happen as one that guarantees the result
Confusing necessity with sufficiency means mistaking a condition required for the result as a condition that ensures the result.
Question bankTap to reveal →
Refer to the logic circuit diagram below involving inputs \( P \) and \( Q \) combining through NOT and AND gates to form \( P \Rightarrow Q \). What is this circuit an example of?
A · Conditional implication using gates
Implication \( P \Rightarrow Q \) can be implemented as \( eg P \lor Q \) using NOT and OR gates; the diagram uses NOT and AND with wiring to realize this.
Question bankTap to reveal →
If \( P \Rightarrow Q \) is true, which of the following must also be true?
A · \( eg Q \Rightarrow eg P \)
Contrapositive \( eg Q \Rightarrow eg P \) is logically equivalent to \( P \Rightarrow Q \).
Question bankTap to reveal →
Consider the statement: "Having a valid driver’s license is necessary to drive legally." Which of the following correctly identifies the condition?
A · Having a valid license is necessary but not sufficient to drive legally
A license must be held to drive legally, so necessary; other conditions (like rules) may also need to be met, so not sufficient by itself.
Question bankTap to reveal →
Identify which of the following is a sufficient condition but not necessary for the statement: "Person is an adult in a specific country."
A · "Person is 21 years or older" in country where majority age is 21
"21 or older" may guarantee adulthood (sufficient) in some countries but is not a universal necessary condition.
Question bankTap to reveal →
Which of the following statements is logically equivalent to \( P \Rightarrow Q \)?
A · \( eg P \lor Q \)
Implication \( P \Rightarrow Q \) is equivalent to \( eg P \lor Q \).
Question bankTap to reveal →
Refer to the logic circuit diagram below implementing \( P \Rightarrow Q \). Which gates are necessary to implement this implication using basic logic gates?
A · NOT gate and OR gate
The implication \( P \Rightarrow Q \) can be implemented as \( eg P \lor Q \), requiring NOT and OR gates.
Question bankTap to reveal →
Which condition must always hold for the statement: "If P and Q are equivalent, then P is both necessary and sufficient for Q"?
A · \( P \Leftrightarrow Q \)
Logical equivalence \( P \Leftrightarrow Q \) means both necessary and sufficient conditions hold.
Question bankTap to reveal →
Refer to the truth table below. Which row(s) show(s) that \( P \Rightarrow Q \) is true while both \( P \) and \( Q \) are false?
A · Row with \( P=0, Q=0 \)
When \( P=0 \) and \( Q=0 \), \( P \Rightarrow Q \) is true since an implication is true if the antecedent is false.
Question bankTap to reveal →
Which of the following best summarizes "Modus Tollens" in terms of necessary and sufficient conditions?
A · If \( P \Rightarrow Q \) and \( eg Q \) is true, then \( eg P \) is true
Modus Tollens is the inference that if the consequent is false, then the antecedent is false, given the implication \( P \Rightarrow Q \).
Question bankTap to reveal →
Refer to the Venn diagram below. If \( A \) represents necessary conditions and \( B \) represents sufficient conditions, which relation correctly indicates "All sufficient conditions are necessary"?
A · Set \( B \) is a subset of \( A \)
All sufficient conditions being necessary means every element of \( B \) exists in \( A \).
Question bankTap to reveal →
Which one of the following is an example of a statement with a necessary and sufficient condition?
A · "A figure is a square if and only if it is a rectangle with equal sides"
"If and only if" statements define necessary and sufficient conditions simultaneously.
Question bankTap to reveal →
Identify the type of logical fallacy in the statement: "If someone passes the test, they study. John studied, so John passed the test."
A · Affirming the consequent
It wrongly infers the antecedent from the consequent, the hallmark of affirming the consequent fallacy.
Question bankTap to reveal →
Refer to the truth table below. For which row(s) is the biconditional \( P \Leftrightarrow Q \) false?
A · Rows where \( P eq Q \)
Biconditional is true only when \( P \) and \( Q \) have the same truth value; false otherwise.
Question bankTap to reveal →
Which of the following statements about conditional statements is TRUE?
A · The contrapositive is logically equivalent to the original conditional statement
The contrapositive (\( eg Q \Rightarrow eg P \)) is logically equivalent to the original conditional (\( P \Rightarrow Q \)).
Try Practice next.
Marking revisions saves to your dashboard — paywalled in preview.
