Biomedical Engineering > GATE 2023 > Boolean Algebra

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Q, R, S are Boolean variables and ⊕ is the XOR operator. Select the CORRECT option(s).

A

(Q⊕R)⊕S=Q⊕(R⊕S)

B

(Q⊕R)⊕S=0 when any two of the Boolean variables (Q,R,S) are 0 and the third variable is 1

C

(Q⊕R)⊕S=1 when Q=R=S=1

D

((Q⊕R)⊕(R⊕S))⊕(Q⊕S)=1

Check Answer

Explanation

Correct : a, b, c

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