Write a program that prompts the user to enter an integer m and find the smallest integer n such that m * n is a perfect square. (Hint: Store all smallest factors of m into a vector. n is the product of the factors that appear an odd number of times in the vector. For example, consider m = 90, store the factors 2, 3, 3, 5 in a vector. 2 and 5 appear an odd number of times in the vector. So, n is 10.)

Write a function that takes a one-dimensional array and its size [10], and then fill each location in the array by the cubic of the location's index. To cube the location's index write your function int cube(int x). Then print out your array. Consider the following three functions in your program: int cube(int x). • void fillArray(int [], int size). • void printArray(int [], int size). Sample input / output: The generated array is: 0 1 8 27 64 125 216 343 512 729

Write a program to apply a cyclic shift in an array of characters (cstring) given number of spaces to shift. For example, if the input characters are abcadebcaand the number of spaces to shift is 3, the output will be: bcaabcadeIf the number of spaces is negative, the shift will be to the left. Note: You should NOT use any additional arrays (Apply the shift in-place). using Arrays and Vectors/ User-defined Functions

Write a function that takes in an array of integers and returns the integers that are either palindromes or almost-palindromes. An almost-palindrome is any integer that can be rearranged to form a palindrome. For example, the numbers 677 and 338 are both almost-palindromes, since they can be rearranged to form 767 and 383, respectively. Examples palindromeSieve ([443, 12, 639, 121, 3232]) [443, 121, 3232] // Since 443 => 434; 121 is a palindrome; 3232 => 2332 or 3223 palindromeSieve([5, 55, 6655, 8787]) → [5, 55, 6655, 8787] // Single-digit numbers are automatically palindromes. palindromeSieve ([897, 89, 23, 54, 6197, 53342]) - []

Write a similarprogram to compare two vectors. we should make 6 test : same length the first is longer, the second is longer, equal, the first greater , the second greater; try different symbols not only letters

Question : Imagine that you track your commute times for (10 days) and recorded your observations in minutes as {17, 16, 20, 24, 22, 15, 21, 15, 17, 22}. Enter your observations into a series (vector) in Python and label it 'data'. Next answer the following questions: ●くろまる How many times were your commute 20 minutes or more? Hint: Write a condition! What percent of your commutes are less than 17 minutes?

vector, or a matrix in the same way as described for rand function. EXERCISE I8 Generate a random integer between I and 10. Ask user to guess the number. If user's guess is incorrect, ask' to guess again until user gets it right. At this point, tell user that he guessed it correctly and print out the number of attempts it took for the correct guess. Output Samples>> exercisel8 Please guess an integer between 1 and 10: 5 Your guess is incorrect. Please try again: 2 You guessed it correctly in 2 attemptS>>>> exercise16 Please guess an integer between 1 and 10: 2 Your guess is incorrect. Please try again: 3 Your guess is incorrect. Please try again: 6 Your guess is incorrect. Please try again: 5 Your guess is incorrect. Please try again: 8 Your guess is incorrect. Please try again: 9 Your guess is incorrect. Please try again: 10 Your guess is incorrect. Please try again: 1 Your guess is incorrect. Please try again: 4 Your guess is incorrect. Please try again: 7 You guessed it correctly...

Write an c progra, that takes an array of N integers (N will be specified by the user at run time). It then finds how many numbers in the array are divisible by 3 and how many numbers are divisible by 7. the it copies, from the input array above, the numbers that are divisible by 3 into a new array and those divisible by 7 into a different new array. Once copied, the algorithm should compute the average of each of these two new arrays and print the averages on the screen with suitable message to let the user know which average is being printed Note: an integer number is divisible by 3 (respectively 7) if the remaining of its division by 3 (respectively 7) is 0. You are allowed to use the modulus operator %.

Create a function append(v, a, n) that adds to the end of vector v a copy of all the elements of array a. For example, if v contains 1,2, 3, and a contains 4, 5, 6, then v will end up containing 1, 2, 3, 4, 5,6. The argument n is the size of the array. The argument v is a vector ofintegers and a is an array of integers. Write a test driver.

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 a function that verifies if a given number exists in an array of floats. The function is supposed to return the first position in where the number is encountered. If the given number does not exist, the function returns –1. Then write a complete program that asks the user to enter an array of 8 floats and calls the function. The prototype of the function should be like: int Search (floats a[ ], int n, float number); Example: Consider the following array of floats int x[8]={2.1, 5.0, 9.8, 4.4, 6.8, 12.88, 9.87, 4.56}; If the number to be searched is 5.4, the function returns –1 If the number to be searched is 9.8,the function returns 2 C++ language only.

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

Create 4 vectors v1 = rep(0, times=6), v2=1:4, v3=1:2, v4=1:3. Calculate v1+v2, v1+v3, v1+v4, v2*v3, v2*v4. What do you find?