2. a) If A, B and C are three sets, complete the following De-Morgan's laws(A u B)=(An B)3Di.i.ii.A-(Bu C)=iv.A- (Bn C ) =|b) If A and B are finite sets which are subsets of U. Establish a formula for n(AUB) in terms of n(A), n(B) and n(A n B). Hence or otherwise deduce a formula fora particular case where A and B are disjoint? 1. In the following argument, determine the validity or otherwise of theStatement:a) "If you aren't polite, you won't be treated with respect. You aren'ttreated with respect. Therefore, you aren't polite.b) "If you play football during a thunderstorm, you'll get hit bylightning. You didn't get hit by lightning. Therefore, you didn't playfootball in a thunderstorm"Therefore, taxes are lowered."(i)Write out the propositional-statements in the above argument?(ii)State the premise(s) and conclusion in the argument?(iii). Using a truth table, determine the validity of the argument?

2. a. According to demorgans law, 1. (A union B)'=A' intersection B' 2. (A intersection B)'=A' union…

2. a) If A, B and C are three sets, complete the following De-Morgan's laws i. (Au B)= (An B)'= ii. ii. A-(Bu C)= A- ( B n C ) =| iv. b) If A and B are finite sets which are subsets of U. Establish a formula for n(AU B) in terms of n(A), n(B) and n(An B). Hence or otherwise deduce a formula for a particular case where A and B are disjoint?

2. a) If A, B and C are three sets, complete the following De-Morgan's laws i. (Au B)= (An B)'= ii. ii. A-(Bu C)= A- ( B n C ) =| iv. b) If A and B are finite sets which are subsets of U. Establish a formula for n(AU B) in terms of n(A), n(B) and n(An B). Hence or otherwise deduce a formula for a particular case where A and B are disjoint?

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

See similar textbooks

Similar questions

State whether each of the following functions is injective, surjective, bijective, or none ofthese categories: (N is the set of natural numbers, and Σ∗is the set of all strings over Σ.)(a) f : N → N , f(n) = n div 3(b) g : N → N , g(n) = n2 + 2n + 1 (c) h : Σ∗ → Σ∗, where Σ = {a, b}, and h(w) = a|w| (d) h : Σ∗ → Σ∗, where Σ = {a, b}, and h(w) = wR
State whether each of the following functions is injective, surjective, bijective, or none ofthese categories: (N is the set of natural numbers, and Σ∗is the set of all strings over Σ.)(a) f : N → N , f(n) = n div 3(b) g : N → N , g(n) = n2 + 2n + 1(c) h : Σ∗ → Σ∗, where Σ = {a, b}, and h(w) = a|w|. (d) h : Σ∗ → Σ∗, where Σ = {a, b}, and h(w) = wR.
Write a function linear_independence that takes a collection of vectors with integer entries (each written as a list), and returns True if this collection of vectors is linearly independent, and False otherwise. Examples: linear_independence([1,2]) should return True. linear_independence([1,3,7],[2,8,3],[7,8,1]) should returnTrue. linear_independence([1,3,7],[2,8,3],[7,8,1],[1,2,3]) should return False.
c++ Given two natural numbers m and n and two ordered sequences with m and integer numbers, a single ordered sequence containing all the elements of the original sequences without repetition is obtained. Use vectors in this activity.
If A = {1, 2, 6} and B = {2, 3, 5}, then the union of A and B is
Q. Let A = {a, b, c, d, e} and B = {1, 2, 3, 4, 5, 6, 7, 8}. How many functions f : A → B(a) ... are injective?(b) ... are not injective?(c) ... are such that f(a) = f(b) = f(c)?(d) ... are such that exactly three elements of A have 8 as an image?(e) ... are surjective?
Write proof to the following statements.(a) Given that (A ∪ B) ∩ B′ ⊆ C prove that 2A∩B′ ⊆ 2C .(b) Prove that (A′ ∪ (A ∩ C) ∪ (A ∩ C′)) ∩ (B′ ∩ (C′ ∪ B) ∪ (C ∪ B)) = U , where Udenotes the universal set?
Construct an explicit bijection between the following sets. Once you've done that, construct injections going in opposite directions as if you were aiming to apply the S-B Theorem. Reflect on how much nicer it is to use S-B. a. (0,1) and [0,1)b. (0,1) and [0,1] Please note that in this assignment, it is not enough to simply give a function and state that it is injective/surjective/bijective. You have to provide a PROOF that the function you're providing has these properties.