Q20. Suppose a computer program has been initialized such that the following sets have been stored for use in any algorithm: A = {1, 2, 3, 40} B = {-7, -6, -5, ..., 30} Consider the following algorithm, which represents one part of the whole computer program (comments may occur after the # symbol on any line and are not used in computations): #Part 1: computes A - B and its cardinality AminusB = set() for element in A: # this line runs through every element in A if not(element in B): #A - B is the set of elements that are in A and are not in B AminusB.add(element) # Add to AminusB every element in A if the element is also not in B n = len(AminusB) #len() returns the number of elements in the array print(n) What value is printed as a result of executing this algorithm?

Q20. Suppose a computer program has been initialized such that the following sets have been stored for use in any algorithm: A = {1, 2, 3, 40} B = {-7, -6, -5, ..., 30} Consider the following algorithm, which represents one part of the whole computer program (comments may occur after the # symbol on any line and are not used in computations): #Part 1: computes A - B and its cardinality AminusB = set() for element in A: # this line runs through every element in A if not(element in B): #A - B is the set of elements that are in A and are not in B AminusB.add(element) # Add to AminusB every element in A if the element is also not in B n = len(AminusB) #len() returns the number of elements in the array print(n) What value is printed as a result of executing this algorithm?

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Q: Given a list of integers, compute recursively (no loops and no list functions) the number of…

A: In this question, we are asked to write a recursive function such that it counts the frequency of…

Q: program Here we're looking for the string target, in the list list_of_words. def…

A: Binary search works on the principle of divide and conquer. It looks for search item by comparing…

Q: Realize direct insertion sort, half insertion sort, bubble sort, quick sort, select sort, heap sort…

A: Bubble sort: Bubble sort repeatedly compares and swaps(if needed) adjacent elements in every pass.…

Q: In this task, we will develop a program to detect whether a target number is the sum of k elements…

A: Here is the python code. See below step for code.

Q: If array A consists only of values of 0, 1, and 2, design a function that sorts A. However, sorting…

A: import java.util.*;public class Main{ public static void main(String[] args) { int[] A = {0, 1, 1,…

Q: 24. Instead of reading in an entire list N,, N,, ... all at once, some algorithms (depending on the…

A: - We have to give pseudocode for the list value average problem.

Q: Python Programming- Computer-Assisted Instruction Part 1: Computer-Assisted Instruction (CAI)…

A: Hey, since there are multiple part questions posted, we will answer the first part question. If you…

Q: Assume a sequence of 18 integers 11, 29, 21, 4, 43, 24, 52, 8, 17, 50, 45, 30, 15, 34, 54, 2, 35,…

A: The data given:- 11, 29, 21, 4, 43, 24, 52, 8, 17, 50, 45, 30, 15, 34, 54, 2, 35, 61 The technique…

Q: In the class, we went over the very basic concept of "Optimal Binary Search Tree" using dynamic…

A: We use an auxiliary array cost[n][n] to store the solutions of subproblems. cost[0][n-1] will hold…

Q: Define a function called bits_sort(). This function should have a single input, which is expected to…

A: def sortByBits(arr): arr.sort(key = lambda x: (bin(x).count('1'), x)) return…

Q: Write a program that reads a list of words. Then, the program outputs those words and their…

A: Given: Write a C program that reads a list of words. Then, the program outputs those words and their…

Q: receipt.py Your goal for this program is to provide a sales receipt for a purchase transaction at a…

A: We need to write a Python code for the given scenario.

Q: 10. Consider the following program, implementing binary search to look for a word in a list of…

A: Binary search algorithm: Repeatedly divide the search interval in half. Begin with the whole…

Q: Select which of the following statements about searching for items in a list is incorrect.

A: Answer 1. In an unsorted list, if the item is not present in the list, we will need to check every…

Q: Problem 1: Suppose you have n two-digit numbers. For example, if n = 5, you may have the following 5…

A: The process of writing an algorithm involves several key steps. Here's a general outline of the…

Q: Sorting ascends if a list is empty or all items except the last are less than or equal to their…

A: Define a function isSorted that takes a list lyst as input. If the length of lyst is less than or…

Q: Sort Realize direct insertion sort, half insertion sort, bubble sort, quick sort, select sort, heap…

A: Actually, given information is: Raw data is generated randomly. For different problem size, output…

Q: Solve the following codes below and discuss how array, stack, and queues are used in each problem.…

A: Solved three programming problems using arrays, stacks, and queues. Below are the python codes for…

Q: Implement the following two sorting algorithms in a program called p3.py. Write two separate…

Q: (e) Consider the following high-level program, assuming there is an array named x that contains n…

A: (e) Let's step through the program execution with the given values: Initialize n = 6 and x = [4, 0,…

Q: Write down the quick sort algorithm in python. Consider one random example and execute the code.…

A: In quicksort, we use the divide and conquer technique. We partitioned the array using a pivot…

Question

Q20. Suppose a computer program has been initialized such that the following sets
have been stored for use in any algorithm:
A = {1, 2, 3, ..., 40}
B = {-7, -6, -5, ..., 30}
Consider the following algorithm, which represents one part of the whole computer
program (comments may occur after the # symbol on any line and are not used in
computations):
#Part 1: computes A - B and its cardinality
AminusB = set()
for element in A: # this line runs through every element in A
if not(element in B): #A - B is the set of elements that are in A and are not in B
AminusB.add(element) # Add to AminusB every element in A if the element is
also not in B
n = len(AminusB) #len() returns the number of elements in the array
print(n)
What value is printed as a result of executing this algorithm?

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Explaination

VIEW

program in Python implimentation of program

VIEW

Output

VIEW

Answer

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Similar questions

make mathlab code
Sort Realize direct insertion sort, half insertion sort, bubble sort, quick sort, select sort, heap sort and merge sort. Raw data is generated randomly. For different problem size, output the number of comparisons and moves required by various sorting algorithms When the program is running, input the problemsize from the keyboard, the source data is randomly generated by the system, and then output the comparison times and movement times required by various sorting algorithms under this problem scale.. Do this in C language..the attached picture is just to show you how the program should be
Please help me with this Principles of programming language homework question
c++
Write a Java program that generates randomly a list of N integers, sorts the generated list using each of the three sorting algorithms: mergesort sort, quicksort that use the first element as a pivot, and quicksort that use the middle element as pivot and prints as output the execution time for each of the algorithms for randomly generate lists of size N = 40000, 100000 and 200000 and sorted lists as shown in the table.
There are various sorting algorithms available to sort data of different sizes. Three of these algorithms are Bubble sort, Shell sort, and Quicksort. In Python, write a program to generate random integer numbers of multiple sizes; 10000, 30000, 40000, 50000, and 70000, and find out which of these sorting algorithms perform the fastest sorting technique. Provide data to prove and support your findings or results by plotting a graph showing the time each takes to sort data of various sizes. It should be written in a single program. Write the code in python and also show the graphical result. Also do the proper identation of the code.
c++
ORIGINAL Q: Instead of reading in an entire list N1,N2,⋯N1,N2,⋯ all at once, some algorithms (depending on the task to be done) can read in only one element at a time and process that single element completely before inputting the next one. This can be a useful technique when the list is very big (e.g., billions of elements) and there might not be enough memory in the computer to store it in its entirety. Write an algorithm that reads in a sequence of values v≥0, one at a time, and computes the average of all the numbers. You should stop the computation when you input a value of V = −1. Do not include this negative value in your computations; it is not a piece of data but only a marker to identify the end of the list. PLEASE MODIFY THE FOLLOWING CODE SO THE USER INPUTS THE NUMBERS ONE BY ONE: ORIGINAL Q: Instead of reading in an entire list N1,N2,⋯N1 ,N2,⋯ all at once, some algorithms (depending on the task to be done) can read in only one element at a time and process that single…
20. Suppose a computer program has been initialized such that the following sets have been stored for use in any algorithm: A = {1, 2, 3, ..., 45}B = {-7, -6, -5, ..., 27} Consider the following algorithm, which represents one part of the whole computer program (comments may occur after the # symbol on any line and are not used in computations): #Part 1: computes A - B and its cardinality AminusB = set()for element in A: # this line runs through every element in A if not(element in B): #A - B is the set of elements that are in A and are not in B AminusB.add(element) # Add to AminusB every element in A if the element is also not in B n = len(AminusB) #len() returns the number of elements in the arrayprint(n) What value is printed as a result of executing this algorithm?
I need to write an algorithm pseudocode that sorts a list of n elements in non-increasing order by finding the largest and smallest elements and exchanging those elements with the elements in the first and last positions. Then the size of the list is reduced by 2, excluding the two elements that are already in the proper positions, and the process is repeated on the remaining part of the list until the entire list is sorted. I also need to analyze the algorithm and show the results using order notation. I was trying to use arguments but I got stuck.
1. Explain what a selection statement is in a sentence or two along with an example. 2. Explain what a loops are in a sentence or two along with an example. 3. Explain what arrays are in a sentence or two along with an example. 4. Give an example that uses selection statements, loops, and arrays together to accomplish an important task. 5. Is it possible to replace a selection statement with a loop? Is it possible to replace a loop with a selection statement? Clearly and concisely argue your position. No hand written and fast answer with explanation
Write a version of the sequential search algorithm that can be used to search a sorted list. Write a program to test the sequential search algorithm. Use either the function bubbleSort or insertionSort to sort the list before the search. Your program should prompt the user to enter 10 digits and then prompt the user to enter a digit to search - if the list contains this digit, output its position to the console: x is found at position y If the digit is not contained in the list, output the following: x is not in the list