Lab Practice

1. Program 1 :
   Write a function void ReadArray (int A[ ][COL], int num_row, int num_col) that reads a two dimensional array, COL - is the number of columns in array A. Write a function int even (int A[][COL], int num_rows, int num_cols) that finds and returns the amount of the even elements among the elements of the array A. Write a program that reads five two-dimensional arrays of size 3X4 (3 rows and 4 columns) each and find an array that has a maximal amount of the even elements. Use function even to count the amount of even elements in each array and use function ReadArray to read an input. Try to declare only one two-dimensional array and re-use this memory space 5 times by using loop structure.

2. Program 2 :
   Write a function void fillRandom(int A[ ][COL], int num_rows, int num_cols) that fills the array A with the random numbers between 0 and 4 (including 0 and 4). Write a program that performs the following:
   • Declares a two dimensional array of integers of size 3X4 (3 rows and 4 columns)
   • Fills the array with the random generated numbers 0, 1, 2, 3, and 4 using function fillRandom
   • Prints the random array using function void printArray(int A[ ][COL], int num_rows, int num_cols)
   • Calculates the amount of values that equal to 0, 1, 2, 3 and 4 and prints the result with an appropriate message.

3. Program 3:
   Write a function int numNonZero(int A[][COL], int num_rows, int num_cols, int i, int j) that finds and returns the amount of non-zero neighbours elements of the element (i, j) of the two-dimensional array A. Write a program that reads one two-dimensional array of size 3X4 and for prints the amount of non-zero neighbours for each location in the array.

4. Program 4 :
   Write a function void fillRandom(int A[ ][COL], int num_rows, int num_cols) that fills the array A with the random numbers between -3 and 3 (including -3 and 3). Write a function int numNonZero(int A[][COL], int num_rows, int num_cols) that finds and returns the amount of non-zero elements of the array A. Write a program that performs the following:
   • Declares TWO two-dimensional arrays of integers of size 4X4 each (4 rows and 4 columns)
   • Fills EACH array with the random generated numbers between -3 and 3 using function fillRandom
   • Prints EACH random array using function void printArray(int A[ ][COL], int num_rows, int num_cols)
   • Calculates the number of non-zero elements in each array and prints results with an appropriate message.
   • Finds array with the maximal amount of non-zero elements

5. Program 5 : Selection Sort:
   Write a program that sorts the array of integers using Selection Sort.
   Definition: Selection Sort works as follows: first find the Problem 4: Selection Sort:
   Write a program that sorts the array of integers using Selection Sort.
   Definition: Selection Sort works as follows: first find the smallest element in the array and exchange it with the element in the first position, then find the second smallest element and exchange it with the element in the second position, and continue in this way until the entire array is sorted. You would need to write the following functions:
   • int min(int A[], int left, int right) - finds and returns the position of the minimal element in sub-array of A between positions left and right
   • void SelectionSort(int A [], int size) - sorts the array A using Selection Sort algorithm
   • void ReadArray (int A [] , int size) - reads an array A
   • void WriteArray (int A [] , int size) - prints an array A

6. Problem 6: Write the following functions:
   • Function sum_divisor that accepts one integer parameter num and returns the sum of the PROPER divisors of the parameter num.
   • Function isabundant that accepts one integer parameter and returns 1 if the number is abundant and 0 otherwise. Definition: an abundant number or excessive number is a number for which the sum of PROPER divisors is larger than the number itself. Use functin sum_divisors that you wrote, to find the sum of proper divisors. Examples: 12 is abundant, since the sum of the proper divisors is 1+2+3+4+6=16 > 12 20 is abundant, since the sum of the proper divisors is 1+2+4+5+10=22 > 20 6 is NOT abundant, since the sum of proper divisors is 1+2+3 = 6 and it is NOT larger than 6 10 is not abundant, since the sum of proper divisors is 1 + 2 + 5 = 8 < 10
   • int array_abundant that has two parameters: array of integers and size of the array. The function returns the number of abundant numbers among array elements. Write main to test your program. You can also write functions make_array and print_array.

   Team Work

   Mini-Sudoku
   To solve a Mini-Sudoku puzzle, one must fill in a 4X4 grid with the integers from 1 to 4 in such a way that each integer appears once in each row, once in each column, and once in each 2X2 subgrid. (Normally Sudoku is played on a 9X9 grid). For example, the following would be a solution.
   1 2 3 4
   3 4 1 2
   2 1 4 3
   4 3 2 1

   Write a program which takes four rows of four integers as input. If the grid represents a legitimate solution, your program should print the words .Valid Solution.; otherwise, it should print one or more of the following, depending on which criteria fail:

   • Invalid row
   • Invalid column
   • Invalid subgrid
   Your program should display each reasons which is responsible for a failure on a separate line, but the same reason should not be given more than once. For example, it might print both 'Invalid row' and 'Invalid subgrid' if both of these reasons apply, but it should print 'Invalid row' only once, regardless of how many rows actually fail. You may assume the input consists only of integers from 1 to 4, and that there are exactly four rows, each with four integers.

   Use two dimensional array to solve this problem

   Here are some sample inputs, along with the corresponding output.
   Input
   1 2 3 4
   3 4 1 2
   2 1 4 3
   4 3 2 1
   Output: VALID

   Input
   1 2 3 4
   4 3 2 1
   1 2 3 4
   4 3 2 1
   Output: Invalid column

   Input
   2 2 2 2
   1 1 1 1
   3 3 3 3
   4 4 4 4
   Output: Invalid row, Invalid subgrid

   Input
   3 3 3 3
   3 3 3 3
   3 3 3 3
   3 3 3 3
   Output: Invalid row, Invalid column, Invalid subgrid