SET Theory - Assignment Problem

-

 

Assignment Problems

1. Let A = {1, 2, 3, 4, 5, 6} and B = {2, 4, 6, 8}.

What is the cardinality of B? A ⋃ B, A ⋂ B?

 

2. What is the cardinality of P = the set of English names for the months of the year?

 

3. Let A= {0,1,2,3,4,5}  B={1,3,4} C={6,4,3,1}  D={0,1,2,5,3,4}  and E={ }

Which of the sets B, C, D, E are subsets of A?

 

4. Consider the sets:

A = {red, green, blue}
B = {red, yellow, orange}
C = {red, orange, yellow, green, blue, purple}

Find the following:

1.    Find A ⋃ B

2.    Find A ⋂ B

3.    Find Ac⋂ C

4.    Find A-B and B-A

 

5. Suppose H = {cat, dog, rabbit, mouse}, F = {dog, cow, duck, pig, rabbit}, and 

W = {duck, rabbit, deer, frog, mouse}

1.    Find (H ⋂ F) ⋃ W

2.    Find H ⋂ (F ⋃ W)

3.    Find (H ⋂ F)c ⋂ W

 

6. Create an expression to represent the outlined part of the Venn diagram shown

7. A survey asks: “Which online services have you used in the last month?”

·         Twitter

·         Facebook

·         Have used both

The results show 40% of those surveyed have used Twitter, 70% have used Facebook, and 20% have used both. How many people have used neither Twitter or Facebook?

Comments

Post a Comment

Popular posts from this blog

Data Structure - Lab

-
  1.a. List Abstract Data Type (ADT) using an array   Aim To write a Python program to implement the List Abstract Data Type (ADT) using an array , and to perform basic operations such as insertion, deletion, searching, and display .   Algorithm Start the program. Create an empty list L. Display the menu with list operations. Read the user’s choice. If choice is Insert , read the element and add it to the list. If choice is Delete , read the element and remove it from the list if it exists. If choice is Search , check whether the element is present in the list. If choice is Display , print all the elements of the list. Repeat steps 3–8 until the user selects Exit . Stop the program. # List ADT using Array   L = []    # empty list (array)   while True:     print("\nLIST ADT MENU")     print("1. Insert")     print("2. Delete") ...
Read more

Data Structure - Binary Tree

-
Image
  Binary Tree  Binary Tree  is a non-linear and hierarchical   data structure where each node has  at most two children  referred to as the left child and the right child.  The topmost node in a binary tree is called the root, and the bottom-most nodes(having no children) are called leaves. Representation of Binary Tree Each node in a Binary Tree has three parts: ·          Data ·          Pointer to the left child ·          Pointer to the right child   Terminologies in Binary Tree ·          Parent Node : A node that is the  direct ancestor  of a node(its child node). ·          Child Node : A node that is the  direct descendant  of another node (its parent). ·        ...
Read more

Mathematical Foundation - Unit 1

-
  Mathematical Foundation Unit-1 - Mathematical Logic & Predicates Propositional Logic Syntax - Truth Tables - CNF and DNF Normal Forms – Predicate Calculus - Universal & Existential Quantifiers - Rules of Inference – Mathematical Induction - Well-Formed Formulas for Automated Proving.   1. Propositional Logic — Syntax & Connectives 1.1 What is Logic? •       Logic is the study of correct reasoning. •       It separates valid from invalid arguments •       It uses clear rules instead of vague words.   Key applications in computer science: •       Design of computer circuits •       Construction and verification of computer programs •       Artificial intelligence and knowledge representation •       Database query languages   1.2 Propositions ...
Read more