
Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Question
Write in Java.
Write a function to read elements of a N by N, 2 dimensional (2D) array and display the 2D array in a matrix form and find the first row and column with the most 1s.
Input:
4
0 0 1 1
0 0 1 1
1 1 0 1
1 0 1 0
Where,
- First line of represents n, the number of rows and columns.
- Second line contains array elements of the 1st row and so on.
Output:
0 0 1 1
0 0 1 1
1 1 0 1
1 0 1 0
2
2
where,
- There must be single space between 2 numbers in the row.
- There should not be any space after the last number in the row. e.g. in the last row, there should not be any space after number 0.
- The first number bellow the matrix is the index of the first row with the most 1s and the second number is the index of the first column with the most 1s.
- There should not be any space after the second number (the index of the first column with the most 1s).
Assume that,
- Row and column values are integers within the range [1 to 100].
- 2D Array elements are within the range [0 to 1].
Expert Solution

arrow_forward
Introduction
Though main is itself a function, as it was specified i used an extra function and if you want all the implementation in main you can simply write all the statements inside houseKeeping function in main
Trending nowThis is a popular solution!
Step by stepSolved in 3 steps with 1 images

Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Write a program in c that create a 5-by-6 array. All elements in the array are random integer numbers between 1 and 100. Then, calculate the mean values of each column, and also find the minimums and maximums of each column. Print out the array, mean values, minimums,arrow_forwardJAVAarrow_forward: A monochrome screen is stored as a single array of bytes, allowing eight consecutivepixels to be stored in one byte. The screen has width w, where w is divisible by 8 (that is, no byte willbe split across rows). The height of the screen, of course, can be derived from the length of the arrayand the width. Implement a function that draws a horizontal line from (xl, y) to (x2, y).The method signature should look something like:drawLine(byte[] screen, int width, int xl, int x2, int y)arrow_forward
- Write a program in C that create a 3-by-5 array. All elements in the array are random integer numbers between 1 and 100. Then, put all elements of the two-dimensional array into a one-dimensional array. Finally, calculate the mean value and the median value of 1-D array. Print out the 2-D array, original 1-D array, sorted 1-D array, and the mean value and the median value of 1-D array.arrow_forwardin java Create two arrays with same length n: - Array A with integer numbers that user will insert- Array B with random numbers from 0 to 100.- Find sum of both arrays,- Find maximum values of both array and compare them: .if maximum of 1 st is lower then maximum of 2nd array: print sums of both arrays.if maximum of 1st is greater then maximum of 2nd array print 2nd array (use println)otherwise print first array in reverse.arrow_forward4. Given an integer array of size 10, write a Java program to prompt the user to enter an integer value num and in the output print all numbers in the array greater than num. If no such number is present then print the message "No Results Found." in the output. Given Array: {12,67,45,89,94,56,78, 34, 47, 63}arrow_forward
- Write a program in java using two dimensional arrays. You should prompt the user toenter the number of rows and columns for your matrix. You should then prompt the userto enter values for each element of the matrix. Once the user has provided all the values for matrix, you should print the matrix and transpose of that matrix. A transpose of a matrix converts rows to columns and columns to rows.Example:Output: This program transposes a matrix.Output: Please enter the number of rows:User enters 2Output: Please enter the number of columns:User enters 3Enter value for row[0] column[0]: 9Enter value for row[0] column[1]: 1Enter value for row[0] column[2]: 2Enter value for row[1] column[0]: 72Enter value for row[1] column[1]: 3Enter value for row[1] column[2]: 6The matrix you entered is:9 1 272 3 6The transpose of this matrix has 3 rows and 2 columns and the transpose is:9 721 32 6arrow_forwardWrite the following Java code: Create an array of size 10 with elements entered by the user. Print the Array Switch the first and last elements of the array. Shift all elements by one to the right, and move the last element into the first position. Replace all even numbers with 0.arrow_forwardThe purpose is to write a program with 2D arrays that will display Knight's Tour. Knight's Tour is a fascinating problem that is done on an electronic chessboard with a knight. Starting at any location on the chessboard, a knight proceeds to move on the board in such a manner that all positions on the chessboard are visited, once and once only. The knight may only move according to the rules of chess playing. The matrixes below show a sequence of knight moves that starts from the top-left corner. In most cases, the knight is locked in place and can go no farther. Note: there are only 3 legal knight moves from the 44 locations and they have already been visited. 01 60 39 34 31 18 09 6438 35 32 61 10 63 30 1759 02 37 40 33 28 19 0836 49 42 27 62 11 16 2943 58 03 50 41 24 07 2048 51 46 55 26 21 12 1557 44 53 04 23 14 25 0652 47 56 45 54 05 22 13 01 22 39 20 03 18 09 1600 37 02 23 08 15 04 1335 40 21 38 19 12 17 1000 00 36 41 24 07 14 0500 34 00 32 00 28 11 2600 00 00 00 42 25 06 2900…arrow_forward
- The purpose is to write a program with 2D arrays that will display Knight's Tour. Knight's Tour is a fascinating problem that is done on an electronic chessboard with a knight. Starting at any location on the chessboard, a knight proceeds to move on the board in such a manner that all positions on the chessboard are visited, once and once only. The knight may only move according to the rules of chess playing. The matrixes below show a sequence of knight moves that starts from the top-left corner. In most cases, the knight is locked in place and can go no farther. Note: there are only 3 legal knight moves from the 44 locations and they have already been visited. 01 60 39 34 31 18 09 6438 35 32 61 10 63 30 1759 02 37 40 33 28 19 0836 49 42 27 62 11 16 2943 58 03 50 41 24 07 2048 51 46 55 26 21 12 1557 44 53 04 23 14 25 0652 47 56 45 54 05 22 13 01 22 39 20 03 18 09 1600 37 02 23 08 15 04 1335 40 21 38 19 12 17 1000 00 36 41 24 07 14 0500 34 00 32 00 28 11 2600 00 00 00 42 25 06 2900…arrow_forwardWrite a program to do the following task: Declare a two-dimensional array with 3 rows and 4 columns and fill it with random integers in the range of 0 to 100. Then create a one-dimensional array of doubles whose elements are the average values of each of the rows of the two-dimensional array. Output the two-dimensional array with the average of each row displayed at the end of each line.using java programming different methodarrow_forwardIN JAVA Given an array, write a program to print the array elements one by one in a new line. If the array element is divisible by 4, print Four. If it is divisible by 6, print Six. If it is divisible by both 4 and 6, print Four Six. Use the following input array Int[] input_array = {2, 5, 10, 8, 18, 24, 3, 48, 30, 9, 12} Output should be 2 5 10 Four Six Four Six 3 Four Six Six 9 Four Sixarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education

Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON

Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education