Recent content by barbara

Yes its a typo Thank you for your help and this is what the answer should look like. Please let me know if its correctThe is a representation of a recursion algorithm traverses the left subtree, the right subtree, and finally the root. That carries on the subtrees of the subtrees until a leaf...

+ / \ / \ * - / \ / \ 2 3 * +...

This truth table that represents statement p v (q ^ r) is equivalent to (p v q) ^ (p v r)Showing that this statement is not equivalent to (p v q) ^ r.. Now I need to what property of Boolean Algebra is being demonstrated by the fact that the first two statements were equivalentp q r q ^ r...

I know that 1. To show the relation is reflexive, we need to show that for any x, using the definition of R, we have xRx. The definition of R means that we must have |x - x| is even.2. To show that R is symmetric, we would have to show that if xRy then yRx. In the context of the definition...

can someone give me show me a venn diagram that will satisfy this statement Venn diagram to show that the statement p v (q ^ r) is equivalent to (p v q) ^ (p v r) and show that this statement is not equivalent to (p v q) ^ r.

I have truly don't know how to answer this question even with your example in which I truly appreciate

The following algorithm describes a postorder tree traversal Postorder(tree) If left subtree exists then Postorder(left subtree) If right subtree exists then Postorder(right subtree) Print root end How can I apply that to the following tree...

How would I use a truth table to show that the statement p v (q ^ r) is equivalent to (p v q) ^ (p v r) or design a venn diagram for this. and show that this statement is not equivalent to (p v q) ^ r.

Can someone help me solve this problem I need to Define the following relation on the set of real numbers xRy if |x - y| is an even integer and Show that R is an equivalence relation and describe the equivalence classes.