Question

@DLS

Answer 1

here we are again :P

Answer 2

\(p → (p ∧ (q → p))\)

lets create the table quick

Answer 3

we're creating the table to write out PDNF okay

Answer 4

We can just read the table from there? just include the picture or something.

Answer 5

For PDNF simply take the rows with T

Answer 6

Here all rows have T

Answer 7

therefore the PDNF is

p'q' + p'q + pq' + pq

Answer 8

replace + with OR gate

multiplication with AND gate

' with NOT gate

Answer 9

you mean to say all rows with atleast 1 T ? or the last column ?

Answer 10

which column represents the given boolean expression ?

Answer 11

last one

Answer 12

that is the reason i have asked you to create teh truth table

Answer 13

so you only look at the last column

Answer 14

the other columns help you create that last column ok

Answer 15

can't believe it is this easy :|
DNF is more diffficult than this :O atleast we use theorems and all there

Answer 16

yep

Answer 17

the other columns are like scratch work

Answer 18

these are easy once you understand the logic

Answer 19

and what would be the modification in case of PCNF ?

Answer 20

for PCNF you consider the rows with F

Answer 21

are there any rows with F ?

Answer 22

nope..so null....right

Answer 23

yes

Answer 24

the expression always evaluates to True

Answer 25

it doesn't depend on the logic values of p and q

Answer 26

yep so its a tautology

Answer 27

it is like the function :

f(p, q) = 1

Answer 28

Yep

Answer 29

im not so sure with ur termonilogy....
the boolean algebra i am familiar with comes from digital circuit design

Answer 30

alright..I've covered alot of things :) all thanks to you :D

Answer 31

np :) have good sleep tonight so that you will be fresh tomoro

Answer 32

yep..going to sleep soon :P just have to revise graph theory n good to go.
will remember you name before starting the exam :P