Transcription of Discrete Mathematics for Computer Science - UH
{{id}} {{{paragraph}}}
Example: bachelor of science
Discrete Mathematics for Computer Science - UH
I. = . 1. ! |~ilHTerms Meaning SectionSets, Proof Templates, and Inductionx e A x is an element ofA f A x is not an element ofA x E A and P(x)} Set notation Natural numbers Integers Rationals Real numbers = B Sets A and B are equal C B A is a subset of B g B A is nota subset of B C B A is a proper subset of B 5 B A is nota proper subset of B a bimplies a b a if and only if b A union B A intersect B Generalized union of family of sets X Generalized intersection of family of sets X Xi Xm U ..UXn Xm n .. n Xn -B Elements of A not in B Elements not in A D B (A U B) -(A n B) (X) Power set of X x Y Product of X and Y A y Meet ofx and y v y Join ofx and y Complement of x Top Bottom Cardinality of A a,, + " -".
3.10 Relational Databases: An Introduction 202 3.10.1 Storing Information in Relations 203 3.10.2 Relational Algebra 204 3.11 Exercises 211 3.12 Chapter Review 212 3.12.1 Summary 213 3.12.2 Starting to Review 215 3.12.3 Review Questions 216 3.12.4 Using Discrete Mathematics in Computer Science 217
Loading..
Tags:
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: