COLEGIO DE NG MONTALBAN

Kasiglahan Village, Rodriguez Rizal

INSTITUTE OF COMPUTER STUDIES
Prelim Examination
DISCRETE MATH

Name: _Alex Ricot______________________________________Yr./Section_BSIT 1J_____ Date

_3/30/2023______ Score _________

General Instruction:
1. Read the problem carefully. Answer on your own without the help of anyone or
anything. Follow instructions.
2. You can used ball pen or pencil. Erasures invalidate your answer. It should be neat
and clean.
3. Group learning is not allowed. Cheating strictly prohibited.
Test I. Determine which of the following is a proposition. Indicate the reason why
or why not.

1. The platypus is a marsupial.The platypus is not a marsupial. It is a semi-aquatic

mammal native to Australia, and it belongs to the monotreme group of mammals, which
also includes echidnas. Unlike marsupials, monotremes lay eggs rather than giving birth
to live young, and they have a unique mix of mammalian and reptilian characteristics.

2. If x > 5 𝑡ℎ𝑒𝑛 𝑥 = 3 The proposition "If x > 5 then x = 3" is not true in general.If x is a
number greater than 5, then the proposition would state that x must be equal to 3, which
is not true. For example, if x = 7, then x is greater than 5, but x is not equal to 3.

However, if the proposition were "If x = 3 then x > 5", then this would be true because if x
equals 3, then x is not greater than 5.

3. 5+9 =3 The proposition "5+9=3" is false. The correct answer is 14, not 3.

4. Allyl and Amyl are sisters. "Allyl and Amyl are sisters" is a proposition.

5. 10x2 – 4x +2 The expression "10x2 - 4x + 2" is not a proposition because it is not a

declarative statement that can be evaluated as true or false. It is simply a polynomial
expression.

6. Are you going to church this Sunday? This is a proposition because it is a statement
that can be either true or false.

7. Hello, sister! The statement "Hello, sister!" is not a proposition because it does not
express a complete thought that can be evaluated as true or false. It is simply a
greeting, and it does not make a claim or assertion that can be verified as true or false.

8. 3x + 6 =0 if and only if x= -2 The statement "3x + 6 = 0 if and only if x = -2" is a

declarative sentence that makes a claim about the relationship between two
mathematical expressions. This claim is either true or false, depending on whether or
not x = -2 satisfies the equation 3x + 6 = 0.

If we substitute x = -2 into the equation, we get:

Prepared By: Engr. Elsa N. Calvez

3(-2) + 6 = 0
-6 + 6 = 0

0=0

Since the equation is true when x = -2, the statement "3x + 6 = 0 if and only if x = -2" is
true, and therefore qualifies as a proposition.

9. The earth is the fifth planet from the sun.The Earth is not the fifth planet from the
sun, it is the third planet from the sun, which means the statement is false. However, in
order for a statement to be a proposition, it must be capable of being true or false, and
this statement is not capable of being true, making it a non-proposition.

10. Study your lesson on discrete so that you’ll pass.The given statement "Study your
lesson on discrete so that you’ll pass" is a proposition because it expresses a complete
thought

11. . If the teacher is absent, then the students will celebrate.If the teacher is absent,
then the students will celebrate" is a proposition because it expresses a complete
thought

12. The new president loves to wear khaki is a proposition because it is a declarative
sentence that expresses a definite statement. It is either true or false, depending on
whether or not the new president actually loves to wear khaki.

13. 3-6 = 5

"3-6 = 5"

is not a proposition because it is a mathematical equation, not a declarative sentence

that expresses a definite statement. Mathematical equations are not true or false in
themselves; their truth or falsehood depends on the values of the variables involved.
Therefore, it does not make sense to classify this statement as a proposition.

14. Today is Friday.

"Today is Friday."

is a proposition because it is a declarative sentence that expresses a definite statement.

It is either true or false, depending on whether or not today is actually Friday.

15. The sun rises in the east every night. is not a proposition because it is factually
incorrect. The sun does not rise in the east every night. The statement is not true, but it
is also not false, because it is not a meaningful assertion. Therefore, it does not make
sense to classify this statement as a proposition.

16. Are you with us? is not a proposition because it is an interrogative sentence that
asks a question, rather than making a declarative statement. It does not express a
definite assertion that can be evaluated as true or false. Therefore, it does not make
sense to classify this statement as a proposition.

Prepared By: Engr. Elsa N. Calvez

17. There is life in planet Mars.is a proposition because it is a declarative sentence that
expresses a definite statement. It is either true or false, depending on whether or not
there is actually life on Mars.

18.. 3x – 4 = 0 is a proposition because it is a declarative sentence that expresses a

definite statement. It is either true or false, depending on the value of x. Specifically, it is
true if x = 4/3 and false otherwise.

19. Five is an even integer.is not a proposition because it is factually incorrect. The
statement is not true, but it is also not false, because it is not a meaningful assertion.
Therefore, it does not make sense to classify this statement as a proposition.

20. The University of Sto. Thomas is the oldest school in the Philippines is a
proposition because it is a declarative sentence that expresses a definite statement. It is
either true or false, depending on whether or not the University of Sto. Tomas is actually
the oldest school in the Philippines.

II. Construct the truth table.

1 (s v ¬r) → (¬ w ᴠ r ) To construct the truth table for the given statement,

we need to list all possible combinations of truth values for the variables
involved in the statement, and then evaluate the statement for each
combination. There are four variables in the statement, so there are 2^4 =
16 possible combinations of truth values.

Here is the truth table:

s r w ¬r s v ¬r ¬w ᴠ r (s v ¬r) → (¬w ᴠ r)

T T T F T T T

T T F F T T T

T F T T T T T

T F F T T T T

Prepared By: Engr. Elsa N. Calvez

 F T T F F T T

F T F F F T T

F F T T T T T

F F F T T F F

T T T F T T T

T T F F T T T

T F T T T T T

T F F T T T T

F T T F F T T

F T F F F T T

Prepared By: Engr. Elsa N. Calvez

 F F T T T T T

F F F T T F F

In the truth table, T stands for true and F stands for false. The first row, for
example, represents the combination of truth values where s is true, r is
true, w is true, and ¬r is false. We can see that in this case, s v ¬r is true
(since s is true), ¬w ᴠ r is true (since r is true), and (s v ¬r) → (¬w ᴠ r) is
true (since both the antecedent and consequent are true). We can
similarly evaluate the statement for each of the 16 possible combinations
of truth values.

2) (e— m) ^( e^ ~m)To construct the truth table for (e— m) ^( e^ ~m), we

need to first identify all possible combinations of truth values for e and m.
Since there are two variables, there are four possible combinations:

e m

T T

T F

F T

F F

Now, we can use these combinations to evaluate the expression (e— m) ^( e^ ~m) for
each row of the truth table:

Prepared By: Engr. Elsa N. Calvez

 e m ~m e^~m e—m (e—m)^(e^~m)

T T F F 0 1

T F T T 1 1

F T F F -1 1

F F T F 0 0

Therefore, the truth table for (e— m) ^( e^ ~m) is:

e m (e—m)^(e^~m)

T T 1

T F 1

F T 1

F F 0

Prepared By: Engr. Elsa N. Calvez

 3) {(p— o) ^ (o — i)} — (p— i) To construct the truth table for {(p— o) ^ (o
— i)} — (p— i), we need to first identify all possible combinations of truth
values for p, o, and i. Since there are three variables, there are eight
possible combinations:

p o i

T T T

T T F

T F T

T F F

F T T

F T F

F F T

Prepared By: Engr. Elsa N. Calvez

 F F F

Now, we can use these combinations to evaluate the expression {(p— o) ^ (o — i)} —
(p— i) for each row of the truth table:

p o i p—o o—i (p—o)^(o—i) p—i {(p—o)^(o—i)}—(p—i)

T T T 0 0 1 0 1

T T F 0 1 0 1 -1

T F T 1 -1 0 1 -1

T F F 1 0 1 1 0

F T T -1 1 0 -1 0

F T F -1 0 1 -1 2

F F T 0 -1 0 -1 1

Prepared By: Engr. Elsa N. Calvez

 F F F 0 0 1 0 1

Therefore, the truth table for {(p— o) ^ (o — i)} — (p— i) is:

p o i {(p—o)^(o—i)}—(p—i)

T T T 1

T T F -1

T F T -1

T F F 0

F T T 0

F T F 2

F F T 1

F F F 1

Prepared By: Engr. Elsa N. Calvez

III. Identify whether the following propositions are tautologies, contradiction or
contingencies using propositional calculus.

1( ˷p ˄ q ) ͢ (˷q ᴠ p)p | q | ˷p | ˷q | (˷p ˄ q) | (˷q ᴠ p) | (˷p ˄ q) ͢ (˷q ᴠ p)

--|---|----|----|---------|----------|------------------

T|T|F |F |F |T |F

T|F|F |T |F |T |F

F|T|T |F |T |F |F

F|F|T |T |F |T |F

2( p → ( q ᴠ r ) → ( ( p→q ) ᴠ r ) p q r qᴠr p→
(q ᴠ r) p → q (p → q) ᴠ r (p → (q ᴠ r)) → ((p → q) ᴠ r)
T T T T T T T T
T T F T T T T T
T F T T T F T T
T F F F F F F T
F T T T T T T T
F T F T T T T T
F F T T T T T T
F F F F T T T T

3( p ˄ q ) ↔ q

q p˄q (p ˄ q) ↔ q

T T T T

T F F F

Prepared By: Engr. Elsa N. Calvez

 F T F F

F F F T

4( p ˄ q) → r) →( p→r) ( q v ˷ q ) →(q ˄ ˷ q)

q r (p ˄ q) → r p→r qv˷q (q v ˷ q) → (q ˄ ˷ q)

T T T T T T F

T T F F F T F

T F T T T T F

T F F F F T F

F T T T T T F

F T F F T T F

Prepared By: Engr. Elsa N. Calvez

 F F T T T F T

F F F T T F T

5( p ˄ ˷ p ) →q

˷p (p ˄ ˷ p) (p ˄ ˷ p) → q

T F F T

F T F T

Test IV. Write the propositions using p, q, and r and logical connectives.
p: You get an A on the final exam.
q: You do every exercise in this book.
r: You get an A in this class.

Prepared By: Engr. Elsa N. Calvez

 A) You get an A in this class, but you do not do every exercise in this book.
Let p be the proposition "You get an A in this class," q be the proposition "You
do every exercise in this book," and r be the proposition "You get a passing
grade in this class."

Using logical connectives, we can write the given statement as:

p ∧ ¬q → r

In English, this means "If you get an A in this class and you do not do every
exercise in this book, then you get a passing grade in this class."

B) You get an A on the final, you do every exercise in this book, and you get
an A in this class.Let:

● p = "You get an A on the final"

● q = "You do every exercise in this book"
● r = "You get an A in this class"

Then the proposition can be written as:

p ∧ q ∧ r, using the logical AND connective.

Alternatively, it can also be written as:

(p ∧ q) → r, using the logical IMPLICATION connective. This proposition means that if

you get an A on the final and do every exercise in this book, then you will get an A in this
class.

C)To get an A in this class, it is necessary for you to get an A on the final.Let:

● p = "You get an A in this class."

● q = "You get an A on the final."
● r = "It is necessary to get an A on the final to get an A in this class."

The proposition can be represented as:

p→r

This can be read as "If you get an A in this class, then it is necessary to get an A on the
final." Alternatively, it can be expressed as:

If p, then r.

We can also express the proposition using conjunction and implication as follows:

p∧r→q

This can be read as "If you get an A in this class and it is necessary to get an A on the
final, then you get an A on the final." Alternatively, it can be expressed as:

Prepared By: Engr. Elsa N. Calvez

If both p and r are true, then q is also true.

D)You get an A on the final, but you don’t do every exercise in this book;
nevertheless, you get an A in this class.Let p be "You get an A on the final", q
be "You do every exercise in this book", and r be "You get an A in this class".
The proposition can be written as:

(p ∧ ¬q) → r

This can be read as "If you get an A on the final and you don’t do every exercise in this
book, then you get an A in this class."

E) Getting an A on the final and doing every exercise in this book is sufficient
for getting an A in this class. Let p be the proposition "Getting an A on the
final"
Let q be the proposition "Doing every exercise in this book"
Let r be the proposition "Getting an A in this class"

The given statement can be expressed as:

(p ∧ q) → r

which can be read as "If p and q are both true, then r is true." In other words, getting an A
on the final and doing every exercise in this book is sufficient to guarantee getting an A
in this class.

F) You will get an A in this class if and only if you either do every exercise in
this book or you get an A on the final.Let p be the proposition "You do every
exercise in this book"
Let q be the proposition "You get an A on the final"
Let r be the proposition "You will get an A in this class"

The given statement can be expressed as:

r ↔ (p ∨ q)

Prepared By: Engr. Elsa N. Calvez

which can be read as "You will get an A in this class if and only if you do every exercise
in this book or you get an A on the final." This means that either doing every exercise in
the book or getting an A on the final is sufficient to guarantee getting an A in the class,
and that neither one is necessary if the other is achieved.

Test VI. Negate the following:

1. All integers y, y2 -3 = 0 The equation y^2 - 3 = 0 can be rewritten as y^2 =

3. To negate all integers that satisfy this equation, we need to find all integers y such
that y^2 is not equal to 3.

One way to do this is to use proof by contradiction. Suppose there exists an integer y
such that y^2 = 3. Then y is the square root of 3, which is not an integer. This
contradicts our assumption that y is an integer.

Therefore, there are no integers that satisfy the equation y^2 - 3 = 0. The negation of
this statement is that all integers do not satisfy the equation, which is true.

2. 8 is a perfect cube.The statement "8 is a perfect cube" is true because 8

can be expressed as the cube of 2, i.e., 8 = 2^3.

To negate this statement, we can use the logical negation operator "not" and write:

"Not (8 is a perfect cube)"

This can also be written as:

"8 is not a perfect cube"

Therefore, the negation of the statement "8 is a perfect cube" is "8 is not a perfect cube".

3. Some CpE students are noisy.The statement "Some CpE students are
noisy" asserts that there exists at least one CpE student who is noisy.

To negate this statement, we can use the negation of the quantifier "some", which is
"none" or "no". So, the negation of the statement would be:

"No CpE students are noisy"

This means that there are no CpE students who are noisy.

Prepared By: Engr. Elsa N. Calvez

 4. Not all CpE students are showy.The statement "Not all CpE students are
showy" asserts that there are some CpE students who are not showy, but it does not
specify whether all or only some CpE students are not showy.

To negate this statement, we can use the negation of the negation operator "not", which
cancels out the double negative and leaves us with the original positive statement. So,
the negation of the statement would be:

"All CpE students are showy"

This means that every CpE student is showy, which is the opposite of the original
statement.

5. 2+1=3 2+1≠3

Prepared By: Engr. Elsa N. Calvez