Suppose we are given an n x n square grid, some of whose squares are colored black and the rest white. Describe and analyze an algorithm to determine whether tokens can be placed on the grid so that • every token is on a white square; • every row of the grid contains exactly one token; and • every column of the grid contains exactly one token. Your input is a two dimensional array IsWhite[][] of booleans, indicating which squares are white. Your output is a single boolean. For example, given the grid below as input, your algorithm should return T.

Suppose we are given an n x n square grid, some of whose squares are colored black and the rest white. Describe and analyze an algorithm to determine whether tokens can be placed on the grid so that • every token is on a white square; • every row of the grid contains exactly one token; and • every column of the grid contains exactly one token. Your input is a two dimensional array IsWhite[][] of booleans, indicating which squares are white. Your output is a single boolean. For example, given the grid below as input, your algorithm should return T.

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

You are to create a plot of years vs home sales in the town of "Ourtown". Assume the existence of two arrays, years and sales. For every entry in years, the corresponding entry in sales indicates how many houses were sold that year. Construct a Matlab plot to display a graph of sales vs years. Label the x-axis 'Year', the y-axis 'Sales', and title the complete plot 'Annual Sales'.
Given two arrays A and B of equal size N, the task is to find if given arrays are equal or not. Two arrays are said to be equal if both of them contain same set of elements, arrangements (or permutation) of elements may be different though.Note : If there are repetitions, then counts of repeated elements must also be same for two array to be equal. Example 1: Input: N = 5 A[] = {1,2,5,4,0} B[] = {2,4,5,0,1} Output: 1.
Write a small piece of pseudo-code for generating a histogram H[L] for an intensity image I[YDIM][XDIM], where L is the total level of intensities of the image, H is the histogram array, XDIM * YDIM are the size of the image, and I[i][j] is the intensity value of the pixel at location (i,j), with i = 1, …, YDIM, and j = 1,…, XDIM. You might choose to use a certain program language that you are familiar with to write the code. You don’t have to compile the code.
Given an array of integers, print a sum triangle from it such that the first level has all array elements. From then, at each level number of elements is one less than the previous level and elements at the level is be the Sum of consecutive two elements in the previous level. Input The single line of input contains an array of integers, each of it is separated by space Output Triangle form that has been created from the input array Sample Input1 12345 Sample Output1 48 20 28 8 12 16 3579 12345
Using Java, Dr. Choi has 5 students who took a midterm and final. 1.First, she wants to store their midterm and final results in two different 1-dimensional arrays and print each of them to a console. 2.She also wants to find average scores of the midterm and final using loops. 3.Second, she wants to store them in one 2-dimensional array and print it to the console. Each row has test scores of the midterm and final. 4.Modify the program above using a 2-dimensional array: Search the highest test score at midterm and lowest test score at final and print them: Pass an array to a method for finding highest score at midterm and lowest test score at final. There are two methods invoked in main () method. One is for finding the highest score and the other one is for finding the lowest score.
Write a program that generates a 6-by-6 two-dimensionalmatrix filled with 0s and 1s, displays the matrix, and checks if every row andevery column have an even number of 1s.
. 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:
Given an array that represents elements of geometric progression in order. One element is missing in the Progression, find the missing number. It may be assumed that one term is always missing and the missing term is not first or last of series. Take number of elements and the array as input. (Sample input: 2,4,8, 32, sample output missing value is 16)
You have an array containing the heights of n vertical lines drawn such that the two endpoints of the ith line are (i, 0) and (i, height[i]). Your task is to find the maximum volume of liquid that can hold by these lines. Program Specification: Language: Java Time Complexity: O(n) Space Complexity: 0(1)
Draw a rectangle to represent an array for 82 × 437 (your rectangle need not be to scale). Subdivide the rectangle in a natural way so that the parts of the rectangle correspond to the steps in the partial products algorithm. Indicate the correspondence between the parts of the rectangle and the steps in the algorithm.
Given an array A[] of size n. The task is to find the largest element in it. Example 1: Input: n = 5 A[] = {1, 8, 7, 56, 90} Output: 90 Explanation: The largest element of given array is 90.
Write a program that fills an integer array of size 1000 with random positive integers between 1 and 10.Assume that each element represents a different city and the integers stored in the array represent thenumber of golds in those cities. The program traverses over the array and collects the golds at each city,starting from a random position. When the program visits a certain city, all of the golds are collected,and the visited element of the array becomes 0 (no gold is left at that city.) The journey continues withthe rule given below. If the position at the nth step is denoted by pn, and the number of golds at the citypn is denoted by gn,??+1 = {| ((??−1 + ?? + ??) ???1000|, ????? 2 = 0| ((??−1 + ?? − ??) ???1000|, ????? 2 = 1.The program continues visiting cities until the last three visited city has no gold.The program, at each visit, should print out the following information:• The current city index (pn).• The previous city index (pn-1).• The number of golds at the current city…