Computer Sciences > Gate 2015 Set-1 > Proposition Logic

Contributed by: Dr. Sarah Chen

Report Correct Copyright Claim

Which one of the following is NOT equivalent to p ↔ q?

A

(┐p ˅ q) ˄ (p ˅ ┐q)

B

(┐p ˅ q) ˄ (q → p)

C

(┐p ˄ q) ˅ (p ˄ ┐q)

D

(┐p ˄ ┐q) ˅ (p ˄ q)

Check Answer

Explanation

Correct : Proposition Logic

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