Scribd
Upload
15 views4 pages

Discrete Math Final Exam Compress

Uploaded by

terenzdelrosario2005
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
15 views4 pages

Discrete Math Final Exam Compress

Uploaded by

terenzdelrosario2005
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Is the statement (p→r)∧(q→r)≡(p∨q)→r logically equivalent?

TRUE

Is the statement (p→q)∨(p→r)≡p→(q∨r) logically equivalent?

TRUE

A statement (proposition) is any declarative sentence which is either true or false but not both.

TRUE

Is the statement p∨q≡¬p→q logically equivalent?

TRUE
How many vertices does K3,5 have?

It is the number of edges incident to the vertex and is denoted deg(v).


degree

What particular Logical Equivalence Law is being described (p V q) V r ≡p V (q V r)

Associative Law

How many vertices and edges must a graph have if its degree sequence is { 3, 3, 3, 2, 2, 1 }?

How many edges are there in a graph with 10 vertices each of degree six?

30

What particular Logical Equivalence Law is being described ¬(p ∧ q)≡¬p∨¬q

De Morgan’s Law

A simple graph contains 35 edges, four vertices of degree 5, five vertices of degree 4 and four vertices of
degree 3. Find the number of vertices with degree 2.

Is the statement ¬(p→q)≡p∧¬q logically equivalent?

TRUE

Tautology is a statement that is always true regardless of the truth values of the individual logical
variables.

TRUE

0 0
A graph has 24 edges and degree of each vertex is k, then which of the following is possible number of
vertices?

What particular Logical Equivalence Law is being described p∨¬p ≡T

Negation Law

What particular Logical Equivalence Law is being described pVp≡p

Idempotent Law

Is the statement p→q≡¬p→¬q logically equivalent?

TRUE

Is the statement p↔q≡(p∧q)∨(¬p∧¬q)logically equivalent?

TRUE

A graph with 21 edges has 7 vertices of degree 1, three of degree2, seven of degree 3, and the rest of
degree 4. How many vertices does it have?

19

How many vertices does K3,5 have?

What particular Logical Equivalence Law is being described ¬(¬p)≡p

Double Negation Law

Is the statement p↔q≡¬p↔¬qlogically equivalent?

TRUE

Is the statement ¬(p↔q)≡p↔¬q logically equivalent?

TRUE

How many edges does K7 have?

21

What particular Logical Equivalence Law is being described pVT ≡p

Identity Law

Is the statement (p→q)∨(q→r) not a tautology?

FALSE

0 0
It is the number of edges incident to the vertex and is denoted deg(v).

degree

How many edges does a graph have if its degree sequence is 5, 2, 2, 2, 2, 1?

Logical equivalence is a compound propositions that have the same truth values in all possible cases.

TRUE

How many edges are there in a graph with 10 vertices each of degree six?

30

Is the statement (p→q)∧(p→r)≡p→(q∧r) logically equivalent?

TRUE

A contradiction is a statement that is always false regardless of the truth values of the individual logical
variables.

TRUE

Two proposition forms are called logically equivalent if and only if they have identical truth values for
each possible substitution of propositions for their proposition variable.

TRUE

A simple graph G has 24 edges and degree of each vertex is 4. Find the number of vertices.

12

How many vertices does P7 have?

How many edges does a graph have if its degree sequence is 5, 2, 2, 2, 2, 1?

How many edges does C6 have?

What particular Logical Equivalence Law is being described pVT ≡T

Domination Law

What particular Logical Equivalence Law is being described p V (p∧q) ≡p

Absorption Law

0 0
Is the statement p∧q≡¬(p→¬q) logically equivalent?

TRUE

How many edges does K7 have?

21

If a graph has 5 vertices, can each vertex have degree 3?

NO

What particular Logical Equivalence Law is being described pVq≡qVp

Commutative Law
How many edges does C6 have?

Is the statement (p→q)∧(p→r)≡p→(q∧r) logically equivalent?

TRUE

What particular Logical Equivalence Law is being described p∨(q∧r)≡(pVq)∧(pVr)

Distributive Law

Is the statement ¬(¬p∧q)∧(p∨q)≡p logically equivalent?

TRUE

A graph contains 21 edges, 3 vertices of degree 4 and all other vertices of degree 2. Find total number of
vertices.

18

How many vertices does P7 have?

Is the statement p↔q≡(p→q)∧(q→p)logically equivalent?

TRUE

0 0

You might also like