UTpaper

Free mock tests & test series

Question 12Asked in UGC NET Computer Science, August 2016 (Paper II & III, Selected Questions)

Let us assume that you construct ordered tree to represent the compound proposition (~(p ∧ q)) ↔ (~p ∧ ~ q). Then, the prefix expression and post-fix…

Let us assume that you construct ordered tree to represent the compound proposition (~(p ∧ q)) ↔ (~p ∧ ~ q). Then, the prefix expression and post-fix expression determined using this ordered tree are given as ............ and ............. respectively.
  1. A↔~∧pq∨~~pq, pq∧~p~q~∨↔
  2. B↔~∧pq∧~p~q, pq∧~p~q~∧↔
  3. C↔∧pq∨~~pq, pq∧~p~~q∧↔
  4. D↔~∧pq∧~p~q, pq∧~p~~q∧↔
Show answerHide answer

Correct answer: (B) ↔~∧pq∧~p~q, pq∧~p~q~∧↔

Explanation

The root is ↔, its left subtree is ~(p ∧ q) and its right subtree is (~p ∧ ~q). Prefix: ↔~∧pq∧~p~q Postfix: pq∧~p~q~∧↔ Option (b) is the answer.

From UGC NET Computer Science PYQ, August 2016 (Paper II & III, Selected Questions)

This is question 12 of UGC NET Computer Science PYQ, August 2016 (Paper II & III, Selected Questions). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.