2d Parity Check Program Code
A boolean matrix has the parity property when each row and each column has an even sum, i.e. contains an even number of bits which are set. Here's a 4 x 4 matrix which has the parity property:
1 0 1 0
0 0 0 0
1 1 1 1
0 1 0 1
The sums of the rows are 2, 0, 4 and 2. The sums of the columns are 2, 2, 2 and 2.
Your job is to write a program that reads in a matrix and checks if it has the parity property. If not, your program should check if the parity property can be established by changing only one bit. If this is not possible either, the matrix should be classified as corrupt.
The input file will contain one or more test cases. The first line of each test case contains one integer n (n<100), representing the size of the matrix. On the next n lines, there will be n integers per line. No other integers than 0 and 1 will occur in the matrix. Input will be terminated by a value of 0 for n.
For each matrix in the input file, print one line. If the matrix already has the parity property, print ``OK'. If the parity property can be established by changing one bit, print ``Change bit (i,j)' where i is the row and j the column of the bit to be changed. Otherwise, print ``Corrupt'.
2d Parity Check Program Compatibility
2d Parity Check Program Can
In this article, you will learn and get code to implement two dimensional (2D) array in C. Here are the list of programs on 2D array: Initialize and Print Two Dimensional Array. Receive Size and Elements from User and Print Two Dimensional Array. Note - A Two Dimensional (2D) array can be thought as of a matrix with rows and columns. In this Program to check Matrix is an Identity Matrix, We declared single Two dimensional arrays Multiplication of size of 10. 10. Below C Programming statements asks the User to enter the Matrix size (Number of rows and columns. For instance 2 Rows, 2 Columns = a 2 2 ) Next, we used for loop to iterate each item present in a 2 2 matrix. Parity: Parity of a number refers to whether it contains an odd or even number of 1-bits. The number has “odd parity”, if it contains odd number of 1-bits and is “even parity” if it contains even number of 1-bits. Main idea of the below solution is – Loop while n is not 0 and in loop unset one of the set bits and invert parity.