Discrete Structures

HW #9 — §2.2: Set Operations

Last Update: 7 November 2010

Note: NEW or UPDATED material is highlighted



All exercises come from, or are based on exercises from, the Rosen text.

Each HW problem's solution should consist of:

All solutions must be handwritten.

PUT YOUR NAME, DATE, RECITATION SECTION, & "HW #9" AT TOP RIGHT OF EACH PAGE;

STAPLE MULTIPLE PAGES


  1. (3 points each, total = 12 points)

    p. 130: 4 a–d


  2. UPDATED
    (3 points)

    p. 130: 14


  3. (3 points each; total = 6 points)

    p. 131: 16 a, b


  4. (3 points)

    p. 131: 24


  5. (3 points each; total = 6 points)

    1. Read the definition on p. 131, column 2, of the symmetric difference of two sets. Then express this definition in the language of first-order predicate logic plus set theory;
      i.e., find a predicate P such that A ⊕ B =def {x | P(x)}.

    2. Do p. 131: 32.


  6. (6 points each; total = 12 points)

    p. 131, #48 a, b


UPDATED
Total points = 42

Tentative grading scheme:

A       41-42
A-      38-40
B+      36-37
B       34-35
B-      31-33
C+      29-30
C       24-28
C-      20-23
D+      15-19
D        8-14
F        0- 7

DUE: AT THE BEGINNING OF LECTURE, FRI., NOV. 12



Text copyright © 2010 by William J. Rapaport (rapaport@buffalo.edu)
Cartoon links and screen-captures appear here for your enjoyment. They are not meant to infringe on any copyrights held by the creators. For more information on any cartoon, click on it, or contact me.
http://www.cse.buffalo.edu/~rapaport/191/F10/hw09.html-20101107