Make a C++ program that incorporates recursion to solve the following problem. The program has to compile and execute under the UNIX gcc or g++ environments. For this program have it accept a sequence of k characters from the user and use the characters to produce a k concentric squares. Assuming an index origin of 1, the outermost square is made up of the letter a[k], the square inside that is made from the letter a[k-1], the square inside that is made from the letter a[k-2], and so on, with the innermost square made from the letter a[1]. For example, if k=5, and the values of a are ("B","U","C","K","Y") then the executed program should display: Y Y Y Y Y Y Y Y Y Y K K K K K K K Y Y K C C C C C K Y Y K C U U U C K Y Y K C U B U C K Y Y K C U U U C K Y Y K C C C C C K Y Y K K K K K K K Y Y Y Y Y Y Y Y Y Y

Sample question for Java programming handbook.

Please provide a thorough code in python

The point P has coordinates x = -3 m and y = 4 m relative to the origin O. The vector v is v = -4î + 4î m/s. Matlab Mathematica Python SymPy from sympy import * Px = -3 Py = 4 v = Matrix([-4, 4, 0]) copy this text What is the orthogonal projection of v onto the vector û = -ếg associated with the polar coordinates for point P? Proj(t, й) — e î+ e jm/s

Please IN C++ Write the simplest program that will demonstrate iteration vs recursion using the following guidelines - Write two primary helper functions - one iterative (IsArrayPrimeIter) and one recursive (IsArrayPrimeRecur) - each of which Takes an array of integers and its size as input params and returns a bool such that 'true' ==> all elements of the array are prime, so the array is prime, 'false' ==> at least one element in array is not prime, so array is not prime. Print out a message "Entering <function_name>" as the first executed statement of each function. Perform the code to test whether every element of the array is a Prime number. Print out a message "Leaving <function_name>" as the last executed statement before returning from the function. Remember - there will be nested loops for the iterative function and there can be no loops at all in the recursive function. For the recursive function - define one other helper function (IsPrimeRecur) which...

This is ML. Need help with code through SOML. And working with java (6p) Function max3 of type int int int - int that returns the largest of three integers For example max3 (3, 11, 7) should return 11.

Write a C++ program using classes and recursion functions to covert a number in a given base (the user enters the base - from 2 to 9) to a decimal number. The algorithm states that each successive digit in the number is multiplied by the base raised to the power corresponding to its position in the number. The low-order digit is in position 0. We sum together all of these products to get the decimal value. For example, in binary- base 2, if we have the binary number 111001, we convert it to decimal as follows: 1x25 + 1x2* + 1x23 + 0x22+ 0x22 + 1x2o = 57 For a base 5 number, 14230: 1x5 + 4x53 + 2x52 + 3x5+ Ox5° = 1190 Validate your input. You should check for invalid digits and provide an informative error message to the user. This program requires you to use a recursive function for the conversion to decimal. Failure to do that will result in no points awarded.

Define a Python function split_dict() that takes a number x and a dictionary d whose keys are strings and values are numbers. It returns a tuple (d1, d2) of dictionaries of the same kind, where di consists of the key-value pairs of d whose values are less than or equal to x, and d2 consists of the key-value pairs of d whose values are greater than x. The following is an example execution.>>> d= dict([('a', 2), ('b', 10), ('c', 2), ('d', 9), ('e', 5)])>>> x = 3>>> print (split_dict (x, d)) ({'a': 2, 'c': 2}, {'b': 10, 'd': 9, 'e': 5})>>>

4. Given the following recursive definitionseq(1) = seq(2) = 1seq(n) = 2 ∗ seq(n − 1) + 3 ∗ seq(n − 2)implement the corresponding program and use it to calculate seq(5).How many invocations are made to the function seq when calculating seq(5)?

In Kotlin, Write a recursive function called myZip, with an expression body. MyZip takes two Lists and returns a List of Pairs in which each value may be any type (I suggest your start by thinking out how to represent this data type). The pairs consist of corresponding elements in the two lists (the first element of the first list and the first element of the second list, etc). The base case should be that either (or both) of the original lists has length 1, so that, if the lists have different length, the zipping stops when the first list runs out of values.

Write a C++ program incorporating recursion to solve the following problem. The program should compile and execute under the UNIX gcc or g++ environments. (show this please) In this program it needs to accept a sequence of k characters from the user and use the characters to produce a k concentric squares. Also assume that there is an index origin of 1, the outermost square is made up of the letter a[k], the square inside that is made from the letter a[k-1], the square inside that is made from the letter a[k-2], and so on, with the innermost square made from the letter a[1]. For example, if k=5, and the values of a are ("R","O","C","K","Y") then the executed program should display: Y Y Y Y Y Y Y Y Y Y K K K K K K K Y Y K C C C C C K Y Y K C O O O C K Y Y K C O R O C K Y Y K C O O O C K Y Y K C C C C C K Y Y K K K K K K K Y Y Y Y Y Y Y Y Y Y To make this program simpiler to do if you implement it in C++ and write a class; instances of this class can be passed by value. If a class is...

In c++, Thanks!!! Write the simplest program that will demonstrate iteration vs recursion using the following guidelines - Write two primary helper functions - one iterative (IsArrayPrimeIter) and one recursive (IsArrayPrimeRecur) - each of which Take an array and its size as input params and return a bool such that 'true' ==> array and all elements are prime, 'false' ==> at least one element in array is not prime, so array is not prime. Print out a message "Entering <function_name>" as the first statement of each function. Perform the code to test whether every element of the array is a Prime number. Print out a message "Leaving <function_name>" as the last statement before returning from the function. Remember - there will be nested loops for the iterative function and there can be no loops at all in the recursive function. You will need to define one other helper function (IsPrimeRecur) for the recursion which should also not contain any loops to make it a...