• Courses
  • Tutorials
  • Jobs
  • Practice
  • Contests

UGC-NET | UGC NET CS 2016 Aug – II | Question 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 pgiven as ____ and _____ respectively.


↔~∧pq∨ ~ ~ pq, pq∧~p~q~∨↔


↔~∧pq∨ ~ p~q, pq∧~p~q~∨↔


↔~∧pq∨ ~ ~ pq, pq∧~p~~q∨↔


↔~∧pq∨ ~ p~ q, pq∧~p~ ~q∨↔


Please comment below if you find anything wrong in the above post
Feeling lost in the world of random DSA topics, wasting time without progress? It's time for a change! Join our DSA course, where we'll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 geeks!

Last Updated :
Share your thoughts in the comments