Write an Octave function (i.e. write the code you would put in an Octave .m file) that takes a vector of numbers as input. It separates the input vector elements into three sets: even number, odd numbers and prime numbers. It returns the three output arrays as [prime even odd]. The program should perform the following functionality: (i) Read in an array argument from the command window when the function is called. (ii) Sort the array into prime, even and odd sets. (iii) Return the prime, even and odd sets. (iv) The function must test that there are sufficient input arguments. (v) The function must print an error message if there are less than required input arguments. (vi) The program must print the following: The prime set is: The even set is: The odd set is

Write an Octave function (i.e. write the code you would put in an Octave .m file) that takes a vector of numbers as input. It separates the input vector elements into three sets: even number, odd numbers and prime numbers. It returns the three output arrays as [prime even odd]. The program should perform the following functionality: (i) Read in an array argument from the command window when the function is called. (ii) Sort the array into prime, even and odd sets. (iii) Return the prime, even and odd sets. (iv) The function must test that there are sufficient input arguments. (v) The function must print an error message if there are less than required input arguments. (vi) The program must print the following: The prime set is: The even set is: The odd set is

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 29SA

See similar textbooks

Similar questions

how do i store data from a static array or function after reading a .txt file in? so say if the .txt file had contents of "Hello my name is Sally, i like my name Sally." I need it to store and show it in the terminal like below: WORD COUNT COUNT hello 1 my 1 name 1 is 1 sally 2 i 1 like 1 my 1 name 1 then have it organized in alphabetical order, remove punctuations and change all uppercase to lower case in the .txt file. Not sure how i would go about writing that code in c++
write a program that reads up to 100 numbers from a file. As you read thenumbers, insert them into an array in ascending order.Specifications:1A. Write a function called addToArrayAsc.i. It should take three arguments -a. sortedArray[ ] : sorted array that should be able to hold at most 100 floats.b. numElements : the number of elements inserted so far.c. newValue : the incoming float value to be inserted into the sortedArray.ii. The addToArrayAsc function should return a count of the elements inserted so far(i.e. the current size of the array).The function header will appear as follows: OBJECTIVES 1. Read-in command line arguments2. Read a file3. Loop through an array4. Split a string5. Create an array of struct types6. Read and Write to a file int addToArrayAsc(float sortedArray[], int numElements, float newValue);
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…
Write a function called remove_punct() that accepts an array of characters and the number of items in the array as parameters, removes the punctuation (',', '!', '.') characters from the array, and returns the number of punctuation characters removed. For example, if the array contains ['C', 'p', 't', 'S', ',', '1', '2', '1', '.', 'i', 's', 'f', 'u', 'n', '!'], then the function should remove the punctuation characters. The function must remove the characters by shifting all characters to the right of each punctuation character, left by one spot in the array. This will overwrite the punctuation characters, resulting in: ['C', 'p', 't', 'S', '1', '2', '1', 'i', 's', 'f', 'u', 'n']. In this case, the function returns 3. Note: if the array does not contain any punctuation characters, then the array is unchanged and the function returns 0.
(This if for mindtap on cengage, if not possible, use devc++ 5.11 but mindtap is more accurate) Write a C++ function, smallestIndex, that takes as parameters an int array and its size and returns the index of the first occurrence of the smallest element in the array. To test your function, write a main that prompts a user for a list of 15 integers and outputs the index and value of the first occurrence of the smallest value. An example of the program is shown below: (look at picture) You can use the following integer lists to test your code: 56, 34, 67, 54, 56, 87, 66, 92, 15, 32, 55, 54, 88, 92, 30 79, 26, 97, 87, 73, 44, 67, 46, 55, 13, 20, 20, 33, 42, 60 63, 1, 40, 81, 30, 11, 26, 44, 98, 1, 80, 98, 15, 3, 42
Write a function that receives a two-dimensional array, prints out the data by row along with the sum of the row values. Each value should be printed separated by a space. After the last element in the row has been printed, the sum should be printed on the same line, followed by a newline.
this is insturction Write a program which prompts the user to enter up to 15 floating point numbers (terminated with a non-numeric), reads them into an array, then prints the following. The program must use an array (not a vector) to get credit. The array values in the original order, separated by commas, with no trailing comma at the last value. The array values where the order of each adjacent pair of elements is swapped, separated by commas (NOT every element swapped with its next neighbor, which would just move the first element to the end, but every original pair swapped only in that pair. For an odd element count, the last element should not change. See examples below.) The smallest number in the array. Example program outputs with user input shown in bold font: Enter up to 15 numbers, and a non-numeric to quit: 1 0 -1.001 # Original array: 1, 0, -1.001 The swapped array: 0, 1, -1.001 Smallest number: -1.001 Enter up to 15 numbers, and a non-numeric to quit: 1 0 -1.001 5 ,…
Modify the existing vector's contents, by erasing the element at index 1 (initially 200), then inserting 100 and 102 in the shown locations. Use Vector ADT's erase() and insert() only, and remember that the first argument of those functions is special, involving an iterator and not just an integer. Sample output of below program with input 33 200 10: #include <iostream>#include <vector>using namespace std; void PrintVectors(vector<int> numsList) {unsigned int i; for (i = 0; i < numsList.size(); ++i) {cout << numsList.at(i) << " ";}cout << endl;} int main() {vector<int> numsList;int userInput;int i; for (i = 0; i < 3; ++i) {cin >> userInput;numsList.push_back(userInput);} /* Your solution goes here */ PrintVectors(numsList); return 0;} Please help me with this problem using c++.
Create two dynamic arrays A and B with random numbers.a) Merge B in array A calling a function by reference.b) Delete the Prime numbers from the merged array A calling a function by pointer.c) Print the Array A in ascending order.You have to use only two Arrays A and B throughout the code. Be carefulabout memory leakage.Example:A= [20, 30, 5, 7, 19]B= [19, 10, 15, 11, 17, 25] a) After merging B in A, the merged Array A will look like-A= [20, 30, 5, 7, 19, 19, 10, 15, 11, 17, 25] b) After deleting prime numbers the merged Array would look like-A= [20, 30, 10, 15, 25] c) Finally print the merged array in ascending orderA= [10, 15, 20, 30, 25] In C++ Please
3. Implement a function called findLargestIndex which returns the index of the rowwith the largest sum.ex. int array[3][6] = {{3, 6, 8, 2, 4, 1}, // sum = 24{2, 4, 5, 1, 3, 4}, // sum = 19{1, 0, 9, 0, 1, 0}}; // sum = 11If the findLargestIndex function was called using this array, it would return 0, asit is returning the index of the row, not the sum.Note that the number of columns is required when passing a 2d array to a function.Assume that 2D arrays passed to this function will have 6 columns.Title line: int findLargestIndex(int array[][6], int rows, int columns);
Which shows valid accesses for an array a and vector v, each with 10 elements? In other words, this question is asking what is the proper syntax for accessing the array and vector. a. array: a[7] vector: v.at(5) b. array: a.at(5) vector: v[9] c. array: a.at(5) vector: v[5] d. array: a[1] vector v.at[4] Coding is in C++.
In python: Create a function file called fibonacci that when sent aninteger (n) it returns a vector (fib). The vector “fib” contains the first “n” elements of theFibonnacci sequence.Note that the first two numbers of the Fibonacci sequence are 1 and 1, but then everynumber after is just the sum of the previous two numbers. So 1+1 =2 and then 1+2 =3and 2+3 =5 and 5+3=8 and so forth. So a Fibonacci sequence looks like:1 1 2 3 5 8 13 21 34 55 89....In the command window (see below), call your function file in a single command thatcreates a vector “f” which is the first 30 elements of the Fibonacci sequence