Discrete math questions attached 1. Consider the algorithm described in the pseudocode below.algorithm mystery(A,n,z)input: A, an array of n integers, and z is a given integeroutput:??for i <- 0 to n-1 dox <-2 - a[i]for j<-i+1 to n-1 doif x = a[j] thenprint a[i]print a[j]Stopend ifnextnextPrint "Failure"Stopend.Draw the flowchart for this algorithmb. Simulate how mystery([2, 4, 1, 6, 7, 3], 6, 7) is executed. [use the table of variables]а. 2.a. Given two subsets A and B of the Universal set U. State the Sum Rule for two sets Aand B.b. Use the Sum Rule for two sets to show that|A UB UC| = |A| + |B| + |C] – |A U B| – |A U C| – |B U C| + |A n BnC|(Hint: start with A U BUC = A U (B U C)]c. Let U be the set of 35 students participating in the sports of Football, Basketball orvolleyball. 6 of these students participate in all the sports and 7 of them do notparticipate in any sport. Those who play Football are 16 in total while it is knownthat 8 play both Basketball and Volleyball. Calculate how many studentsi. Play exactly Basketball and Volleyball and not Footballii. Play either Basketball only or Volleyball only.

1. Consider the algorithm described in the pseudocode below. algorithm mystery(A,n,z) input: A, an array of n integers, and z is a given integer output:?? for i <- 0 to n-1 do x <- 2 – a[i] for j<-i+1 to n-1 do if x = a[j] then print a[i] print a[j] Stop end if пеxt пеxt Print "Failure" Stop end. a. Draw the flowchart for this algorithm b. Simulate how mystery([2, 4, 1, 6, 7, 3], 6, 7) is executed. [use the table of variables)

1. Consider the algorithm described in the pseudocode below. algorithm mystery(A,n,z) input: A, an array of n integers, and z is a given integer output:?? for i <- 0 to n-1 do x <- 2 – a[i] for j<-i+1 to n-1 do if x = a[j] then print a[i] print a[j] Stop end if пеxt пеxt Print "Failure" Stop end. a. Draw the flowchart for this algorithm b. Simulate how mystery([2, 4, 1, 6, 7, 3], 6, 7) is executed. [use the table of variables)

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 23PE

See similar textbooks

Similar questions

Suppose you are given a vector x. Write first a pseudo-code or algorithm that would print out the sum of all the entries in x. You will probably want to use a some kind of for loop construction to achieve this. 1: for i = start : finish do 2: statements 3: end for Now use the start:increment:finish notation, and modify your procedure slightly, to print out the sum of the odd elements in the array (that is, the elements in entries 1, 3, 5, and so on). Implement and test your algorithm with an arbitrary array of real numbers using Python.
Consider two arrays of Different sizes are given and your task is to multiply corresponding elements and store it into the result array and print the result array. In java programming language
Python Numpy function to complete: def t19(N, s, X, y): Inputs: N: An integer s: A floating-point number - x: A floating-point number - y: A floating-point number Returns: A numpy array I of shape (N, N) such that I[i, j] exp(-||(j, i) –- (x, y)||^2 / s^2) Par: 3 lines Instructor: 2 lines return None
can you please convert this python code into java? Python code is as shown below: # recursive function def row_puzzle_rec(row, pos, visited): # if the element at the current position is o we have reached our goal if row[pos] == o: possible = True else: # make a copy of the visited array visited = visited[:} # if the element at the current position has been already visited then it's a loop. # as then its not possible to reach the last element, set possible to False if visited[pos]: possible = False else: # set visitied for the element as True visited[pos] = True possible = False # if its possible to move left then recurse in the left direction if pos - rowlpos} > o and row_puzzle_rec(row, pos - row[pos], visited): # return immediately if the goal is reached return True # if its possible to move right then recurse in the right direction if pos + rowlpos} < len(row) and row_puzzle_rec(row, pos + row[pos], visited): # return immediately if the goal is reached. return True return possible…
Python Big-O Notation Pls answer only if u know Big-O Clue is given below: Will give thumbs up if correct ty!
For the second picture Can you fix the loop for the algorithm in python
In c++ language
Convert please asap.
Should prefer the stat.
Select the appropriate code that performs selection sort. a) int min; for(int j=0; j<arr.length-1; j++) { min = j; for(int k=j+1; k<=arr.length-1; k++) { if(arr[k] < arr[min]) min = k; } int temp = arr[min]; arr[min] = arr[j]; arr[j] = temp; } b) int min; for(int j=0; j<arr.length-1; j++) { min = j; for(int k=j+1; k<=arr.length; k++) { if(arr[k] < arr[min]) min = k; } int temp = arr[min]; arr[min] = arr[j]; arr[j] = temp; } c) int min; for(int j=0; j<arr.length-1; j++) { min = j; for(int k=j+1; k<=arr.length-1; k++) { if(arr[k] > arr[min]) min = k; } int temp = arr[min]; arr[min] = arr[j]; arr[j] = temp; } d) int min; for(int j=0; j<arr.length-1; j++) { min = j; for(int k=j+1; k<=arr.length; k++) { if(arr[k] > arr[min]) min = k; } int temp = arr[min]; arr[min] = arr[j]; arr[j] = temp; }
Implementation for this. Sample code to read inputs already give.
using namespace std; int main() int i, m=0,n=4; float arr[100] (55,66,88,1); for(i=0; i