Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Class Templates In addition to function templates, C++ also supports the method of class templates. By definition, a class template is a class definition that explains a fam
Write a recursive implementation of Euclid's algorithm for finding the greatest common divisor (GCD) of two integers. Descriptions of this algorithm are available in algebra books
i have an array of structs, and am trying to make a pointer that can point to a certain struct within the array
The zipped folder int_collection.zip (downloaded from Blackboard) contains an abstract class AbstractIntCollection and two interfaces: IntList and IntStack. The abstract class cont
You are to write a C++ program which will compute the gross pay, Social Security Tax, Income Tax and net pay for an employee. The program needs to prompt for and read the employ
This programming assignment is for use in the LINUX/UNIX environment!! Introduction: System administration often requires custom written programs and tools. One problem a s
program area under the curve y=f(x) between x=a & y=b, integrate y=f(x) between the limits of a & b Solution: #include float start_point, /* GLOBAL V
Is always the default constructor for Fred Fred::Fred()?
Luminous Jewels - The Polishing Game Byteland county is very famous for luminous jewels. Luminous jewels are used in making beautiful necklaces. A necklace consists of various lum
Consider text comprised of sentences and sentences comprised of words. Words in a sentence will be space delimited. Given a text and K strings, task is to find out the number valid
Board ColoringProblem DescriptionIn this problem you are given a board in which some of the elements are placed as shown in diagram below. Each element represents a color.Fill the other elements in the board, such that none of the adjacent elements (vertically, horizontally and diagonally) should be of the same color.Find out the minimum number of colors that should be used to fill the blank spaces in the board, so that the above condition is met.Color representation is -: 0, 1, 2, 3, 4, 5, 6, 7…………………….There is sample board: For Example:Given Board :The matrix representation of board is :[ _ 1 _ _ ][ 2 _ _ _ ][ _ _ 2 _ ][ 2 _ _ _ ]In the above example the blank space is represented by ''_'' .The minimum number of colors needed to fill the board in the example is 4.Instruction to work with Open PBT Client: Specify the work directory path in the ''Work Directory Path'' field. The path should correspond to your solution project directory. Download the support files by clicking the Get Dev Files. You will find the following three folders: bin src lib in your work directory. Code the solution in . java file inside the src folder All required files will be downloaded to your work directory. Creating additional files is strongly discouraged. Step 1:In your solution file: Implement your logic in public int color(char[][] board) in class BoardColoring . char[][] board : board is 2 dimensional matrix of order M X M where M = 4. You can create more methods but, do it in the same class.Step 2:In your solution keep in mind the following constraints. In this problem you have to write a program to find the minimum no of colors to fill a board where some of the elements of different color are already placed. Method color() will take 2 D board as a input. Method color() will return minimum no of colors which can fill the board with given condition. The board should be a 2-dimensional M X M matrix, where M =4 otherwise return 0 Fill the other elements in the board, such that none of the adjacent elements (vertically, horizontally and diagonally) should be of the same color. The Prototype of the method is:public int color(char[][] board).This method takes following arguments. board is 2 dimensional matrix of order M X M where M = 4. This method returns minimum no of color by which board can be filled.The constraints are: The board should be a 2-dimensional M X M matrix, where M =4 otherwise return 0 Fill the other elements in the board, such that none of the adjacent elements (vertically, horizontally and diagonally) should be of the same color. Example 1Input : { 2 0 _ 1 }{ _ 1 _ _ }{ _ 2 _ 0 }{ _ _ _ 1 }Output : 5Explanation:We need a minimum 5 different colors to complete the board.Example 2Input : { 2 0 _ 1 3}{ _ 1 _ _ 2}{ _ 2 _ 0 1}{ _ _ _ 1 2}{ _ _ _ _ 0}Output : 0Explanation:Size of the board is greater than 4X4.Example 3Input : { _ 0 }{ 1 _ }Output : 0Explanation:Size of the board is less than 4X4.For Java solutionsPackage Name : test.boardcoloringFile Name : BoardColoring.javaClass Name : BoardColoringMethod Names : public int color(char[][] board)
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +1-415-670-9521
Phone: +1-415-670-9521
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd