Discrete Mathematics Final Exam
Comprehensive Quiz Study Guide with Answers
Discrete Math
| 100% Pass for Computer
Guaranteed Science
| Graded A+ |
DISCRETE MATH Exam
Course Title and Number: DISCRETE MATH
Exam Title: DISCRETE MATH Midterm and Final
Exam Date: Midterm and Final Exam 2024- 2025
Instructor: [Insert Instructor’s Name]
Student Name: [Insert Student’s Name]
Student ID: [Insert Student ID]
Examination
180 minutes
Instructions:
1. Read each question carefully.
2. Answer all questions.
3. Use the provided answer sheet to mark your responses.
4. Ensure all answers are final before submitting the exam.
5. Please answer each question below and click Submit when you
have completed the Exam.
6. This test has a time limit, The test will save and submit
automatically when the time expires
7. This is Exam which will assess your knowledge on the course
Learning Resources.
Good Luck!
,Read All Instructions Carefully and Answer All the
Questions Correctly Good Luck: -
Conditional Statements - Answer>> P => Q
Converse of a Conditional Statement - Answer>> Q
=> P
Contrapositive of a Conditional Statement - Answer>>
-Q => -P
Equivalent Statements - Answer>> Have the same
logical value (Wether T or F)
Compound Statements - Answer>> a statement
formed by using a connective to join two independent
clauses or logical statements.
Tautology - Answer>> a formula which is always true
for every value of its propositional variables
Statement - Answer>> A statement (proposition) is a
sentence that is either true or false, but not both.
Negation - Answer>> A negation of a statement p is
the statement "not p" or "it is not the case that p," and
is denoted by ⌐p. A statement and its negation always
have the opposite truth value.
Conjunction - Answer>> The conjunction of two
statements p and q is the statement "p and q," and is
denoted by p ᴧ q. The conjunction p ᴧ q is true if both p
and q are true and is false otherwise.
, Disjunction - Answer>> The disjunction of two
statements p and q is the statement "p or q," and is
denoted by p v q. The disjunction p v q is true if either
of p and q are true or if both are true.
Conditional - Answer>> A statement of the form "if p,
then q" where p and q are statements, is called a
conditional and is denoted by p -> q.
Forms of the conditional statement - Answer>> The
conditional, p→ q can be stated in any of the following
ways:
If p, then q
q if p
p implies q
p only if q
p is sufficient for q
q is necessary for p
Tautology - Answer>> A tautology is a statment that
is always true no matter what truth values are assigned
to the statements appearing in it.
Fallacy(or Contradiction) - Answer>> A fallacy(or
Contradiction) is a statement that is always false.
Contingency - Answer>> A statement that is
sometimes false and sometimes true is called a
contingency
De Morgan's Law - Answer>> For statements p and q,
⌐(p ᴧ q) ≡ ⌐p v ⌐q
⌐(p v q) ≡ ⌐p ᴧ ⌐q
Commutative Laws - Answer>> p ᴧ q ≡ q ᴧ p
pvq≡qvp
Comprehensive Quiz Study Guide with Answers
Discrete Math
| 100% Pass for Computer
Guaranteed Science
| Graded A+ |
DISCRETE MATH Exam
Course Title and Number: DISCRETE MATH
Exam Title: DISCRETE MATH Midterm and Final
Exam Date: Midterm and Final Exam 2024- 2025
Instructor: [Insert Instructor’s Name]
Student Name: [Insert Student’s Name]
Student ID: [Insert Student ID]
Examination
180 minutes
Instructions:
1. Read each question carefully.
2. Answer all questions.
3. Use the provided answer sheet to mark your responses.
4. Ensure all answers are final before submitting the exam.
5. Please answer each question below and click Submit when you
have completed the Exam.
6. This test has a time limit, The test will save and submit
automatically when the time expires
7. This is Exam which will assess your knowledge on the course
Learning Resources.
Good Luck!
,Read All Instructions Carefully and Answer All the
Questions Correctly Good Luck: -
Conditional Statements - Answer>> P => Q
Converse of a Conditional Statement - Answer>> Q
=> P
Contrapositive of a Conditional Statement - Answer>>
-Q => -P
Equivalent Statements - Answer>> Have the same
logical value (Wether T or F)
Compound Statements - Answer>> a statement
formed by using a connective to join two independent
clauses or logical statements.
Tautology - Answer>> a formula which is always true
for every value of its propositional variables
Statement - Answer>> A statement (proposition) is a
sentence that is either true or false, but not both.
Negation - Answer>> A negation of a statement p is
the statement "not p" or "it is not the case that p," and
is denoted by ⌐p. A statement and its negation always
have the opposite truth value.
Conjunction - Answer>> The conjunction of two
statements p and q is the statement "p and q," and is
denoted by p ᴧ q. The conjunction p ᴧ q is true if both p
and q are true and is false otherwise.
, Disjunction - Answer>> The disjunction of two
statements p and q is the statement "p or q," and is
denoted by p v q. The disjunction p v q is true if either
of p and q are true or if both are true.
Conditional - Answer>> A statement of the form "if p,
then q" where p and q are statements, is called a
conditional and is denoted by p -> q.
Forms of the conditional statement - Answer>> The
conditional, p→ q can be stated in any of the following
ways:
If p, then q
q if p
p implies q
p only if q
p is sufficient for q
q is necessary for p
Tautology - Answer>> A tautology is a statment that
is always true no matter what truth values are assigned
to the statements appearing in it.
Fallacy(or Contradiction) - Answer>> A fallacy(or
Contradiction) is a statement that is always false.
Contingency - Answer>> A statement that is
sometimes false and sometimes true is called a
contingency
De Morgan's Law - Answer>> For statements p and q,
⌐(p ᴧ q) ≡ ⌐p v ⌐q
⌐(p v q) ≡ ⌐p ᴧ ⌐q
Commutative Laws - Answer>> p ᴧ q ≡ q ᴧ p
pvq≡qvp
