Band matrices. Write a program BandMatrix.java that takes two integer command-line arguments n and width and prints an n-by-n pattern like the ones below, with a zero (0) for each element whose distance from the main diagonal is strictly more than width, and an asterisk (*) for each entry that is not, and two spaces between each o or *. E distance 2 3 4 5 6 7 1 2 3 4 5 6 01 2 3 4 5 3 2 0\1 2 3 4 4 3 2 10 1 2 3 5 4 3 2 1 0 1 2 6 5 4 3 2 101 7 6 5 4 3 2 10 1 21 main diagonal Here, distance means the minimum number of cells you have to move (either left, right, up, or down) to reach any element on the main diagonal. ~/Desktop/loops> java BandMatrix 8 0 * 0 0 0 0 0 0 0 0 * 0 0 0 0 0 0 0 0 * 0 0 0 0 0 0 0 0 * 0 0 0 0 O 0 0 0 * o o o O 0 0 0 0 * 0 o 0 0 0 0 0 0 * 0 0 0 0 0 0o 0 * -/Desktop/loops> java BandMatrix 8 1 0 0 0 00 0 * * 0 0 00 0 0 * ** 0 0 0 0 0 0 *** 0 0 0 0 0 0 * * * 0 0 0 0 0 0 * * *0 0 0 0 0 0 * ** 0 0 0 0 0 0 * * -/Desktop/loops> java BandMatrix 8 2 0 0 0 0 0 0 0 * 0 0 0 * * * 0 0 0 0 ** * 0 0 0 0 * * 0 0 0 0 * * 0 0 0 0 0 *

Band matrices. Write a program BandMatrix.java that takes two integer command-line arguments n and width and prints an n-by-n pattern like the ones below, with a zero (0) for each element whose distance from the main diagonal is strictly more than width, and an asterisk () for each entry that is not, and two spaces between each o or . E distance 2 3 4 5 6 7 1 2 3 4 5 6 01 2 3 4 5 3 2 0\1 2 3 4 4 3 2 10 1 2 3 5 4 3 2 1 0 1 2 6 5 4 3 2 101 7 6 5 4 3 2 10 1 21 main diagonal Here, distance means the minimum number of cells you have to move (either left, right, up, or down) to reach any element on the main diagonal. ~/Desktop/loops> java BandMatrix 8 0 * 0 0 0 0 0 0 0 0 * 0 0 0 0 0 0 0 0 * 0 0 0 0 0 0 0 0 * 0 0 0 0 O 0 0 0 * o o o O 0 0 0 0 * 0 o 0 0 0 0 0 0 * 0 0 0 0 0 0o 0 * -/Desktop/loops> java BandMatrix 8 1 0 0 0 00 0 * * 0 0 00 0 0 * 0 0 0 0 0 0 * 0 0 0 0 0 0 * * * 0 0 0 0 0 0 * * 0 0 0 0 0 0 ** 0 0 0 0 0 0 * * -/Desktop/loops> java BandMatrix 8 2 0 0 0 0 0 0 0 * 0 0 0 * * * 0 0 0 0 ** * 0 0 0 0 * * 0 0 0 0 * * 0 0 0 0 0 *

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Write a program RURottenTomatoes.java that creates a 2 dimensional integer array of movie ratings from the command line arguments and displays the index of the movie that has the highest sum of ratings. Ratings range from 1 to 5 (inclusive). The rows of the 2D array correspond to movie reviewers and the columns of the 2D array correspond to movies. The reviewer at index 2 gave movie at index 0 a rating of 4. Take a look at the following example for an explanation on the command line arguments sequenc. The first argument corresponds to the number of reviewers and the second argument corresponds to the number of movies (the dimensions of the 2D integer array). Following are the movie ratings in a row-major order. This means that the first row is filled first, then the second row, etc. In the example above there are 3 reviewers and 2 movies, and the program displays 0 (zero) because the movie at index zero has the highest sum of ratings (movie 0 has sum of ratings equals to 12 while…
Write a Java program with a single-dimension array that holds 10 integer numbers and identify the maximum value of the 10 numbers. Next sort the array using a bubble sort and display the array before and after sorting. Psuedocode Generate 10 random integer numbers between 1 and 100 place each random number in a different element of a single-dimension array Display the array's contents unsorted as they are generated Using the bubble sort, sort the array from smallest integer to the largest. //must use the following: Bubble Sort Code: public static void bubbleSort(int[] list) { int temp; for (int i = list.length - 1; i > 0; i--) { for (int j = 0; j < i; j++) { if (list[j] > list[j + 1]) { temp = list[j]; list[j] = list[j + 1]; list[j + 1] = temp; }…
I need help with creating a Java program described below: Minesweeper.Write a program that reads three numbers, m, n, and p and produces an m-by-n Booleanarray where each element is occupied with probability p. In the minesweeper game, occupiedcells represent bombs and empty cells represent safe cells.Print out the array using an asterisk for bombs and a period for safe cells.Then, create an integer two-dimensional array with the number of neighboring bombs (above,below, left, right, or diagonal). * * . . . * * 1 0 0. . . . . 3 3 2 0 0 . * . . . 1 * 1 0 0Write your code so that you have as few special cases as possible to deal with, by using an(m+2)-by-(n+2) Boolean array.
Write a Java program with a single-dimension array that holds 10 integer numbers and identify the maximum value of the 10 numbers. Next sort the array using a bubble sort and display the array before and after sorting.
Write a Java program that reads an integer N from the user and declares an integer array of size N. It then inputs N non-negative integers from the user into the array and do the following: 1. Finds and prints the minimum, maximum, sum, and average of the numbers. 2. Displays array data as a histogram – graphically by plotting each numeric value as a bar of asterisks (+) as shown in the example diagram. This is somehow similar to Lab11 Sample output Enter the size of array: 9 Enter 9 integer values: 10 19 5 14 Minimum = Maximum = 19 = 68 = 7.55 Sum Average ========== Histogram: ======= Element Ua lue 10 19 Histogran T T T Arial v T = ABC 3 (12pt) II Com