June 2016 Computer Science Paper 2 :- 1. The Boolean function [~ (~p∧q)∧~(~p∧~q)]∨(p∧r) is equal to the Boolean function : (1) q (2) p ∧ r (3) p ∨ q (4) p 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. (1) ↔~∧pq∨ ~ ~ pq, pq∧~p~q~∨↔ (2) ↔~∧pq∨ ~ p~q, pq∧~p~q~∨↔ (3) ↔~∧pq∨ ~ ~ pq, pq∧~p~ ~q∨↔ (4) ↔~∧pq∨ ~ p~ q, pq∧~p~ ~q∨↔ 3. Let A and B be sets in a finite universal set U. Given the following : |A – B|, |A ⊕ B|, |A| + |B| and |A ∪ B| Which of the following is in order of increasing size ? (1) |A – B| < |A ⊕ B| < |A| + |B| < |A ∪ B| (2) |A ⊕ B| < |A – B| < |A ∪ B| < |A| + |B| (3) |A ⊕ B| < |A| + |B| < |A – B| < ...
Always with you to fascinate and feisty you.I'm blessed and I thank God for every day for everything that happens for me.