Declare a two-dimensional array for representing a tic-tac-toe board like this: +-- -+ -+ - + | x | 0 | × | |0|0 | +- | x | The board has three rows and columns and contains strings "x", "o", and " ". The Util.print method will add the borders when printing. ArrayDemo.java 1 public class ArrayDemo 2 { public static void main(String[] args) { String[][] board = { 3 4 5 6 7 }; 8 9 Util2D.print(board); } 10 11 12 }

Declare a two-dimensional array for representing a tic-tac-toe board like this: +-- -+ -+ - + | x | 0 | × | |0|0 | +- | x | The board has three rows and columns and contains strings "x", "o", and " ". The Util.print method will add the borders when printing. ArrayDemo.java 1 public class ArrayDemo 2 { public static void main(String[] args) { String[][] board = { 3 4 5 6 7 }; 8 9 Util2D.print(board); } 10 11 12 }

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

/** * Construct a puzzle board using a 2D array of booleans to indicate which cells * are filled and which are empty. * * @param b a 5x5 boolean array where true cells indicate that the corresponding * position in the puzzle board starts filled and false indicates the * position starts cleared. The board must have exactly 16 filled * positions and 9 unfilled positions. */ public Board(boolean[][] h) { throw new RuntimeException("Not implemented"); }
The rotateLeft method takes an array of integers, and an integer number of places, and returns a new copy of the array that contains a "rotated" version of the input array. Rotation means that elements have been shifted leftwards by that number of places, moving elements off one end of the array and onto the other end. For example, [11, 12, 13, 14, 15] rotated left by 2 places results in [13, 14, 15, 11, 12].
Please help me fix this code Make it run out like the picture import java.util.ArrayList; import java.util.Random; import java.util.Scanner; public class FrogListApp { public static void main(String[] args) { final int MIN_WEIGHT = 1; final int MAX_WEIGHT = 25; // Step 3: Create an array list to store Frog objects ArrayList frogsList = new ArrayList<>(); // Step 4: Create a Scanner object Scanner scanner = new Scanner(System.in); // Step 5: Read an integer as the number of frogs // using prompt "Enter the number of frogs: " System.out.print("Enter the number of frogs: "); int numberOfFrogs = scanner.nextInt(); // Step 6: Read an integer as the random generator seed // using prompt…
Using this code in Java: public class Main { public static void main(String[] args) {// change the dimension to 500, 5000 to repeat for big array sizefinal int dimension = 50;System.out.println("Array dimension: "+ dimension);//aint[] array = new int[dimension]; //b for (int ink = 0; ink < dimension; ink++) array[ink] = ink; //c String stringObject = new String(); // d record time long startTime = System.currentTimeMillis(); for (int ink = 0; ink < dimension; ink++) stringObject += array[ink]; long endTime = System.currentTimeMillis(); //e System.out.println("Time to append using string object: " + (endTime - startTime) + " ms."); //f StringBuilder builder = new StringBuilder(); startTime = System.currentTimeMillis(); for (int ink = 0; ink < dimension; ink++) builder.append(array[ink]); endTime = System.currentTimeMillis(); //e System.out.println("Time to append using string builder object: " + (endTime - startTime) + " ms."); } }
In javacode: Use ArrayList to create an array called myAL of type integer. --Fill the array with the values 5, 10, 15, 22, 33. --Print the array (use enhanced for loop). --Insert the value 25 between 10 and 15 and print the array.--Remove 2 elements on index 1 and 3 and then print the array.--Print if the array contains the value 123 or not.--Print the index of the element 22.--Print the size of the array.
Write a Java program to find the median of all elements in an array of integers. The median is the middle value in an ordered set of numbers. If the number of elements is even, the median is the average of the two middle values. Crease a class name Task5. There should be a main method and a “findMedian” method to find out the median of an input array.
Given an ArrayList of Integers, find a subarray with the maximum sum of any potential subarray within the ArrayList. A subarray is any combination of consecutive numbers. The subarray can be of any length n, where the size of n >= 0. import java.util.ArrayList;public class MaxSubArray{public static ArrayList<Integer> solution(ArrayList<Integer> nums){// ↓↓↓↓ your code goes here ↓↓↓↓return new ArrayList<>();}}
Programming exercise (in java eclipse, please add comments for each step). Write a complete Java program named FindProduct that contains the following: a. A main method asks the user to provide the number of rows and columns for a 2-dimensional array of integers. b. A main method calls the getArray() method that creates the 2D array of specified size and populates it with random values from 0 to 100. c. A main method prints the elements of the 2D array created by getArray(). d. A main method calls the printProduct method that will: i. Receive the two-dimensional array as input ii. Calculate the product of elements in each row of the array iii. Display the product on the Console. The product of all elements in each row should be formatted as "Row 1 Product XXXX"
Given an ArrayList of integers, return an ArrayList where all the odds are before the evens in the order that they occur. public ArrayList<Integer> solution(ArrayList<Integer> nums) {ArrayList<Integer> finalList = new ArrayList<>();int index = 0;for (int i = 0; i < nums.size(); i++) {if (nums.get(i) % 2 == 1) {finalList.add(index, nums.get(i));index++;} elsefinalList.add(nums.get(i));}return finalList;} This is my failing code. for [1.-3.3] where [1,3,-3] is being returned
Modify the unsortedArrayAccess class by adding a method that find the smallest element and average in the array. import java.util.*; public class unsortedArrayAccess{ public static double[] arr; public int arraySize; public unsortedArrayAccess(int scale) { arr = new double[scale]; arraySize = 0; } public int search(double Key) { int i = 0; while ((i < arraySize) && (arr[i] != Key) ) { i = i + 1; } if (i < arraySize) { return i; } else { System.out.println("There is no such item!"); return -1; } } public void append(double Item) { arr[arraySize] = Item; arraySize = arraySize + 1; } public double remove() { if (arraySize == 0) { System.out.println("There is no item in the array!"); return -1; } double x = arr[arraySize - 1]; arraySize = arraySize - 1; return x; } public void deletion(double Key) { int k = search(Key); if (k != -1) { for (int i = k; i…
code: import java.util.Random;import java.util.ArrayList;import java.util.Scanner;public class WeekendOrders {/*** * This method takes as input the scanner instance created from main and* asks the user for input on the number of orders placed on each of the * days on the long weekend (Saturday, Sunday, and Monday). * Put the number of orders for each day in an array of fixed size* * * @param scnr (an instance of Scanner)* @return an array of int which includes the number of orders* placed on each day, with one day per index of the array*/public static int[] getUserInput(Scanner scnr){// DO NOT MODIFY THIS LINEint[] userInput = new int[3];// TODO: Prompt user for input on number of orders on each day// and store in userInputreturn userInput; }/*** * This method appends all the new orders for the given day onto the * arraylist. It first generates a random int between 0-2 (inclusive).* If the int is 0: it adds "Burger" to the prevOrders list* If the int is 1: it adds "Fries" to the…
Given a non-negative integer N, the task is to find the Nth row of Pascal’s Triangle. import java.util.ArrayList;public class NthRowPascal{public static ArrayList<Integer> solution(int nth){// ↓↓↓↓ your code goes here ↓↓↓↓return new ArrayList<>();}}