i need the answer quickly !Write a program to set zero in thelower triangular of a given matrixa(4,4). For example array below.1245023600890004For i = 1 To 4For j = 1 To 4=a(i, j)Next j: Next iFor i = 1 To 4For j = 1 To 41-2-3-4-End IfNext jPrintNext iInputBox("")1-If i <= j Then 2-Print "0"; 3-Else 4-Print a(i,j);1-If i <= j Then 2-Print a(i, j); 3-Blank 4-Print "0";1-If i=j Then 2-Print a(i, j); 3-Else 4- Print"0";-ts1-If i >= j Then 2-Print a(i, j); 3-Else 4- Print"0";1-If i <= j Then 2-Print a(i, j) 3-Else 4- Print"0"OP

Introduction: For a Given a 4x4 dimensional array, We need to set zero in the lower triangular…

Write a program to set zero in the lower triangular of a given matrix a(4,4). For example array below. 1245 0236 0089 0004 For i = 1 To 4 For j 1 To 4 a(i, j) = InputBox("") Next j: Next i For i = 1 To 4 For j = 1 To 4 1- 2- 3-. 4- End If Next j Print Next i 1-If i <= j Then 2-Print "0"; 3-Else 4-Print a(i, j); 1-If i <= j Then 2-Print a(i, j); 3-Blank 4- Print "0"; 1-If i = j Then 2-Print a(i, j); 3-Else 4- Print "0"; 1-If i >= j Then 2-Print a(i, j); 3-Else 4- Print "0"; 1-If i <= j Then 2-Print a(i, j) 3-Else 4- Print "0"

Write a program to set zero in the lower triangular of a given matrix a(4,4). For example array below. 1245 0236 0089 0004 For i = 1 To 4 For j 1 To 4 a(i, j) = InputBox("") Next j: Next i For i = 1 To 4 For j = 1 To 4 1- 2- 3-. 4- End If Next j Print Next i 1-If i <= j Then 2-Print "0"; 3-Else 4-Print a(i, j); 1-If i <= j Then 2-Print a(i, j); 3-Blank 4- Print "0"; 1-If i = j Then 2-Print a(i, j); 3-Else 4- Print "0"; 1-If i >= j Then 2-Print a(i, j); 3-Else 4- Print "0"; 1-If i <= j Then 2-Print a(i, j) 3-Else 4- Print "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 that randomly fills in 0s and 1sinto an n-by-n matrix, prints the matrix, and finds the rows and columns with themost 1s. Here is a sample run of the program: Enter the array size n: 4 ↵EnterThe random array is0011001111011010The largest row index: 2The largest column index: 2, 3
Write a program that prints at least 10 characters of your name (last, first) in uppercase at the terminal. Use a n by m array (i.e., a two dimensional array, with n (=7) as size of the first dimension and m (=10) as the second dimension) to represent each oversize letter. C++, the name is "Krish"
# the method take another circular array and returns a linear array containing the common elements between the two circular arrays. def intersection(self, c2): # To Do print("==========Test 10==========") lin_arr9 = [10, 20, 30, 40, 50, None, None, None] c10 = CircularArray(lin_arr9, 5, 5) c10.printFullLinear() # This should print: 40, 50, None, None, None, 10, 20, 30 lin_arr10 = [5, 40, 15, 25, 10, 20, 5, None, None, None, None, None] c11 = CircularArray(lin_arr10, 8, 7) c11.printFullLinear() # This should print: 10, 20, 5, None, None, None, None, None, 5, 40, 15, 25 output = c10.intersection(c11) print(output) # This should print: [10, 20, 40]
Write a program that does the following:- Prompts the user to enter 5 double floating point numbers and stores them in array A.- Creates another array B, and fills it by summing up the values of each two consecutivearray elements from array A.- Prints array B.For example, for array A = [2.2, 3.5, 6.7, 4.3, 1.5], array B will be = [5.7, 10.2, 11, 5.8]
Write a program that randomly fills in 0s and 1s into a 4-by-4 matrix, prints the matrix, and finds the first row and column with the most 1s. Here is a sample run of the program: 0011 0011 1101 1011 The largest row index: 2 The largest column index: 3
. 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:
#using python # the method take another circular array and returns a linear array containing the common elements between the two circular arrays. def intersection(self, c2): # To Do lin_arr1 = [10, 20, 30, 40, None] print("==========Test 10==========") lin_arr9 = [10, 20, 30, 40, 50, None, None, None] c10 = CircularArray(lin_arr9, 5, 5) c10.printFullLinear() # This should print: 40, 50, None, None, None, 10, 20, 30 lin_arr10 = [5, 40, 15, 25, 10, 20, 5, None, None, None, None, None] c11 = CircularArray(lin_arr10, 8, 7) c11.printFullLinear() # This should print: 10, 20, 5, None, None, None, None, None, 5, 40, 15, 25 output = c10.intersection(c11) print(output) # This should print: [10, 20, 40]
Suppose that you are playing a card game whose goal is to collect exactly k cards with a total value of t. Write a solution that can determine if it is possible for a given collection of cards whose values are given in the array values. For example, if the array contained the values <10,5,7,2>, k = 3, and t = 12, you would return false because no three values add to 12. However, if t = 14, you would return true, since 5 + 7 + 2 = 14. So I considered this to be a form of groupSum recursion, so I try to implement it in recursion form. However, since the passing parameters are not the incrementing level index but 'k' that is the limit number of the numbers we can choose from the array, I cannot use passing index through recursion to search from the start of the array toward the end of the values.length(the length of the array). would there be any method I can use to increment and search along the array using k, the number of numbers we can add into the total(t) instead of the…
Implement the following method to sort the columns in a twodimensional array. A new array is returned and the original array is intact.public static double[ ][ ] sortColumns(double[ ][ ] m) Write a test program that prompts the user to enter a 4 X 4 matrix of doublevalues and displays a new column-sorted matrix. Here is a sample run: Enter a 4−by−4 matrix row by row:0.15 0.875 0.375 0.225 ↵Enter0.55 0.005 0.225 0.015↵Enter0.30 0.12 0.4 0.008 ↵Enter0.07 0.021 0.14 0.2 ↵EnterThe column−sorted array is0.07 0.005 0.14 0.0080.15 0.021 0.225 0.0150.30 0.12 0.375 0.20.55 0.875 0.4 0.225
Implement the following method to sort the rows in a two-dimensionalarray. A new array is returned and the original array is intact.public static double[][] sortRows(double[ ][ ] m)Write a test program that prompts the user to enter a 4 x 4 matrix of doublevalues and displays a new row-sorted matrix. Here is a sample run: Enter a 4−by−4 matrix row by row:0.15 0.875 0.375 0.225 ↵Enter0.55 0.005 0.225 0.015 ↵Enter0.30 0.12 0.4 0.008 ↵Enter0.07 0.021 0.14 0.2The row−sorted array is0.15 0.225 0.375 0.8750.005 0.015 0.225 0.550.008 0.12 0.30 0.40.021 0.07 0.14 0.2
Write a program that should ask the user to input 12 elements (positive whole numbers) inside the array and then it will sort the even numbers in ascending order and odd numbers in descending order. If the user's input is not a positive whole number, then prompt "ERROR! Please input a positive whole number only. Sample Output: Input: 1 18 15 17 14 25 30 77 48 52 64 89 Even Numbers: 14 18 30 48 52 64 Odd Numbers: 89 77 25 17 15 1
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.