Discrete Math for Computer Science
Exam 1 and 2 Review with Verified
Solutions | 100% Pass Guaranteed |
Graded A+ |
Administrator
[COMPANY NAME] [Company address]
, Discrete Math for Computer Science Exam 1
and 2 Review
1. Juan is a math major but not a computer science
m À ~c
major. (m = "Juan is a math major;" c = "Juan is
a computer science major.")
2. Write the statements in symbolic form using the
(h À w) À ~s
sym-
bols ~, Á, and À and the indicated letters to
represent component statements.
Let h = "John is healthy," w = "John is wealthy,"
and s = "John is wise."
John is healthy and wealthy but not wise.
3. Write the statements in symbolic form using the sym- ~w À (h À s)
bols ~, Á, and À and the indicated letters to
represent component statements.
Let h = "John is healthy," w = "John is wealthy,"
and s = "John is wise."
John is not wealthy, but he is healthy and wise.
4. Write the statements in symbolic form using the sym- ~w À ~h À ~s
bols ~, Á, and À and the indicated letters to
represent component statements.
Let h = "John is healthy," w = "John is wealthy,"
and s = "John is wise."
John is neither healthy, wealthy, nor wise.
5. Write the statements in symbolic form using the sym- w À ~(h Á s)
bols ~, Á, and À and the indicated letters to
represent component statements.
Let h = "John is healthy," w = "John is wealthy,"
and s = "John is wise."
John is wealthy, but he is not both healthy and wise.
6. Write the statement in symbolic form using the p(q
sym- bols ~, (, and ' and the indicated letters to
represent component statements.
, Discrete Math for Computer Science Exam 1
and 2 Review
Let p = "x > 6," q = "x = 6," and r = "11 > x. not both a
math and
xe6 computer
science
7. Write the statement in symbolic form using the sym- major.
bols ~, (, and ' and the indicated letters to represent
component statements.
Let p = "x > 6," q = "x = 6," and r = "11 > x.
11 > x > 6
8. Write the statement in symbolic form using the
sym- bols ~, (, and ' and the indicated letters to
represent component statements.
Let p = "x > 6," q = "x = 6," and r = "11 > x.
11 > x e 6
9. Use De Morgan's laws to write the negation for
the statement.
The train is late or my watch is fast.
10. Assume x is a particular real number and use De
Morgan's laws to write the negation for the
statement.
4<x<3
11. Assume x is a particular real number and use De
Morgan's laws to write the negation for the
statement.
xd 4 or x > 4
12. Determine whether the statements in A and B are
logically equivalent.
Statement A: Bob is both a math and computer sci-
ence major and Ann is a math major, but Ann is
, Discrete Math for Computer Science Exam 1
and 2 Review
r'p
r ' (p ( q)
The train is not late and my watch is not fast.
4x eor x e 3
x > 4 and x d 4
(b ' m) ' ~a
Exam 1 and 2 Review with Verified
Solutions | 100% Pass Guaranteed |
Graded A+ |
Administrator
[COMPANY NAME] [Company address]
, Discrete Math for Computer Science Exam 1
and 2 Review
1. Juan is a math major but not a computer science
m À ~c
major. (m = "Juan is a math major;" c = "Juan is
a computer science major.")
2. Write the statements in symbolic form using the
(h À w) À ~s
sym-
bols ~, Á, and À and the indicated letters to
represent component statements.
Let h = "John is healthy," w = "John is wealthy,"
and s = "John is wise."
John is healthy and wealthy but not wise.
3. Write the statements in symbolic form using the sym- ~w À (h À s)
bols ~, Á, and À and the indicated letters to
represent component statements.
Let h = "John is healthy," w = "John is wealthy,"
and s = "John is wise."
John is not wealthy, but he is healthy and wise.
4. Write the statements in symbolic form using the sym- ~w À ~h À ~s
bols ~, Á, and À and the indicated letters to
represent component statements.
Let h = "John is healthy," w = "John is wealthy,"
and s = "John is wise."
John is neither healthy, wealthy, nor wise.
5. Write the statements in symbolic form using the sym- w À ~(h Á s)
bols ~, Á, and À and the indicated letters to
represent component statements.
Let h = "John is healthy," w = "John is wealthy,"
and s = "John is wise."
John is wealthy, but he is not both healthy and wise.
6. Write the statement in symbolic form using the p(q
sym- bols ~, (, and ' and the indicated letters to
represent component statements.
, Discrete Math for Computer Science Exam 1
and 2 Review
Let p = "x > 6," q = "x = 6," and r = "11 > x. not both a
math and
xe6 computer
science
7. Write the statement in symbolic form using the sym- major.
bols ~, (, and ' and the indicated letters to represent
component statements.
Let p = "x > 6," q = "x = 6," and r = "11 > x.
11 > x > 6
8. Write the statement in symbolic form using the
sym- bols ~, (, and ' and the indicated letters to
represent component statements.
Let p = "x > 6," q = "x = 6," and r = "11 > x.
11 > x e 6
9. Use De Morgan's laws to write the negation for
the statement.
The train is late or my watch is fast.
10. Assume x is a particular real number and use De
Morgan's laws to write the negation for the
statement.
4<x<3
11. Assume x is a particular real number and use De
Morgan's laws to write the negation for the
statement.
xd 4 or x > 4
12. Determine whether the statements in A and B are
logically equivalent.
Statement A: Bob is both a math and computer sci-
ence major and Ann is a math major, but Ann is
, Discrete Math for Computer Science Exam 1
and 2 Review
r'p
r ' (p ( q)
The train is not late and my watch is not fast.
4x eor x e 3
x > 4 and x d 4
(b ' m) ' ~a
