Exam (elaborations)
Discrete Mathematics and Its Applications, 8th Edition by Rosen
- Course
- Institution
- Book
Discrete Mathematics and Its Applications, 8th Edition by Rosen
[Show more]
Connected book
Book Title:
Author(s):
- Edition:
- ISBN:
- Edition:
More summaries for
-
Discrete Mathematics and Its Applications, 8th Edition by Rosen
-
Discrete Mathematics and Its Applications, 8th Edition by Rosen
-
Complete Solution Manual Discrete Mathematics and Its Applications 8th Edition Questions & Answers with rationales (Chapter 1-13)
Seller
Follow
phinta004
Reviews received
Content preview
Test Bank for Discrete Mathematics and Its Applications, 8thEdition by Rosen, 9781259676512, Covering Chapters 1-13 |
Includes Rationales
connectives - ANSWER: logical operators used to form new propositions from two or more existing
propositions
conjunction - ANSWER: "and"; true only when both propositions are true
disjunction - ANSWER: "or"; false only when both propositions are false
exclusive or - ANSWER: true only when exactly one of the propositions is true and false otherwise
implication - ANSWER: conditional statement; "if p, then q" false when p is true and q is false, true
otherwise.
converse of p->q - ANSWER: q->p; equivalent to inverse
contrapositive p->q - ANSWER: not q -> not p; has the same truth value as p->q always
inverse of p->q - ANSWER: not p -> not q; equivalent to converse
equivalent - ANSWER: two compound propositions always having the same truth value
biconditionals (bi-implications; biconditional statements) - ANSWER: if and only if; true only when p
and q have the same truth values; iff
Precedence of logical operators - ANSWER: negation, conjunction, disjunction, conditional,
biconditional
bit - ANSWER: symbol with two possible values, namely 0 and 1
boolean variable - ANSWER: a variable with a value of either true or false
bit string - ANSWER: sequence of zero or more bits; the length of this string is the number of bits in
the string
tautology - ANSWER: a compound proposition that is always true, no matter what the truth values of
the propositional variables that occur in it (emphasis on always)
contradiction - ANSWER: a compound proposition that is always false
contingency - ANSWER: a compound proposition that is always true
logically equivalent - ANSWER: compound propositions that have the same truth values in all possible
cases; when these two propositions, p and q, in the compound proposition p iff q is a tautology.
(emphasis on truth values)
distributive law (disjunction over conjunction) - ANSWER: p V (q^r) = (p v q) ^ (p v r)
De Morgan's Laws - ANSWER: how to negate conjunctions and disjunctions; the negation of a
disjunction is the conjunction of the negation of the components; the negation of a conjunction is the
disjunction of the negations of the component propositoins
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller phinta004. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $17.99. You're not tied to anything after your purchase.
Can Stuvia be trusted?
4.6 stars on Google & Trustpilot (+1000 reviews)
83100 documents were sold in the last 30 days
Founded in 2010, the go-to place to buy study notes for 14 years now