Write a Java program to implement a stack using an array. The program should have methods to push an element onto the stack, pop an element from the stack, and check if the stack is empty. Additionally, implement a method to return the size of the stack. Provide an explanation of the code and its time and space complexity.

Write a Java program to input a list of names (strings) from the user and store them in an ArrayList. The input can be terminated by entering the empty string or b yentering the string "quit".

Write a java program. Write a method getDecimalArray that recieves an array named octalArray containing values 0, 121, 3232, 0, 4565, 67654, 79867. The task is to compute the decimal representations of all the numbers in octalArray and store the decimal representations in another array named decArray with int datatype. Hint: You'll need to implement nested loops, outer for the traversal of octalArray and inner for the computayion of decimal representation of current octal number.For 121 = (1*81)+(2*81)+(1*80)

Write a Java class that creates a 3x4 array of 12 random ints between 0 and 100. Write a method to return the sum of the elements in the last column of each row in the two-dimensional array.

Write the Java method averageOfDoubles that is passed an array of double values, and returns the average of the array values.You can assume the array length is a positive integer.

Please use Java for the solution

The java program ArrayTest.java is intended to do the following: • Fill the array a with integer values input from the file ints.txt. • (Shift-right) Shift the elements of a to the right one position and put the last element of array a in the first position in a (wrap around). Example: if a originally contained (1, 2, 3, 4} then the resulting array a would be (4, 1, 2, 3} What command would be given on the command line to redirect the input to the program ArrayTest to come from the text file ints.txt? Enter your answer here

Need help with this Java problems. Java files are attached. Add your code to the file ArrayStack2Lab.java. Add your tests to the main() method. Submit ArrayStack2Lab.java. Problem 1 Implement the method public void display() which displays the entries in a stack starting from the top. If the stack is empty, print "The stack is empty". Add the method to ArrrayStack2Lab.java. You do not need to modify StackInterface.java. Problem 2 Implement the method public int remove(int n) The method removes the n top most entries for a stack . If the stack contains less than n items, the stack becomes empty. The method returns the number of items removed. Add the method to ArrrayStack2Lab.java. You do not need to modify StackInterface.java.

Write a Java method (do not write a class, only the method) with the following signature: Return type: void Parameters: 2D integer array Name: printDiagonal Implement the method code that will print out the values of the 2D array along the Diagonal from left to right. For example, if the array had the following values: 56 78 98 21 33 55 98 44 11 The method should print to the console: 56,33,11 The above 2D array example is only given for you to understand the problem Do not hard code the values in your solution or assume the array is the same as the given data. Your method should work for all 2D integer arrays.

Write a Java method that receives a two-dimensional array of primitive ints ( int [] [] ). The array can have any number of rows and any number of items per row. Also, the array can be "ragged" (not all rows have the same number of items). Have the method return the average of all of the items in the array as a primitive double.

Write a program for Stack (Array-based or linked list-based) in Python. Test the scenario below with the implementation and with the reasoning of the answer. Make comments with a short description of what is implemented. Include source codes and screen-captured outputs. Stack: A letter means doing a push operation and an asterisk means doing a pop operation in the below sequence. Give the sequence of letters that are returned by the pop operations when this sequence of operations is performed on an initially empty stack. A*BCE**F*GH***I*

Write a Java program and screenshot of the output using Stack class to show the following points: a. Create three empty stacks named stackOne, stackTwo and stackThree respectively. b. Push the numbers [a, b, c, d] "for example [7, 5, 8, 22]" into stackOne and [w, x, y, z] "for example [5, 4, 2, 11]" into stackTwo. (Note: value of the numbers [a,b,c,d, etc] for each of the student should be different) c. Pop the top number of stackOne and top number of stackTwo and add them. Then, push the addition result into stack Three. d. Pop the top number of stackOne and top number of stackTwo and subtract them. Push the result of subtraction into stackThree. e. Print StackOne, stackTwo and stackThree. f. Print the largest number in stack Three

JAVA: Write a recursive method named threeSum that accepts a list of integers and prints all combinations of three integers in the list that sum to 0. For example, if given the list [-1, 0, 1, 2, -1, -4], print the following lines of output: [-1, 0, 1] [-1, 2, -1] [0, 1, -1] You may print the lines of output in any order. The elements in each three-element sublist should appear in the same relative order that they appeared in the original list. Do not print duplicate lists; if the same exact sublist can be made in multiple ways, print it only once. If there are no combinations of three elements that sum to 0, print no output. The list passed to your method must be back to its original state at the end of the call. Either do not modify it, or if you modify it, fully undo your modifications before the method returns. Constraints: Do not declare any global variables. You can use any data structures you like, and your code can contain loops, but the overall algorithm must be recursive and...