Post 1: Initial Response

Imagine you are responsible for your organizations analytic tasks, and you are currently brainstorming how to query a relational database of marketing information for the organization. You want to test your understanding of how you might relate the database tables with the use of set theory, and particularly subsets. To carry out your test, complete each of the following:

To define two sets, set A and set B, first conduct an online browsing trial, in which you spend 1020 minutes looking at different websites, such as for national news, social media, sports, hobbies, recipes, etc. Let set A represent exactly three distinct company names from any online advertisements you saw during your browsing trial. Let set B represent at least three distinct company names for any online retailers you have purchased from in the past year. To prepare to use your algorithm, answer the following questions: How many elements are in set A? This is what you will set as m = _. How many elements are in set B? This is what you will set as n = _. What are your first and last elements of A? Show these as a[1] = __ and a[m] = _.* What are your first and last elements of B? Show these as b[1] = __ and b[n] = _.* *Note: Recognize that there are other elements you will cycle through as you trace the algorithm. While you are not required to list all elements in this form, you will need to use them, in addition to the first and last elements, as you complete your trace.

Using your sets A and B along with what you just outlined to prepare, determine an algorithm that you can use to see whether A B. State the algorithm that you would use to compare these sets. Based on your algorithm, did you find that A B or that A B? Explain. If A B, how are they related (e.g., disjoint, intersecting) ALSO THERE IS SOLVED EXAMPLE I HAD ATTACHED. ANSWER SHOULD BE IN THE FORM THAT I HAD ATTACHED

Unit 6 Discussion Example - Set Theory as a Framework for Relational Databases Post 1 Initial Response 1) I searched CNN, Facebook, ESPN, and of course, my favorite recipe sites. Here are some of the advertisements that came up: Online advertisement companies A= [Toyata, Liberty Mutual, Smashburger] Online retailers 1 have purchased from B={ Amazon, Barnes \& Noble, Smashburger, Target } 2) The cardinality of set A is n(A)=3. I will set m=3 to use in the algorithm. The cardinality of set B is n(B)=4. I will set n=4 to use in the algorithm. A[1]= Toyota A[3]=5 mashburger B[1] = Amazon B|4] = Target 3) Here is the trace table for i, j, found and answer for m=3 and n=4. 4) Based on my trace, A is NOT a subset of B since Toyota, the first element of set A is NOT included in set B. If I continued my algorithm with all elements of set A searching through set B, I would see that there is ONE element that is in both set A and set B. Therefore set A and set B are intersecting. Unit 6 Discussion Example - Set Theory as a Framework for Relational Databases Post 1 Initial Response 1) I searched CNN, Facebook, ESPN, and of course, my favorite recipe sites. Here are some of the advertisements that came up: Online advertisement companies A= [Toyata, Liberty Mutual, Smashburger] Online retailers 1 have purchased from B={ Amazon, Barnes \& Noble, Smashburger, Target } 2) The cardinality of set A is n(A)=3. I will set m=3 to use in the algorithm. The cardinality of set B is n(B)=4. I will set n=4 to use in the algorithm. A[1]= Toyota A[3]=5 mashburger B[1] = Amazon B|4] = Target 3) Here is the trace table for i, j, found and answer for m=3 and n=4. 4) Based on my trace, A is NOT a subset of B since Toyota, the first element of set A is NOT included in set B. If I continued my algorithm with all elements of set A searching through set B, I would see that there is ONE element that is in both set A and set B. Therefore set A and set B are intersecting