Computer Fundamentals - Section 4 Multiple Questions and Answers.




16. Which of the following are tautologies?
A. ((P v Q) ^ Q) ↔ Q
B. ((P v Q) ^ ˥P) → Q
C. ((P v Q) ^ P) → P
D. Both (a) & (b)

17. If F1, F2 and F3 are propositional formulae such that F1 ^ F2 → F3 and F1 ^ F2→F3 are both tautologies, then which of the following is TRUE?
A. If F1, F2 and F3 are propositional formulae such that F1 ^ F2 → F3 and F1 ^ F2→F3 are both tautologies, then which of the following is TRUE?
B. The conjuction F1 ^ F2 is not satisfiable
C. Neither is tautologies
D. None of these

18.Consider two well-formed formulas in propositional logic F1 : P →˥P F2 : (P →˥P) v ( ˥P →) Which of the following statement is correct?
A. F1 is satisfiable, F2 is unsatisfiable
B. F1 is unsatisfiable, F2 is satisfiable
C. F1 is unsatisfiable, F2 is valid
D. F1 & F2 are both satisfiable

19. What can we correctly say about proposition P1: P1 : (p v ˥q) ^ (q →r) v (r v p)
A. P1 is tautology
B. P1 is satisfiable
C. If p is true and q is false and r is false, the P1 is true
D. if p as true and q is true and r is false, then P1 is true

20.(P v Q) ^ (P → R )^ (Q →S) is equivalent to
A. S ^ R
B. S → R
C. S v R
D. All of above

«»



Date to Date Current Affairs 2022

PakMCQs.net

Quick Links

GAT Subject



   Computer Science    English Mcqs    Agriculture    

Engineering



   Computer Science    Civil Engineering    

Technical



   Networking    Electronics    Database    

Past Papers



   Model Papers    FPSC Papers