Integer numinputs is read from input. Given the integer vector hourlyScores with the size of numinputs, write a for loop to output the integers in the second half of hourlyScores in reverse order. Separate the integers with a vertical bar surrounded by spaces ("I "). Ex: If the input is 8 86 88 97 116 132 146 148 163 then the output is: 163 | 148 | 146 | 132 Note: The vector size is always even. int i; int numInputs; 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 } cin >> numInputs; // Creates a vector of size numInputs and initialize all values to 0 hourlyScores. size(numInputs); for (i = 0; i < hourlyScores.size(); ++i) { cin >> hourlyScores.at(i); } Y* Your code goes here */ cout << endl; return 0;

Integer numFeatured Items is read from input. Then, numFeatured Items strings are read and stored in vector febFeatured Items, and numFeatured Items strings are read and stored in vector oct Featured Items. Perform the following tasks: • If febFeatured Items is equal to oct Featured Items, output "February's featured items are the same as October's featured items. Otherwise, output "February's featured items are not the same as October's featured items." Assign octBackup as a copy of octFeatured Items. Ex: If the input is 3 dresser chair bench recliner sideboard armoire, then the output is: February's featured items: dresser chair bench October's featured items: recliner sideboard armoire February's featured items are not the same as October's featured items. October's backup: recliner sideboard armoire 18 19 20 21 22 23 24 25 26 27 28 29 30 Ni vsiy u IVULUI for (i = 0; i> febFeatured Items.at(i); cout> oct Featured Items.at(i); cout << oct Featured Items.at (i) << " "; } cout <<...

c++

Integers are read from input and stored into a vector until 0 is read. If the vector's last element is odd, output the odd elements in the vector. Otherwise, output the even elements in the vector. End each number with a newline. Ex: If the input is -9 12 -6 1 0, the vector's last element is 1. Thus, the output is: -9 1 Note: (x % 2 != 0) returns true if x is odd. int value; int i; bool isodd; 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 } cin>> value; while (value != 0) { } for (i = 0; i> value; Check return 0; 1 Next level 2 X 1: Compare output 3 4 For input -9 12 -6 1 0, the vector elements are -9, 12, -6, and 1. The last element, 1, is odd. The odd elements in the vector, -9 and 1, are output, each on a new line. Not all tests passed. 2 V 3

Write the following function #input: a numerical vector x #output:the normalized vector, i.e. the vector rescaled into [0,1] # the formula to normalize is (x-min(x))/ (max(x)-min(x)) # you can NOT use the functions min and max # you can use %%, nrow, ncol, and length # you can write multiple functions

Integers are read from input and stored into a vector until 0 is read. If the vector's last element is odd, output the odd elements in the vector. Otherwise, output the even elements in the vector. End each number with a newline. Ex: If the input is -9 12 -6 1 0, the vector's last element is 1. Thus, the output is: -9 1 Note: (x % 2!= 0) returns true if x is odd. 4 5 int main() { 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20} vector vect1; int value; int i; bool isodd; cin>> value; while (value != 0) { vect1.push_back(value); cin>> value; } V* Your code goes here */ return 0; 2 3

The Lo Shu Magic Square is a grid with 3 rows and 3 columns shown below. The Lo Shu Magic Square has the following properties: The grid contains the numbers 1 – 9 exactly The sum of each row, each column and each diagonal all add up to the same number. This is shown below: Write a program that simulates a magic square using 3 one dimensional parallel arrays of integer type. Do not use two-dimensional array. Each one the arrays corresponds to a row of the magic square. The program asks the user to enter the values of the magic square row by row and informs the user if the grid is a magic square or not. Processing Requirements - c++ Use the following template to start your project: #include<iostream> using namespace std; // Global constants const int ROWS = 3; // The number of rows in the array const int COLS = 3; // The number of columns in the array const int MIN = 1; // The value of the smallest number const int MAX = 9; // The value of the largest number //...

a. Create an array to hold 10 double values.b. Take 10 value inputs from the user.c. Display the sum of the first 5 elements.d. Write a loop that computes the sum of all elements in the array.e. Write a loop that finds the minimum and minimum elements also the index of maximumand minimum element’s index in the array.f. Apply binary search to find a value x (taken by the user) and print the index value if it ispresent in the array or not.