GATE CS 2025: 3-Variable Boolean Majority Function - Which Statements are Correct? | Examprev

```

Computer Sciences > GATE 2025 SET-1 > Boolean Algebra

Let X be a 3-variable Boolean function that produces output as '1' when at least two of the input variables are '1'. Which of the following statement(s) is/are CORRECT, where a, b, c, d, e are Boolean variables?

A

X(a,b,X(c,d,e))=X(X(a,b,c),d,e)

B

X(a,b,X(a,b,c))=X(a,b,c)

C

X(a,b,X(a,c,d))=(X(a,b,a) AND X(c,d,c))

D

X(a,b,c)=X(a,X(a,b,c),X(a,c,c))

Explanation

Correct : b

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?

Question #23 Medium

Which operations on a binary search tree have O(h) complexity?

Question #31 Easy

Compare search complexities of sorted array vs balanced BST.

Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science