retagged by
6,138 views

3 Answers

Best answer
15 votes
15 votes

$A. \ \ (p \vee q) \rightarrow p$
$\quad \quad \equiv \ \ \neg(p \vee q) \vee p$
$\quad \quad \equiv \ \ (\neg p \wedge \neg q) \vee p$
$\quad \quad \equiv \ \ (\neg p \vee p)\wedge(\neg q \vee p)$
$\quad \quad \equiv (p \vee\neg q)$

$B. \ \ p \vee (q \rightarrow p)$
$\quad \quad \equiv \ \ p \vee (\neg q \vee p)$
$\quad \quad \equiv \ \ (p \vee p)\vee\neg q$
$\quad \quad \equiv p \vee\neg q$

$C. \ \ p \vee (p \rightarrow q)$
$\quad \quad \equiv \ \ p \vee (\neg p \vee q)$
$\quad \quad \equiv \ \ ( p \vee \neg p) \vee q$
$\quad \quad \equiv \ \ T \vee q$
$\quad \quad \equiv \ \ T$

$D. \ \ p \rightarrow (p \rightarrow q)$
$\quad \quad \equiv \ \ p \rightarrow (\neg p \vee q)$
$\quad \quad \equiv \ \ \neg p \vee(\neg p \vee q)$
$\quad \quad \equiv \ \ (\neg p \vee\neg p) \vee q$
$\quad \quad \equiv \ \ \neg p \vee q$

Hence, Option(C) $p \vee (p \rightarrow q)$.

edited by
17 votes
17 votes
C) P OR (P -->Q) = P OR (NOT P OR Q)

                          =(P OR NOT P) OR Q                  Associativity rule

                          =T OR Q                                     

                          =T
Answer:

Related questions

34 votes
34 votes
3 answers
1
Kathleen asked Sep 29, 2014
10,955 views
Dirty bit for a page in a page tablehelps avoid unnecessary writes on a paging devicehelps maintain LRU informationallows only read on a pageNone of the above
32 votes
32 votes
4 answers
2
Kathleen asked Sep 29, 2014
13,147 views
Thrashingreduces page I/Odecreases the degree of multiprogrammingimplies excessive page I/Oimprove the system performance
25 votes
25 votes
2 answers
3