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

In the following tuples students names and the corresponding grades are given in order. • Tom is in 1st grade, Ashley is in 5th grade,….. Create a list of tuples of (name,grade) of students • use a for loop Output should be • [(‘Tom’, 1), (Ashley’, 5), (‘Paul’, 3), (‘Jack’, 2) (‘Liz’, 4)
7) Use a counting sort on a set of keys that fall between (a, b), where a and b are modest positive numbers that the user inputs. 8) For an acceptable selection of the number of buckets, implement bucket sort with an array of lists data structure to sort a list of characters, a list of floating point values, and a list of uniformly distributed integers.
Implement the following function: Code should be written in python.
Required in C programming sir! Raghav is working as an Assistant professor in Lovely Professional University. He is also a section mentor of one of the sections under School of Mechanical Engineering. As the admissions are going on, on the daily basis the students are getting added to his section. Then in the end he maintained one list of random roll numbers who have already joined his section. After few days, a new student has joined his class so Raghav wants to assign him any random location Help him to solve his problem by writing a program using arrays. 10<=n<=18, where n is the maximum number of students
dont write code. just write algorithm or related theory of the following question. Narrative 2: We need to have a generic module which reads in file and gives the output in the format which would facilitate other programs to do comparison like the one we saw above to carry out analysis and comparison. Response Required: Write a program that reads a given text, outputs the text as is, and also prints the number of lines and the number of times each letter appears in the text. An uppercase letter and a lowercase letter are treated as being the same; that is, they are tallied together. Since there are 26 letters, we use an array of 26 components to perform the letter count. We also need a variable to store the line count. The text is stored in a file, which we will call textin.txt. The output will be stored in a file, which we will call textout.txt Input: A file containing the text to be processed. Output: A file containing the text, number of lines, and the number of times a letter…
In c++, please! Thank you! Write a void function SelectionSortDescendTrace() that takes an integer array and sorts the array into descending order. The function should use nested loops and output the array after each iteration of the outer loop, thus outputting the array N-1 times (where N is the size). Complete main() to read in a list of up to 10 positive integers (ending in -1) and then call the SelectionSortDescendTrace() function. If the input is: 20 10 30 40 -1 then the output is: 40 10 30 20 40 30 10 20 40 30 20 10 The following code is given: #include <iostream> using namespace std; // TODO: Write a void function SelectionSortDescendTrace() that takes// an integer array and the number of elements in the array as arguments,// and sorts the array into descending order.void SelectionSortDescendTrace(int numbers [], int numElements) { } int main() { int input, i = 0; int numElements = 0; int numbers [10]; // TODO: Read in a list of up to 10 positive…
1. Given a sequence like [1, 2, 3, 4, 5], and an array of sub sequences like [[1,2], [3, 4], [5]], return true or false if the given sequence could be constructed from given sub sequences. The selected sub sequences would concatenate to construct exactly the given sequence. Please write python function to answer the question
Before you start programming on the computer, work out on paper, using linear bitmap implementation of sets, the C code to do the following: a) Create set A = {3, 4, 5, 7} b) Create set B = (1, 3, 5} c) Find the union of sets A and B d) Find the intersection of sets A and B e) Insert 6 into set A f) Check whether 3 is an element of set B Implement the above in a C program, printing out the sets in each state. The printSet function is shown below for your reference. typedef unsigned int Set; #define SETSIZE 8 void printSet (Set s) int j; printf ("( "); for (j-0; j
Write a C program for the output below.
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.
NOTE: Write this program in C++ and include only iostream library. Write a program to insert a new value V in the array (sorted list). Now it should maintain two sizes (Max_Size and Size variables: Where Max_Size is the maximum array size, and Size is the current data size).Input: 12 1 2 4 6 7 8 90 100 110 120 130 160125 // Value which should be addedOutput:After inserting 125 the new array is: 12 1 2 4 6 7 8 90 100 110 120 125 130 160
Below are some statements about Quicksort and Heapsort. Which of the statements is correct when sorting a large number of elements? A. Heapsort and Quicksort have the same time complexity in the mean case.B. When implementing Quicksort, an extra array is usually used in addition to the one on which the sorting is performed.C. If the first element is selected as the pivot element at Quicksort, Quicksort will be faster than Heapsort when the sequence to be sorted is already almost sorted.D. Heapsort performs the sorting on linear time at its best. Group of answer options All statements except B are correct Only statements A and C are correct Only statement A is correct All statements except D are correct All statements are correct