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 *

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Similar questions

Write a program Minesweeper.java that takes three integer command-line arguments m, n, and k and prints an m-by-n grid of cells with k mines, using asterisks for mines and integers for the neighboring mine counts (with two space characters between each cell). To do so, Generate an m-by-n grid of cells, with exactly k of the mn cells containing mines, uniformly at random. For each cell not containing a mine, count the number of neighboring mines (above, below, left, right, or diagonal)
Write a Java method that takes two 2 dimensional int arrays (a and b) anda 2 dimensional boolean array (c) where all three arrays have the samesize. Your method should return an array (result) such that, if a particular element in c is true, then the corresponding (same indexed) elementin result must be the multiplication of the the corresponding elements ofa and b. If the element in c is false, then the the corresponding elementin result must be the negative of multiplication of the the correspondingelement in a and b.
Write a program in java that randomly fills in 0s and 1s into an n-by-n matrix, prints the matrix, and finds the rows and columns with the most 1s. (Hint: Use two ArrayLists to store the row and column indices with the most 1s.)
solve in java Given the integer array averageMiles with the size of NUM_ELEMENTS, write a for loop to output the integers in the first half of averageMiles in reverse order. Separate the integers with a dash surrounded by spaces (" - "). Ex: If the input is 75 84 39 85 115 118 48 50, then the output is: 85 - 39 - 84 - 75 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 import java.util.Scanner; public class MileData { publicstaticvoidmain(String[] args) { Scannerscnr=newScanner(System.in); finalintNUM_ELEMENTS=8; int[] averageMiles=newint[NUM_ELEMENTS]; inti; for (i=0; i<averageMiles.length; ++i) { averageMiles[i] =scnr.nextInt(); } for (/* Your code goes here */) { /* Your code goes here */ } System.out.println(); } }
FOR JAVA Write a Java method that takes two 2 dimensional int arrays (a and b) and a 2 dimensional boolean array (c) where all three arrays have the same size. Your method should return an array (result) such that, if a partic- ular element in c is true, then the corresponding (same indexed) element in result must be the multiplication of the the corresponding elements of a and b. If the element in c is false, then the the corresponding element in result must be the negative of multiplication of the the corresponding element in a and b. For example ifa = {{1,2,3},{4,5}},b = {{1,2,1},{0,2}} andc = {{true,false,true},{false,true}}, then the result should be result={{1, -4, 3}{0, 10}}.
. Implement a program that randomly generates 10 integers from -100 to 100, stores them in a 1D array, and finds their maximum value. Calculate the execution time of finding a maximum. Repeat the test for 10,000 and 10,000,000 numbers. Provide your results in the form of a table below and provide a small summary. Implement a Java program that will populate a 5x5 matrix with randomly generated integers from 0 to 100. (1) print your matrix in a table form. (2) modify your code to multiply all even numbers by 10 and print the matrix. Your output of questions (1) and (2) should match the format of the following sample outputs:
Write a JAVA program to find the unique element which is present only once in the given array. All the remaining elements are repeated twice in the array. int []a = {2, 14, 6, 22, 2, 34, 22, 8, 6, 14, 8}; Use constant space and linear time.
Consider an array A of N values (N entered by the user). Write a C program that creates a second array B such that the i-th element of B, i.e., B[i] is equal to A[0] *A[1] * A[2] * ... A[i]; In other words:- B[0] = A[0]- B[1] = A[0] * A[1];- B[2] = A[0] * A[1] * A[2];- B[3] = A[0] * A[1] * A[2] * A[3]- ....etc.For this exercise, we would like to implement two solutions and compare their complexity /performance in terms of computation time.Solution 1: Implement blindly the following algorithms: for each element B[i], compute A[0] *A[1] * A[2] * .... *A[i] and save the result in B[i];To test the solution, create an array A of 1000 elements and initialize each of its elements with arandom value (instead of asking the user to . To do that, use the function rand, which, every timecalled, returns a random number Questions:- How long does your program take to produce the solution?- Analyze the solution above and explain why it is taking long time. What are the mainfactors that affect how long…
Write a Java program to find continuous sub array of the given array whose sum is equal to a given number. For example, If {12, 5, 31, 9, 21, 8} is the given array and 45 is the given number, then you have to find continuous sub array in this array such that whose elements add up to 45. In this case, {5, 31, 9} is such sub array whose elements add up to 45.
Write a java while loop that loops through an array of type int with a size of 6, and adds up every other element in the array and prints the sum.
Write a program that randomly fills in 0s and 1s intoa 5-by-5 matrix, prints the matrix, and finds the first row and column with themost 1s. Here is a sample run of the program:0110101011100101111100101The largest row index: 3The largest column index: 4
Write a Java method that takes the elements of a 2-dimensional array a (n * m), then itgives back the sum of the lines (separately) in an array b (n) and the product of thecolumns (separately) in an array c (m).