Sets

From Computer Science
Revision as of 12:45, 7 April 2023 by Jkinne (talk | contribs)
Jump to: navigation, search

An assignment in CS 303. Some problems are from MCS

Assignment

  1. Prove an identity.
    1. Give a proof that the subseteq operator makes a partial order. Namely, prove that the subseteq operator is reflexive, antisymmetric, and transitive. When you need to use names for sets, use A, B, C in the proof.
    2. Give a proof that set intersection is associative. When you need to use names for sets, use A, B, C in the proof.
  2. Basic questions about sets / basic reasoning / using the identities and rules for sets.
    1. MCS Problem 15.4
    2. MCS Problem 15.5
    3. MCS Problem 15.9
    4. MCS Problem 15.13
    5. MCS Problem 15.30
    6. MCS Problem 15.35