Compute and print the sumand average of a collectionof floating-point data itemsnumItems,numItems,numItemssumaveragesum,sumnumItemsaverageRead thenumber ofdata itemsComputethe sumComputethe averagePrint the sumand theaveragecomputeSumcomputeAveprintSumAveYou have been asked to accumulate a sum and to average a list of data values using functions.Because these tasks surface in many problems, design a general set of functions you can reuse inother programs.• The problem is described and analyzed in the lecture slides. You will prompt a user to enter somenumbers that you will accumulate, find their sum and average. You will rely on the functions in theaccompanying figure to accomplish this. You will display the sum and average of these numbersbefore you exit the program.Upload a file with the source code of your program after you have tested it. Show me a workingprogram during the lab or during my office hours.

- We need to highlight the code for the provided scenario of finding the sum and average of the…

Answered: Compute and print the sum and average…

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter16: Searching, Sorting And Vector Type

Section: Chapter Questions

Problem 16SA

See similar textbooks

Similar questions

PYTHON DATASET given x = np.array([i*np.pi/180 for i in range(60,300,4)]) np.random.seed(10) #Setting seed for reproducibility y = 4*x + 7 + np.random.normal(0,3,len(x)) Write a function inspired by sklearn’s polynomial preprocessing: (https://scikit-learn.org/stable/modules/generated/sklearn.preprocessing.PolynomialFeatures.html) your function should have: degree and include bias parameters only. For this assignment, assume that input is a 1-dimensional numpy array. For example, if an input sample is np.array([a, b]), the degree-2 polynomial features with "include_bias=True" are [1, a, b, a2, b2].
Consider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called TAMUK. The number of each of these letters is unknown. We have a function, called SWAP(TAM,i,j), which places the ith letter in the jth entry of string TAM and the jth letter in the ith entry of TAM. Note that SWAP(TAM,i,j) is defined for all integers i and j between 0 and length(TAM)–1, where length(TAM) is the number of letters of TAM. 1. Using our algorithmic language, write an algorithm, called Sort_TAM, which sorts the letters in the array TAMUK in a way that all T’s appear first, followed by all A’s, and followed by all M’s. The algorithm Sort_TAM should have one parameter: The array TAMUK. Also, your solution is correct only if the following four constraints are satisfied: - Constraint 1: Each letter (‘A’, ‘M’, or ‘T’) is evaluated only once. - Constraint 2: The function SWAP(TAM,i,j) is used only when it is…
consider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called TAMUK. The number of each of these letters is unknown. We have a function, called SWAP(TAM,i,j), which places the ith letter in the jth entry of string TAM and the jth letter in the ith entry of TAM. Note that SWAP(TAM,i,j) is defined for all integers i and j between 0 and length(TAM)–1, where length(TAM) is the number of letters of TAM. 1. Using our algorithmic language, write an algorithm, called Sort_TAM, which sorts the letters in the array TAMUK in a way that all T’s appear first, followed by all A’s, and followed by all M’s. The algorithm Sort_TAM should have one parameter: The array TAMUK. Also, your solution is correct only if the following four constraints are satisfied: - Constraint 1: Each letter (‘A’, ‘M’, or ‘T’) is evaluated only once. - Constraint 2: The function SWAP(TAM,i,j) is used only when it is…
consider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called TAMUK. The number of each of these letters is unknown. We have a function, called SWAP(TAM,i,j), which places the ith letter in the jth entry of string TAM and the jth letter in the ith entry of TAM. Note that SWAP(TAM,i,j) is defined for all integers i and j between 0 and length(TAM)–1, where length(TAM) is the number of letters of TAM. 1. Using our algorithmic language, write an algorithm, called Sort_TAM, which sorts the letters in the array TAMUK in a way that all T’s appear first, followed by all A’s, and followed by all M’s. The algorithm Sort_TAM should have one parameter: The array TAMUK. Also, your solution is correct only if the following four constraints are satisfied: - Constraint 1: Each letter (‘A’, ‘M’, or ‘T’) is evaluated only once. - Constraint 2: The function SWAP(TAM,i,j) is used only when it is…
Consider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called TAMUK. The number of each of these letters is unknown. We have a function, called SWAP(TAM,i,j), which places the ith letter in the jth entry of string TAM and the jth letter in the ith entry of TAM. Note that SWAP(TAM,i,j) is defined for all integers i and j between 0 and length(TAM)–1, where length(TAM) is the number of letters of TAM. 1. Using our algorithmic language, write an algorithm, called Sort_TAM, which sorts the letters in the array TAMUK in a way that all T’s appear first, followed by all A’s, and followed by all M’s. The algorithm Sort_TAM should have one parameter: The array TAMUK. Also, your solution is correct only if the following four constraints are satisfied: - Constraint 1: Each letter (‘A’, ‘M’, or ‘T’) is evaluated only once. - Constraint 2: The function SWAP(TAM,i,j) is used only when it is…
Implement the following function, without using any data structure or #include <bits/stdc++.h> /* Given two vectors of chars, check if the two vectors are permutations of each other, i.e., they contains same values, in same or different order.e.g., V1=[‘a’,’b’,’a’] and V2=[‘b’,’a’,’a’] stores same multi-set of data points: i.e., both contains two ‘a’, and one ‘b’. e.g., V3=[‘a’,’c’,’t’,’a’] and V4=[‘a’,’c’,’t’] are not same multi-set. V3 contains two ‘a’s, while V4 has only one ‘a’. Note: when considering multiset, the number of occurrences matters. @param list1, list2: two vectors of chars @pre: list1, list2 have been initialized @post: return true if list1 and list2 stores same values (in same or different order); return false, if not. */  bool SameMultiSet (vector<char> list1, vector<char> list2) THIS IS NOT THE CORRECT SOLUTION / include headers #include <bits/stdc++.h> // deinfe the namespace using namespace std; // function fo rchecking same bool…
y(n) - 4y(n - 2) = 2x(n - 2) - 3x(n − 3) difference, with q(n) being the state variable vectorIf the equations of state of the system expressed by Eq.q(n + 1) = Aq(n) + Bx(n)y (n) = Cq (n) + Dx (n)1.II.103IV. 2Which one is an element of vector C?AOnly 11Bi velwithNoneDYalne IVANDHe ve IV
PLEASE ANSWER QUICKLYFor each of the following functions, use big-O notation to give a tight bound on the runtime interms of n, the number of elements in num_Ist. You can assume that the length of a list can becomputed in constant time (that is, the len() operation is O(1) - the amount of time requiredto compute the length is the same no matter how big the list is).
Your task is to implement Depth-first search algorithm to solve the problem of placing 8 Queens on a chess board so none can “take” each other.• A code framework, supporting videos and html documentation of the provided code-base will be provided via Moodle in assignments section.• The implementation should accept one command-line argument at the time it is invoked for the starting position of the first queen.o It will be tested with a range of values for that input.o If the input is not an integer in the range of 0-7 it should report “Invalid Input” and exit. • You will be supplied with a partially completed file ‘main.c’ which contains the code need to read the command line and sets up the initial working candidate within the code framework.o Your task is to complete the code to implement depth-first search. o Your code must finish with a call to the function PrintFinalSolutionAndExit(); when a valid final solution stored in the variable “workingCandidate”. please solve full…
The code of a sequential search function is shown on textbook page 60. In fact, if the list is already sorted, the search can halt when the target is less than a given element in the list. For example, given my_list = [2, 5, 7, 9, 14, 27], if the search target is 6, the search can halt when it reaches 7 because it is impossible for 6 to exist after 7. Define a function linearSearchSorted, which is used to search a sorted list. This function displays the position of the target item if found, or ‘Target not found’ otherwise. It also displays the elements it has visited. To test your function, search for these targets in the list [2, 5, 7, 9, 14, 27]: 2, 6, 14, 27 and 28.
The 15-puzzle problemThe 15-puzzle is a larger version of the 8-puzzle.Goal:15 14 13 1211 10 9 87 6 5 43 2 1Initial11 5 2 114 8 1015 4 13 69 12 3 7For this assignment, you will implement the two uninformed search algorithms thatfind solutions to the 15-puzzle problem. You are requested to implement the programsto the 15-puzzle problem using:1. Depth-first search (DFS)2. Breadth-first search (BFS)For each of the search routines, avoid returning to states that have already been visitedon the current solution path i.e., there should be no repeated states in a solution.CS580 only: Your programs should also be able to accept arbitrary initial states andfind solutions for these states. Please give proper explanation and typed answer only.
1a) write python code for creating a 10 x 20 table (2D list of lists) named t, initialized to all zeros. b) Define a python function that is passed a table (2D list of lists) of integers with the same number of rows and columns and return the transpose of the table. (Recall that the transpose of a table has the rows and columns exchanged.) c) Determaine the Big-O complexity of your function in part b). Explain / show your work

SEE MORE QUESTIONS

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning