4. Write a program which read two sets of integer elements (10 elements for each set)and find the intersection of two entered sets. (According to the definition of "set", elementsare guaranteed to be unique within a set)Expected Output:Example-1Example-2Enter 10 Elements of Set A:Enter 10 Elements of Set A:1 2 3 4 5 6 7 8 9 101 2 3 4 5 6 7 8 9 10Enter 10 Elements of Set B:Enter 10 Elements of Set B:11 12 13 14 15 16 17 18 19 201 2 3 4 5 6 7 8 9 10The Intersected Element of Set A and The Intersected Elements of Set AB are not Found.and B are:1 2 3 4 5 6 7 8 9 10

Here is the c++ program of the above problem. See below steps.

4. Write a program which read two sets of integer elements (10 elements for each set) and find the intersection of two entered sets. (According to the definition of "set", elements are guaranteed to be unique within a set) Expected Output: Example-1 Enter 10 Elements of Set A: Example-2 Enter 10 Elements of Set A: 1 2 3 4 5 6 7 8 9 10 1 2 3 4 5 6 7 8 9 10 Enter 10 Elements of Set B: Enter 10 Elements of Set B: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 The Intersected Element of Set A and The Intersected Elements of Set A B are not Found. and B are: 1 2 3 4 5 7 8 9 10

4. Write a program which read two sets of integer elements (10 elements for each set) and find the intersection of two entered sets. (According to the definition of "set", elements are guaranteed to be unique within a set) Expected Output: Example-1 Enter 10 Elements of Set A: Example-2 Enter 10 Elements of Set A: 1 2 3 4 5 6 7 8 9 10 1 2 3 4 5 6 7 8 9 10 Enter 10 Elements of Set B: Enter 10 Elements of Set B: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 The Intersected Element of Set A and The Intersected Elements of Set A B are not Found. and B are: 1 2 3 4 5 7 8 9 10

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

C++
Use Python code with: "def recolorImage(img,color):" without using cv2 or PIL recolor(img, color) - Changes all non-white pixels of the image referred to by the parameter img to the specified color, and returns a new image with the changes. img is a 2D array of RGB pixels which represent images. color is a list containing 3 integers, each from 0 to 255, representing RGB values. To create a new image use the cmpt120image.getBlackImage() function which returns a new canvas to draw on.
Create a new file in C++ and save it as lab12_XYZ.cpp Consider rolling two six-sided dice. While the result of each throw is independent of all rolls that have come before, we can still calculate the odds of rolling any given number between 2 and 12. This program will calculate those odds by generating a large number (100,000) of random values (i.e. "rolling the dice") and storing the results in an array. When all values have been rolled, we will display the results (counts and odds to 2 decimal places) to the user. x x 2 3 4 5 6 7 8 9 10 11 12 //value for sum of 2 dice rolls +---+---+---+---+---+---+---+---+---+---+--- | | | | | | | | | | | | | | //counters for number of times value is rolled +---+---+---+---+---+---+---+---+---+---+---+---+---+ 0 1 2 3 4 5 6 7 8 9 10 11 12 //array index In Lab 5, sample code was provided for generating a random number. In this lab, I've provided a header file…
Please I need it quickly !!! In python We have a list (named data) of numbers sorted in ascending order, for example: data = [2, 4, 5, 9, 10, 12, 13, 17, 18, 20] Write a function (named DataVar(data)), which take a list (data) as input parameter and performs the following steps on the list: 1) it finds the mean m of the data (for the given example, it is m = (2 + 4 + 5 + 9 + 10 + 12 + 13 + 17 + 18 + 20)/10 =110/10 = 11). 2) then, it finds the difference of data and m. Essentially, it finds for all data: Diff = data-m For the given example, Diff = [-9, -7, -6, -2, -1, 1, 2, 6, 7, 9]. 3) then, it finds the sum of Diff and 7. Essentially, it finds for all data: Sums = Diff+7 For the given example, Sums = [-2, 0, 1, 5, 6, 8, 9, 13, 14, 16]. 4) then, it finds the square of all the elements of Sums, such that Squares = square of the elements of Sums. For the given example, Squares = [4, 0, 1, 25, 36, 64, 81, 169, 196, 256]. 5) it finds the average of Squares and stores it in result, and…
Language: C++ Write a Program with Comments for your code to improve quick sort. The quick sort algorithm presented in the ClassNotes-Sorting, it selects the first element in the list as the pivot. Revise it by selecting the median among the first, middle, and last elements in the list.Explain your Outputs or Answers for the following: (C) Give a list of n items (for example, an array of 10 integers) representing the worst-case scenario. (D) Give a list of n items (for example, an array of 10 integers) representing the best-case scenario. Please compile your answers in a file including all source code with comments, Explain your running Outputs or Answers in (A) ~(D). Quicksort that was mentioned in the ClassNotes: #include <iostream>using namespace std; // Function prototypesvoid quickSort(int list[], int arraySize);void quickSort(int list[], int first, int last);int partition(int list[], int first, int last); void quickSort(int list[], int arraySize){quickSort(list, 0,…
python please make it simple
this code should be in python: write a function that receives a list as its only parameter. Inside the function remove all the duplicate items from the list and returns a new list. For Example: If we call the function with [“dad”, “aunt”, “mom”, “sister”, “mom”] as its input, the returned value should be [“dad”, “aunt”, “mom”, “sister”]. The order of the items inside the returned list does not matter.
should be in python: write a function that receives a list as its only parameter. Inside the function remove all the duplicate items from the list and returns a new list and the input should be given by user. For Example: If we call the function with [“dad”, “aunt”, “mom”, “sister”, “mom”] as its user input, the returned value should be [“dad”, “aunt”, “mom”, “sister”]. The order of the items inside the returned list does not matter.
Write a function that verifies if a given number exists in an array of floats. The function is supposed to return the first position in where the number is encountered. If the given number does not exist, the function returns –1. Then write a complete program that asks the user to enter an array of 8 floats and calls the function. The prototype of the function should be like: int Search (floats a[ ], int n, float number); Example: Consider the following array of floats int x[8]={2.1, 5.0, 9.8, 4.4, 6.8, 12.88, 9.87, 4.56}; If the number to be searched is 5.4, the function returns –1 If the number to be searched is 9.8,the function returns 2 C++ language only.
in c++ please paste working code. the program should Input- Julia Lucas Mia -1 With an expected output of- Julia Lucas Mia Julia Mia Lucas Lucas Julia Mia Lucas Mia Julia Mia Julia Lucas Mia Lucas Julia
4,