Explore topic-wise MCQs in Data Structure.

This section includes 4 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structure knowledge and support exam preparation. Choose a topic below to get started.

1.

Consider the expression T | F T. In how many ways can the expression be parenthesized so that the output is F (false)?

A. 0
B. 1
C. 2
D. 3
Answer» C. 2
Discussion
2.

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» D. 3
Discussion
3.

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» D. 3
Discussion
4.

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?

A. Dynamic programming
B. Recursion
C. Brute force
D. Dynamic programming, Recursion and Brute force
Answer» E.
Discussion