Videos
(Game: nine heads and tails) Nine coins are placed in a 3-by-3 matrix with some face up and some face down. You can represent the state of the coins using a 3-by-3 matrix with values 0 (heads) and 1 (tails). Here are some examples:
Each state can also be represented using a binary number. For example, the preceding matrices correspond to the numbers
000010000 101001100 110100001 101110100 100111110
There are a total of 512 possibilities, so you can use decimal numbers 0, 1, 2, 3, ... , and 511 to represent all states of the matrix. Write a
The user entered 7, which corresponds to 000000111. Since 0 stands for H and 1 for T, the output is correct.
Want to see the full answer?
Check out a sample textbook solution
Chapter 8 Solutions
Introduction to Java Programming and Data Structures, Comprehensive Version (11th Edition)
Additional Engineering Textbook Solutions
Starting Out with C++ from Control Structures to Objects (8th Edition)
Java How to Program, Early Objects (11th Edition) (Deitel: How to Program)
Starting out with Visual C# (4th Edition)
Starting Out with C++ from Control Structures to Objects (9th Edition)
Starting Out with Programming Logic and Design (4th Edition)
Starting Out with C++: Early Objects
- Language: C Pascal’s triangle is a triangular array, useful for calculating the binomial coefficients, n k , that are used in expanding binomials raised to powers, combinatorics and probability theory. 0 0 1 0 1 1 2 0 2 1 2 2 3 0 3 1 3 2 3 3 4 0 4 1 4 2 4 3 4 4 Evaluating the values of the binomial coefficients, you get the following pattern, 1 1 1 1 2 1 1 3 3 1 1 4 6 4 1 The number of the entries in each row is increased by one, as we move down. Each number in the triangle, is constructed by adding the number above it and to the left, with the number above it and to the right. The blank entries as treated as 0. Using the recursion, implement the function that computes the Pascal’s triangle. Prarrow_forwardThis does not appear to be the answer to this question; Cheese's position is randomly generated in a 5x5 grid. The initial positions are x,y. The position of Cheese is not specified as (3, 4)arrow_forwardJava Objective:Design and implement simple matrix manipulation techniques.Details:Your java program should use 2D arrays to implement simple matrix operations.Your program should do the following:• Read the number of rows and columns of a matrix M1 from the user. Use an input validation loop to make sure the values are greater than 0. • Read the elements of M1 in row major order• Print M1 to the console; make sure you format as a matirx• Repeat the previous steps for a second matrix M2• Create a matrix M3 that is the transpose of M1 and print it to the console• Check if M1 and M2 can be added (should have the same dimensions). If possible, add M1 and M2 and print the result to the console. Otherwise print an error message.• Multiply M1 and M2 if possible and print to the console. If the matrices cannot be multiplied, print an error message. Implementation requirements:• Use a helper method for reading a positive integer using an input validation loop.• Use a helper method for printing…arrow_forward
- ou have been provided with the 4-by-4 matrix attached on the picture: Write a Java application using NetBeans that reads the above 4-by-4 matrix and displays the sum of all its elements on the major diagonal. Output is as follows:(see attached output.arrow_forwardProblem 4: Magic Square Test A magic square of order n is an arrangement of n × n numbers, usually distinct integers, in a square, such that the n numbers in all rows, all columns, and both diagonals sum to the same constant. See all rows’, columns’ and diagonal’s sum is same. Write a main method where first you need to input n. Then input n*n integers and form a 2D matrix. Print “YES” if the matrix is magic square and print “NO” Otherwise. Sample input: 3 2 7 6 9 5 1 4 3 8 Output: YESarrow_forwardWrite application that prints matrix with rows and columns, number of rows and columns are input parameters (Have main method) Use DART programming languagearrow_forward
- 7. Object transformation problem: a. Write out the following 4x4 matrices and label each with the following names: TO: Translate along X-axis by 4 and along Y-axis by 3 R: Rotate about the z-axis around the origin by 45 degrees T1: Translate along X-axis by -4 and along Y-axis by -3 S: Scale along X-axis by a factor of 2 and along Y-axis by a factor of 4 (keep value along the Z-axis unchanged) b. Apply the transformation matrix TO to the point P=(7, 5, 7) to find the transformed point Q by multiply it out. c. Apply the transformation matrix R to the point P=(7, 5, 7) to find the transformed point Q by multiply it out. d. Suppose two transformations are to be performed in the sequence, first scale an object with S, and then translate the object with TO. Show the combined effect of these two transformations by multiplying out the two matrices.arrow_forward(Sum elements row by row) write a method that returns the sum of all the elements in a specified row in a matrix using the following header: public static double sumRow(double [][] m, int rowIndex) Write a test program that reads a 3-by-4 matrix and displays the sum of each row here is a sample run.arrow_forwardPython: You must make a rock paper scissors game Goal Ask the player if they pick rock paper or scissors ask for r, p, or s or 1, 2, or 3. Have the computer chose its move Compare the choices and decide who wins Print the results Sub-goals Let the player play again Keep a record of the score e.g. (Player: 3 / Computer: 6) Keep a record of the games played (2 dimensional array) Use a Functions for: Comparing player choices Error trap for choicearrow_forward
- Algorithm for Solving Easy Sudoku Puzzles: Pick an empty cell to begin. List the numbers (1 through 9) that the cell could still be, by eliminating all the numbers in this cell's 3x3 section, and all the numbers in this cell's row, and all the numbers in this cell's column. Repeat that process for every empty cell on the board. Hint: you will need a different kind of variable (not a matrix) to store these possibilities for each location. At the end of this process, the value of a few cells will be completely known, i.e., all other eight numbers have been eliminated as possibilities. So now you can go back and re-process all the unknown cells on the board with this new information. At the end of that re-processing, if there are any cells that are now completely known, that weren't completely known before, then you can re-process again. That re-processing can continue again and again until there are no longer any new completely known values. If the all of the values on the board are…arrow_forwardTHIS NEEDS TO BE DONE IN JAVA!!!!!! (TOTAL SALES) Use a two-dimensional array to solve the following problem: A company has four salespeople (1 to 4) who sell five different products (1 to 5). Once a day, each salesperson passes in a slip for each type of product sold. Each slip contains the following: The salesperson number The product number The total dollar value of that product sold that day Thus, each salesperson passes in between 0 and 5 sales slips per day. Assume that the information from all the slips for last month is available. Write an application that will read all this information for last month’s sales and summarize the total sales by salesperson and by product. All totals should be stored in the two-dimensional array sales. After processing all the information for last month, display the results in tabular format, with each column representing a salesperson and each row representing a particular product. Cross-total each row to get the total sales of each…arrow_forward(FYI: Pseudocode is required (Not any programming language) Design a pseudocode program that loads an array with the following 7 values. Add one more word (of your own choosing) for a total of 8 words. biffcomelyfezmottleperukebedraggledquisling Be sure to use lowercase, as shown above. This will make the processing easier. Ask the user to enter a word Search through this array until you find a match with the word the user entered. Once you find a match, output "Yes, that word is in the dictionary". If you get to the end of the array and do NOT find a match, output "No, that word is not in the dictionary". The program should work with any set of words in the arrays. If I were to change the words in the arrays, it should still work. If you need help, look at the search example in your textbook.arrow_forward
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education