![Mcqmate logo](https://mcqmate.com/images/logos/logo-black.png)
![Mcqmate logo](https://mcqmate.com/images/logos/logo-white.png)
McqMate
Q. |
Consider the expression T & F ∧ T. What is the number of ways in which the expression can be parenthesized so that the output is T (true)? |
A. | 0 |
B. | 1 |
C. | 2 |
D. | 3 |
Answer» C. 2 | |
Explanation: the expression can be parenthesized as (t & f) ∧ t or t & (f ∧ t), so that the output is t. |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet