Computer Sciences > Gate 2017 Set-2 > Aptitude
Let p, q, r denote the statement "It is raining", "It is cold", and "It is pleasant", respectively. Then the statement "It is not raining and it is pleasant, and it is not pleasant only if it is raining and it is cold" is represented by:
A
(¬ p ∧ r) ∧ ((¬ r → (p ∧ q))
B
(¬ p ∧ r) ∧ ((p ∧ q) → ¬ r)
C
(¬ p ∧ r) ∨ ((p ∧ q) → ¬ r)
D
(¬ p ∧ r) ∨ ((r → (p ∧ q))

Explanation

Correct : Aptitude

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