The mechanics described in this exercise can be used to implement a game lights out. For basic description of the game see https://en.wikipedia.org/wiki/ Lights Out_(game). 1. Create a function flip val flip : bool array array -> int -> int -> bool array array - that given a bool matrix and two integers i, j. it negates the values (true¬false, false-→true) at location i, j in the matrix, as well negating the values on the (up to) 4 horizontally/vertically adjacent elements. 2. Create a function print.matrix val print_matrix : bool array array -> unit - that given a bool matrix, it prints it on screen (true →"T", false→"F"). 'You may use a free service accessible on https://try.ocamlpro.com/.

The mechanics described in this exercise can be used to implement a game lights out. For basic description of the game see https://en.wikipedia.org/wiki/ Lights Out_(game). 1. Create a function flip val flip : bool array array -> int -> int -> bool array array - that given a bool matrix and two integers i, j. it negates the values (true¬false, false-→true) at location i, j in the matrix, as well negating the values on the (up to) 4 horizontally/vertically adjacent elements. 2. Create a function print.matrix val print_matrix : bool array array -> unit - that given a bool matrix, it prints it on screen (true →"T", false→"F"). 'You may use a free service accessible on https://try.ocamlpro.com/.

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

Implement a function GetMinimumCutSegments(int[] arr, int k) that takes in an array arr of positive integers and an integer k, and returns the minimum number of contiguous segments of the array that must be concatenated to form an array of size k. The function should return -1 if it is not possible to create an array of size k by concatenating contiguous segments of the input array. Example: Input: [1, 2, 3, 4], 6 Output: 2 Explanation: The minimum number of contiguous segments that must be concatenated to form an array of size 6 is 2. The two segments that can be concatenated are [1, 2] and [3, 4]. Input: [1, 2, 3, 4], 7 Output: -1 Explanation: It is not possible to create an array of size 7 by concatenating contiguous segments of the input array. Constraints: The input array arr will have at most length 100. The integer k will be at least 1 and at most 10^6. Can you write a C# function that solves this problem? public int GetMinimumCutSegments(int[] arr, int k) { // Your code…
Using recursion, write a Python function def before(k,A) which takes an integer k and an array A of integers as inputs and returns a new array consisting of all the integers in A which come before the last occurrence of k in A, in the same order they are in A. For example, if A is [1,2,3,6,7,2,3,4] then before(3,A) will return [1,2,3,6,7,2]. If k does not occur in A, the function should return None.
Write the following three functions: a) The function gets an array A of length n of ints, and a boolean predicate pred. It returns the smallest index i such that pred(A[i])==true.If no such element is not found, the function returns -1.int find(int* A, int n, bool (*pred)(int)); b) The function gets an array A of length n of ints, and a function f. It applies f to each element of A.void map(int* A, int n, int (*f)(int)); c) The function gets an array A of length n of ints, and a function f. The function f gets 2 ints and works as follows: Start with accumulator = A[0] For i=1...length-1 compute accumulator=f(accumulator, A[i]) Return accumulator For example, if f computes the sum of the two inputs, then reduce() will compute the sum of the entire array.int reduce(int* A, int n, int (*f)(int,int));
Write a program to overload the function call operator ( ) so as to allow the more common form of double-array subscripting. Therefore, instead of saying: chessBoard[row][column] for an array of objects, overload the function call operator to allow the alternate form: chessBoard(row, column) A sample output of your program should look like follows: The value of each array element is the product of the row and column values. Using the class definition given in the myClassOperator.h header file below, implement the class member functions and driver code in separate files.
In C, implement the function that gets an array of ints and its length, and returns the maximum of the absolute values. int max_abs (const int* arr, int len); For example: On input [1, -3, 7, 4] the function should return 7. On input [2, -3, 2, -4] the function should return 4. On input [0, -3, 2] the function should return 3.
Write a Python function def isSubArray(A,B) which takes two arrays and returns True if the first array is a (contiguous) subarray of the second array, otherwise it returns False. You may solve this problem using recursion or iteration or a mixture of recursion and iteration. For an array to be a subarray of another, it must occur entirely within the other one without other elements in between. For example: [31,7,25] is a subarray of [10,20,26,31,7,25,40,9] [26,31,25,40] is not a subarray of [10,20,26,31,7,25,40,9] A good way of solving this problem is to make use of an auxiliary function that takes two arrays and returns True if the contents of the first array occur at the front of the second array, otherwise it returns False. Then, A is a subarray of B if it occurs at the front of B, or at the front of B[1:], or at the front of B[2:], etc. Note you should not use A == B for arrays.
Implement the vacuum cleaning agent function in Python/Java for the scenario described below: Consider two-dimensional Boolean array of size m x n (m and n can each be equal to 4) where m is the number of rows, and n is the number of columns. Obtain numerical positive integer values for m and n as inputs from the user. Generate random numbers and scale them down to either a “0” or a “1” according to whether they represent “Clean” or “Dirty”, respectively. After filling the array with 0s or 1s, start at some random array position indicating the initial position of the vacuum cleaner. First check if at that current position, there is the presence of a “Dirt” or not determined by whether 0 or 1 is filled in at that initial position of the vacuum cleaner. If there is a “Dirt”, clean it, and if there is no “Dirt” do a No-operation. After this is done, generate random numbers modulo 4 to obtain random numbers 0, 1, 2, 3 indicating whether to take a left, right, up or down correspondingly. If…
Implement the following function, without using any data structure. /* Given two vectors of chars, check if the two vectors are permutations of each other, i.e., they contains same values, in same or different order.e.g., V1=[‘a’,’b’,’a’] and V2=[‘b’,’a’,’a’] stores same multi-set of data points: i.e., both contains two ‘a’, and one ‘b’. e.g., V3=[‘a’,’c’,’t’,’a’] and V4=[‘a’,’c’,’t’] are not same multi-set. V3 contains two ‘a’s, while V4 has only one ‘a’. Note: when considering multiset, the number of occurrences matters. @param list1, list2: two vectors of chars @pre: list1, list2 have been initialized @post: return true if list1 and list2 stores same values (in same or different order); return false, if not. */  bool SameMultiSet (vector<char> list1, vector<char> list2)
Write simply python code for the following: Using a both a for (for within a for) and a while (while within a while) nested loop, read the dimensional array below: aList = [["Red","Blue","Green"],["Cup","Plate","Bowl"],["Large","Med","Small"]] and print out its contents in a matrix as follows: Red Blue GreenCup Plate BowlLarge Med Small
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 C++ program that asks the user to enter the number of students in the class followed their grades out of 100 using the keyboard. After this, the program prints the grades in reverse order. Use a dynamic array of doubles to store the entered grades. Modify the previous C++ program in question above such that it does not ask the user about the number of students, however, the program will terminate grades input when a negative grade is entered at the keyboard. Use a vector of doubles instead of a dynamic array of doubles.
Write a function that gets a 2-d array of ints arr[height][width], and returns an array SUM of length height such that SUM[i] contains the sum of all values in the i’th row of the array. For example - On input {{ 1, 2, 3}, {4, 7, -2}, {9, 10, 11}, {1, 5, 4}}; the function returns { 6, 9, 30, 10} // returns array SUM with SUM[i] = sum in the i’th row int* sum_row(int height, int width, const int ar[height][width]); Test for the function: void test_q2() { intar[4][3] = {{1, 2, 3}, {4, 7,-2}, {9,10,12}, {1, 5, 4}}; int* m = sum_row(4,3, ar); intm0 = m[0]; intm1 = m[1]; intm2 = m[2]; intm3 = m[3]; free(m); // checking dynamic memory allocation if (m0==6 && m1==9 && m2==31 && m3==10) printf("Q2 ok\n"); else printf("Q2 ERROR\n"); }