Let U = {0, 1,2, ...,9}, A = {1, 2, 5, 8, 9}, B = {0, 1, 3, 4}, and C (AU B) nC = AU (Bn C) = A – (B – C) = B – (An C) = %3D C – (A U B) = %3D (A n B) U C =
Let U = {0, 1,2, ...,9}, A = {1, 2, 5, 8, 9}, B = {0, 1, 3, 4}, and C (AU B) nC = AU (Bn C) = A – (B – C) = B – (An C) = %3D C – (A U B) = %3D (A n B) U C =
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question

Transcribed Image Text:Let U = {0, 1,2, ...,9}, A = {1,2, 5, 8,9}, B = {0, 1, 3, 4}, and C = {1,4, 5, 9}.
%3D
(AU B) n C =
AU (Bn C) =
A – (B – C) =
B - (An C) =
C- (A U B) =
(An B) U C =

Transcribed Image Text:A = {3x : x is even and 4 < x< 12}. Rewrite A in roster notation.
%3D
Expert Solution

Explanation:
Set Operation:
- Union: It is denoted by symbol. Let's take two sets A & B, then contains all the elements which are present in set A or B or both.
- Intersection: It is denoted by symbol. Let's take two sets A & B, then contains all the elements which are present in set A and B both.
- Difference: It is denoted by symbol. Let's take two sets A & B, then contains all the elements which are present in set A but not in B.
- Complement: Let's take a set A, then contains all the elements which are present in the universal set not in the A.
Roaster Notation of Set: The set is represented in roaster notation by listing all the elements within braces {} and separated by comma(,).
Step by step
Solved in 2 steps

Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education