EC > GATE 2014 SET-1 > Boolean Algebra

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

The Boolean expression (X + Y) (X + Y̅) + (X Y̅) + X̅ simplifies to

A

X

B

Y

C

XY

D

X+Y

Check Answer

Explanation

Correct : a

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