can choose two indices x and y (x≠y) and set ax=⌈axay⌉ (ceiling function).   Your goal is to make array a consist of n−1 ones and 1 two in no more than n+5 steps. Note that you don't have to minimize the number of steps.   Input

A bit new to methods and need a little bit of help.     Swap Method Your task is to write a public static method named swap that takes a single parameter which is an array of doubles. This method should swap the first and last element in the array and then return the adjusted double array. You can assume that all arrays passed into the method are a length of 2 or more. For example, the test data provided when passed into the swap method should go from: {8.34, 7.221, 10.643, 93.2} to

initialise a variable named Min and set its value equal to first item of array. start a for loop to iterate through every element of marks array. check if item<Min. if 4 is true: set Min = item, else continue after the loop will finish, Min variable will have lowest marks    For total marks for all the students. initialise a variable named Sum and set its value equal to zero. start a for loop to iterate through every element of marks array. for every iteration, do sum = sum+item after the loop will finish, sum variable will have total marks of all students The overall average. initialise a variable named Sum and set its value equal to zero. initialise another variable count =0. start a for loop to iterate through every element of marks array. for every iteration, do sum = sum+item, and increase count by 1. after the loop will finish, sum variable will have total marks of all students and count will have total count of marks. 5. to calculate average, do average = sum/count.

Problem 1: Complete the sumOfDiagonals method in SumOfDiagonals.java to do the following: The method takes a 2D String array x as a parameter and returns no value. The method should calculate and print the sum of the elements on the major diagonal of the array x. In order to have a major diagonal, the array passed into the method should be a square (n-by-n), if it's not a square your program should handle that situation by throwing an exception. (Do Not worry about ragged arrays) If the array is a square, but there is a non-integer value on the major diagonal, your program should handle that situation by throwing an exception. When handling the exceptions, be as specific as you can be, (i.e. Do Not just use the Exception class to handle all exceptions in one catch block). Make the proper calls to the sumOfDiagonals method from the main method to test your sumOfDiagonals method on all the String arrays provided in the main method.

Real World Example You work at a car dealership and your boss asks you to get the color of a car. He tells you the parking lot to get it from (the object you're searching) and then writes exactly where it is. row1 [0].color, he could also give you this direction as an array ["row1", "[0]", "color"]. If there is no color he tells you to tell him "no color found" (the default value). You follow his instructions and return "red". Examples = { "a": [{ "b": { "c": 3 } }] } var object get (object, "a[0].b.c") → 3 get (object, ["a", "0", "b", "c"]) -3 get (object, "a.b.c", "default") "default"

Game plays a very crucial role in over daily life. It helps you to stay fit in your life so let's play a game. The name of the game is Pick and Drop. In this game, an array of integers AA is of size NN, and each player (Mr. Hyperwhite and Gale BoetticherGale Boetticher) removes one number from the array in alternating moves until only one number remains. If the remaining number is even, Mr. White wins, otherwise Gale wins. Whoever loses will be eliminated by Gus. Mr. White always takes the first turn (i.e., Mr. White first turn -> Gale second turn -> Mr. White third turn and so on). Mr. White is thinking about which number to choose in the first move to win. Help Mr. White by determining the number of ways he can pick the first number to win. Note: C++ will be your programming language. Input 1 5 12345 Output -1

Assignment 5B: Keeping Score. Now that we know about arrays, we can keep track of when events occur during our program. To prove this, let's create a game of Rock-Paper-Scissors. For those not familiar with this game, the basic premise is that each player says "Rock-Paper- Scissors!" and then makes their hand into the shape of one of the three objects. Winners are determined based on the following rules: Rock beats Scissors Scissors beats Paper Paper beats Rock At the start of the program, it will ask the player how many rounds of Rock-Paper- Scissors they want to play. After this, the game will loop for that many number of times. Each loop, it will ask the player what item they want to use – Rock, Paper, or Scissors. The computer will randomly generate its own item, and a winner will be determined. The game will then save the result as an element of an array, and the next round will begin. Once all the rounds have been played, the program will say "Game Over" and display a list of who…

Rotate Right k cells (use python)  Consider an array named source. Write a method/function named rotateRight( source, k) that rotates all the elements of the source array to the right by 'k' positions. You must execute the method by passing an array and number of cells to be shifted. After calling the method, print the array to show whether the elements have been shifted properly. Example: source=[10,20,30,40,50,60] rotateRight(source,3) After calling rotateRight(source,3), printing the array should give the output as:   [ 40, 50, 60, 10, 20, 30]

Correct answer will be upvoted else Multiple Downvoted. Computer science. assume mid=⌊max(array)+min(array)2⌋, where max and min — are capacities that track down the maximum and the base array components. At the end of the day, mid is the amount of the maximum and the base component of array separated by 2 adjusted down.    Then, at that point, the array is parted into two parts left and right. The left array contains all components which are not exactly or equal mid, and the right array contains all components which are greater than mid. Components in left and right maintain their relative control from array.    During the third step we pick which of the left and right arrays we want to keep. The picked array replaces the current one and the other is permanently discarded.    You want to assist Mike with discovering the aftereffects of q beauty tests.    Note that you test the attractiveness of the array a, so you start each beauty test with the primordial (initial) array a.…

Wrist a code to find the iterative sum of an array and the range (max and min)