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

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter5: Control Structures Ii (repetition)

Section: Chapter Questions

Problem 14PE

See similar textbooks

Similar questions

Can you write a program in Python which allows the user to input 3 sets (A,B,C) and to display the cartesian product AxBxC of the 3 sets, and then calculate the number of elements in AxBxC. Here is an example of how I want it to look. If the input looks like A={a,b,c}, B={1,2,3,4}, C={A,B,C,D,E}, the output should look like “AxBxC = {(a,1,A), … ,(c,4,E)} and it has 60 elements”
Write programs with these input and output Given positive integers m and n, find the number of ontofunctions from a set with m elements to a set with n elements.
Write a program in C++ which allows the user to input 3 sets (A,B,C) and to display the cartesian product AxBxC of the 3 sets, and then calculate the number of elements in AxBxC. Keep in mind, if the the input looks like A={a,b,c}, B={1,2,3,4}, C={A,B,C,D,E}, the output should look like “AxBxC = {(a,1,A), … ,(c,4,E)} and it has 60 elements”
Write a program that execute first part if user press 1 and execute second part if user press 2. • Recall the 1D array and functions concepts that we learned then write a program using those concepts. Declare a 1D array of n elements. Then input values in array in such a way that user only allowed to input into the last element. But if you always input value into the last element then the remaining array always remains empty. Therefore, we introduced a shifting method that shift each element to its neighboring element before entering the new element. Write a function Shift_Array () which takes the array as an argument and perform the element shifting process and then in main function input item at the end of the array. The functionally is explained below:8Array after 1st value012345Index812Array after 2nd value012345Index8122Array after 3rd value012345Index812213Array after 4th value012345Index8122137Array after 5th value012345Index812213719Array after 6th value012345Index
Write a program that gets a list of integers from input, and outputs the integers in ascending order (lowest to highest). The first integer indicates how many numbers are in the list. Assume that the list will always contain less than 20 integers. Ex: If the input is: 5 10 4 39 12 2 the output is: 2 4 10 12 39 For coding simplicity, follow every output value by a space, including the last one. Your program must define and call the following function. When the SortVector function is complete, the vector passed in as the parameter should be sorted.void SortVector(vector<int>& myVec) #include <iostream>#include <vector>using namespace std; /* Define your function here */ int main() {/* Type your code here */ return 0;} Please help me with this problem using c++.
Write a program that gets a list of integers from input, and outputs the integers in ascending order (lowest to highest). The first integer indicates how many numbers are in the list. Assume that the list will always contain less than 20 integers. Ex: If the input is: 5 10 4 39 12 2 the output is: 2 4 10 12 39 For coding simplicity, follow every output value by a space, including the last one. Your program must define and call the following function. When the SortVector function is complete, the vector passed in as the parameter should be sorted.void SortVector(vector<int>& myVec) Hint: There are many ways to sort a vector. You are welcome to look up and use any existing algorithm. Some believe the simplest to code is bubble sort: https://en.wikipedia.org/wiki/Bubble_sort. But you are welcome to try others: https://en.wikipedia.org/wiki/Sorting_algorithm. #include <iostream>#include <vector>using namespace std; /* Define your function here */ int main() { /*…
Use C++ Write a program that reads a list of integers, and outputs whether the list contains all even numbers, odd numbers, or neither. The input begins with an integer indicating the number of integers that follow. Ex: If the input is: 5 2 4 6 8 10 the output is: all even Ex: If the input is: 5 1 -3 5 -7 9 the output is: all odd Ex: If the input is: 5 1 2 3 4 5 the output is: not even or odd Your program must define and call the following two functions. IsVectorEven returns true if all integers in the array are even and false otherwise. IsVectorOdd returns true if all integers in the array are odd and false otherwise.bool IsVectorEven(vector<int> myVec)bool IsVectorOdd(vector<int> myVec)
Write a program that reads a list of integers and outputs those integers in reverse. The input begins with an integer indicating the number of integers that follow. For coding simplicity, follow each output integer by a comma, including the last one. Assume that the list will always contain fewer than 20 integers. Ex: If the input is: 5 2 4 6 8 10 the output is: 10,8,6,4,2, To achieve the above, first read the integers into an array. Then output the array in reverse.
Write a Program for insertion and deletion from an array without replacement of element from the arrays. Also, write a program to search the array for the presence of a given element from an array. Write the sub-functions in the provided test case in text form and upload the same. #include<stdio.h> #include<stdlib.h> int cmpfunc (const void * a, const void * b) { return ( *(int*)a - *(int*)b ); } int insert_function(int *data, int n, int p, int x) { /* input data: array, n: size of array, p: position of insertion, x: element to insert*/ /*output:-1 indication error or 0 if successful /* write the function for inserting element into a position*/ } int delete_function(int *data, int n, int p, int x) { /* input data: array, n: size of array, p: position of deletion, x: element to deletion*/ /*output:-1 indication error or 0 if successful /* write the function for delete element into a position*/ } int linear_search_function(int *data, int n, int x) { /*write the function to…
Implement the sieve of Eratosthenes: a function for computing prime numbers, known to the ancient Greeks. Choose an integer n. This function will compute all prime numbers up to, and including, n. First insert all numbers from 1 to n into a set. Then erase all multiples of 2 (except 2); that is, 4, 6, 8, 10, 12, ... . Erase all multiples of 3, that is, 6, 9, 12, 15, ... . Go up to ?⎯⎯√n. The remaining numbers are all primes. Make sure that you use functions in your solution, including a main function. Define def sieveOfEratosthenes(n) that receives the maximum value and returns a list of all prime numbers less than or equal to this value in main() print the list of prime numbers.
please code in python Given a list of numbers, return true if it follows the “231” pattern, namely that the list has a value x, followed by x+ 1, followed by x−1. You don’t have to print out what the numbers were, but we listed them in the example outputs for extra clarity. # [1,2,3,4,5] -> False (doesn’t contain the pattern) # [74,3,4,2,74,75,2] -> True (3,4,2 satisfies the pattern) # [74,75,0,1,-1,100] -> True (0,1,-1 satisfies the pattern) def has231(arr) :
Write a program named Search.java that uses a function called search_string to check whether a string exists in the array or not. 1- The array of strings is iterated using a for loop and the value at every index is compared with the value to be searched in the array. 2- A boolean variable is set if any array value matches with the string. 3- At the end of the loop, this boolean variable is checked to determine if the array contains the string. Hint: You may need to import java.util.Arrays then use Arrays.toString, String equals(). The ouput should look like what is pictured below. Please provide an editable code that is easy to copy and paste.