Question 3548 – UGC NET CS 2016 Aug- paper-2
October 29, 2023Question 3550 – UGC NET CS 2016 Aug- paper-2
October 29, 2023Question 3549 – UGC NET CS 2016 Aug- paper-2
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.
Correct Answer: B
Question 2 Explanation:
Step-1: Given compound proposition is
(~(p ∧ q))↔(~ p ∨ ~ q)
It is clearly specifying that
↔ is a root
(~(p ∧ q)) is left subtree
(~p ∨ ~q) is right subtree.
Step-2: Finally the tree is looks like
Step-3: Prefix operation traverse through Root,left and Right
↔~∧pq∨ ~ p~q
Step-4: Postfix operation traverse through Left,Right and Root.
pq∧~p~q~∨↔
(~(p ∧ q))↔(~ p ∨ ~ q)
It is clearly specifying that
↔ is a root
(~(p ∧ q)) is left subtree
(~p ∨ ~q) is right subtree.
Step-2: Finally the tree is looks like
Step-3: Prefix operation traverse through Root,left and Right
↔~∧pq∨ ~ p~q
Step-4: Postfix operation traverse through Left,Right and Root.
pq∧~p~q~∨↔
↔~∧pq∨ ~ ~ pq, pq∧~p~q~∨↔
↔~∧pq∨ ~ p~q, pq∧~p~q~∨↔
↔~∧pq∨ ~ ~ pq, pq∧~p~~q∨↔
↔~∧pq∨ ~ p~ q, pq∧~p~ ~q∨↔
Subscribe
Login
0 Comments