You are a movie theater manager. You are givena two-dimensional array with 6 rows and 6 columns - 36 elements with O value, that represent empty theater seats. All 36 tickets for session were sold, so you need to identify all of the seats with value 1. Write a program that replaces all O values in the given array by 1 and outputs the resulting matrix.

You are a movie theater manager. You are givena two-dimensional array with 6 rows and 6 columns - 36 elements with O value, that represent empty theater seats. All 36 tickets for session were sold, so you need to identify all of the seats with value 1. Write a program that replaces all O values in the given array by 1 and outputs the resulting matrix.

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 that generates a 6x6 two-dimensional matrix filled with 0s and 1s, displays the matrix, and checks to see if every row and every column has an even number of 1s.
Write a program that randomly fills in 0s and 1s into a 4x4 matrix, prints the matrix, and finds the rows and columns with the most 1s.
Write a program that creates a matrix 3 by 3 .create a array having 3 elements .the program should multiple the matrix with the given vector and print the resultant matrix in proper format.
write a program that can create 2 numpy arrays with the size of rows and columns that can be inputted. The contents of each matrix are random integer numbers from -10 to 10 (including -10 and 10). Then do the multiplication operation on the 2 matrices. Finally, find the highest and lowest values of the matrix multiplication result
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:
An n x n matrix that is filled with the numbers 1, 2, 3, ... n² is a magic square if the sum of the elements in each row, each column, and in the two diagonals is the same value. 1 14 15 4 12 7 6 9 8 11 10 5 13 2 3 16 Write a program that reads in 16 values from the keyboard and tests whether they form a magic square when put into a 4 x 4 table. You need to test two features: 1. Does each of the numbers 1, 2, 3, ... 16 occur in the user's input? 2. When the numbers are put into a square, are the sums of the rows, columns, and diagonals equal to each other? Sample output is below. This 4 x 4 is a magic square with the sum of each row, column, and diagonal is 34.
A scientist has developed a mathematical model for a physical process, and he wants to check how good is model is. To evaluate the correctness of his model, he wants to test the results of his model under certain parameters and compare them with experimental results. Write a program that first reads the number of tests (testCount) as an int followed by the results of each test according to the model as a double array (test Model) and finally the results of each test according to experiments as a double array (testExperiment). Then, the program should calculate the error of the model by evaluating the average of the squares of the differences between the model result and experimental result (see formula below) using a function. Error Input 1 testCount NOTE: Individual square of the difference between the model value and the experiment value calculations MUST be done in the function. Every other functionality MUST be done in the main function. NOTE: To calculate square of a number you…
Given two arrays A and B of equal size N, the task is to find a vector containing only those elements which belong to exactly one array - either A or B - but not both. That is, if some element x appears in both A and B it should not be included in the output vector. Complete the implementation of "getVector(vector<ll>A, vector<ll>B, int N)" function. Example: Input: 1 3 5 7 1 3 2 4 6 7 8 Output: 3 5 1 3 2 4 6 8 The driver codes are attached in the images below. DO NOT CHANGE THE PROVIDED DRIVER CODES AT ALL, LEAVE THEM EXACTLY THE SAME. ONLY ADD CODE TO THE "getVector(vector<ll>A, vector<ll>B, int N)" FUNCTION
Write a program that takes 20 elements of array from user at run time. Find maximum element of array and swap it with last element of array. Display before and after swappingarray.
Jeff loves to develop code for random scenarios. Today Jeff started playing with a couple of Arrays A and B, each of size N. Initially A is filled with zeros. Jeff filled B with random numbers. Jeff visits each index i (1 <= i <= N) in random order. When at i, he selects another random indexj such that j is greater or equal to i. He then increments A[i], A[i+1], A[i+2] ... A[j] by 1. Finally, if for any index i, A[i] is greater than B[i], he then throws away that array A. For a given B, calculate the number of different arrays A, that Jeff can end up with. Two arrays are called different if there exists an index where the arrays have different values. Help Jeff in creating a C++ code that prints a single line containing the required answer modulo 109 + 7. Sample Test Case: 1 3 111 Result: 2
Jeff loves to develop code for random scenarios. Today Jeff started playing with a couple of Arrays A and B, each of size N. Initially A is filled with zeros. Jeff filled B with random numbers. Jeff visits each index i (1 <= i <= N) in random order. When at i, he selects another random indexj such that j is greater or equal to i. He then increments A[i], A[i+1], A[i+2] ... Alj] by 1. Finally, if for any index i, A[i] is greater than B[1], he then throws away that array A. For a given B, calculate the number of different arrays A, that Jeff can end up with. Two arrays are called different if there exists an index where the arrays have different values. Help Jeff in creating a C++ code that prints a single line containing the required answer modulo 109 + 7. Sample Test Case: 1 111 Result: 2