UGC NET CSE | August 2016 | Part 2 | Question: 2

Question

Let us assume that you construct ordered tree to represent the compound proposition $(\sim (p \wedge q)) \leftrightarrow  (\sim p \vee \sim q)$.

Then, the prefix expression and post-fix expression determined using this ordered tree are given as _____ and ______ respectively.

• A. $\leftrightarrow \sim \wedge pq \vee \sim \sim pq, pq \wedge \sim p \sim q \sim ∨ \leftrightarrow$
• B. $\leftrightarrow \sim \wedge pq \vee \sim p \sim q, pq \wedge \sim p \sim q \sim \vee \leftrightarrow $ 
• C. $\leftrightarrow \sim \wedge pq \vee \sim \sim pq, pq \wedge \sim p \sim \sim q \vee \leftrightarrow $
• D. $\leftrightarrow \sim \wedge pq \vee \sim p \sim q, pq\wedge \sim p \sim \sim q \vee \leftrightarrow $

Comments

B. ) ?

---

Refer to https://gateoverflow.in/69033/ugcnet-aug2016-ii-2 

Answer 1

Prefix exp: ↔∼∧pq∨∼p∼q

Postfix exp: pq∧∼p∼q∼∨↔

(B) option ans .

Answer 2

ANS IS B

REF:http://internetnotes.in/cbse-net-computer-science-august-2016-paper-2-re-test/

Answer 3

this question is same as converting an infix expression into post fix and prefix using stack 

operator precedence is 

~(NOT)

^(AND)

v(OR)

->(implication)

<->(bi-implication)