Computer Sciences > Gate 2016 Set-2 > Logic Gates

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Let, x₁⊕x₂⊕x₃⊕x₄= 0 where x₁, x₂, x₃, x₄ are Boolean variables, and ⊕ is the XOR operator. Which one of the following must always be TRUE ?

A

x₁x₂x₃x₄=0

B

x₁x₃+x₄=0

C

x'₁⊕x'₃=x'₂⊕x'₄

D

x₁+x₂+x₃+x₄=0

Check Answer

Explanation

Correct : Logic Gates

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