Write a program RandomWalker.java that takes an integer command-line argument r and simulates the motion of a random walk until the random walker is at Manhattan distance r from the starting point. Print the coordinates at each step of the walk (including the starting and ending points), treating the starting point as (0, 0). Also, print the total number of steps taken.

Write a Java application that calculates the sum of a series of integers that are passedto method sum() using a variable-length argument list. Test your method with severalcalls, each of which with different number of arguments

Implement a function alterCase in Python that converts a word to "alterCase". Given a word, using any mix of upper and lower case letters, the function then returns the same word, except that the first letter is upper case, the second is lower case, and then cases of letters alternate throughout the rest of the word. >>> alterCase('apple')'ApPlE'

Java. Please use the template

I am running a hotdog eating contest parameters are; 10 hotdogs to the pack 8 buns to the pack random # of contestants and hotdogs to be eaten.  if say 2 contestants eat 3 hotdogs each how many hotdogs and buns will be left over,  how many dogs and bun open packs will there be.  This must be written up in java code but my algebra is not working.

Write an improved version of the chaos . py program from Chapter 1 thatallows a user to input two initial values and the number of iterations, and then prints a nicely formatted table showing how the values changeover time. For example, if the starting values were . 25 and . 26 with 10iterations, the table might look like this: index 0.25 0.26----------------------------1 0 . 731250 0 . 7503602 0 . 766441 0 . 7305473 0 . 698135 0 . 7677074 0 . 821896 0 . 6954995 0 . 570894 0 . 8259426 0 . 955399 0 . 5606717 0 . 166187 0 . 9606448 0 . 540418 0 . 1474479 0 . 968629 0 . 49025510 0.118509 0 . 974630

A program in java

Given two sorted arrays, your task is to merge them in a new sorted array. Write a complete program in Java that takes two stored arrays of integers, and then calls a method that merges the two sorted arrays into one array that is sorted. The method returns a new array made by merging the two input sorted arrays. Note that the input arrays can be of different sizes. Assume that the size of each input array is given. You can NOT write a sorting algorithm or apply sorting. To clarify: You cannot merge the two arrays into one and then just sort it using a sorting algorithm. Examples: Input : arr1 = { 1, 3, 4, 5} arr2 = {2, 4, 6, 8} Output : arr3 = {1, 2, 3, 4, 5, 6, 7, 8} Input : arr1 = { 5, 8, 9} arr2 = {4, 7} Output : arr3 = {4, 5, 7, 8, 9}

Write a python code using IntegerRoot class that calculates integer nth root of a number m ifits nth root is an integer. For example: (m,n) where m = 1881676372240757194277820616164488626666147700309108518161,n = 3, then the integer nth root of m (i.e. the integer cubic root of m ) is: rgives an out put r = 12345678900987654321.