so i keep getting some seg fault issue due to the realloc in my program. I'm reallocing an array of layer_t structs, which is in a function to add an empty cake layer that's being called by another function layer_t add_fresh_layer (cake_t *cake) ( (...) cake->layers= realloc(cake->layers, sizeof(layer_t) * cake->layer_height * 2); (...) }   int add_filling_layer (cake_t *cake){ for (int i = 0; i < cake->cake_height; i++) { layer_t *layer = &cake->layers[i]; (...) for (j = 0; layer->ingred[j] != NULL; j++) { char *ingredients = layer->ingred[j];] (...) for (k = 0; k < bake->layer_count; k++) { (...) } if (...) { (...) layer_t *filling = add_fresh_layer(bake); (...) } } }} I know that the realloc is causing the address to change while the pointer for cake->layers[i] remains the same. And i know the fix here is super simple, but I can't for the life of me remember what it is

The goal of this second exercise is to develop a better understanding of the Linuxinterprocess communication mechanisms. This would require you to write twoprograms P1 and P2. The first program P1 needs to generate an array of 50random strings (of characters) of fixed length each. P1 then sends a group offive consecutive elements of the array of strings to P2 along with the ID’s ofthe strings, where the ID is the index of the array corresponding to the string.The second program P2 needs to accept the received strings, and send backthe highest ID received back to P1 to acknowledge the strings received. Theprogram P2 simply prints the ID’s and the strings on the console. On receivingthe acknowledged packet, P1 sends the next five strings, with the string elementsstarting from the successor of the acknowledged ID. The above mechanism needs to be implemented FIFO and UNIX DOMAIN SOCKETS. Please note that you may NOT make assumptions about the reliability of the interprocess communication…

Write a function that gets an array of points and sorts the array using qsort(). Given two points a=(ax,ay) and b=(bx,by) we compare them as follows: 1) if (ax)2+(ay)2 < (bx)2+(by)2, then a should come before b in the sorted array. 2) if (ax)2+(ay)2 = (bx)2+(by)2, then we compare the points by the x coordinate. Remark: For a point a=(ax,ay) the quantity ((ax)2+(ay)2)½ is the distance of a from the (0,0). That is, we sort the points according to their distance to (0,0), and if for points at the same distance, then we sort them according to the first coordinate. You will need to implement the comparison function, and apply qsort() on the array with this comparison function. For example: - Input: [(3,2), (7,1), (1,1), (3,4), (5,0), (7,1)] - Expected output: [(1,1), (3,2), (3,4), (5,0), (7,1), (7,1) ] Explanation: (1,1) is first because 12+12=2 is the smallest (3,2) is next because 32+22 = 13 is the second smallest Both (3,4) and (5,0) have the same sum of squares, 25, but 3<5 so…

You are given the array-like data structure Listy, which does not have a size.method. It does, however, provide an elementAt I function that returns the element at index I in the array of elements.  0( 1) time. If I exceeds the data structure's boundaries, it returns -1. (As a result, the data  structure only works with positive numbers.) Given a Listy of sorted positive integer ,Determine the index at which an element x appears. If x happens more than once, you may return any index.

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.

I just need the method they are asking for Write a recursive function that takes a start index, array of integers, and a target sum. Your goal is to find whether a subset of the array of integers adds up to the target sum. The start index is initially 0.A target sum of 0 is true for any array. Examples: subsetSum(0, {2, 4, 8}, 10) -> true   public boolean subsetSum(int start, int[] nums, int target) {   }

In this question, we are going to write a Racket functionwordMaxIndex that calculates the maximum index of each word thatappears in an input word list. For example, if the input is’(time is long but life is short)Then one output can be((time 0) (long 2) (but 3) (life 4) (is 5) (short 6))The index of the first word in a word list is 0; the index for the secondword is 1; etc. Therefore, in the previous example, the maximum indexfor word “time” is 0; the maximum index for word “is” is 5, since “is”appears twice, at index 1 and 5. Note that you are not asked to sortthe words in the output. Therefore, the output is correct as long asthe indexes are correct.Do the following steps to implement the word-index program. In ourdiscussion, we call a word with an index a word-index pair, for example,(short 6) and (is 5) are word-index pairs. We call a list of word-index pairs a word-index list.(a) Write a function initialWIList that takes a list ofwords and creates a word-index list. The resulting…

A set of integers 0..MAX may be implemented using an array of boolean values. This particular implementation is called a bit-vector implementation of a Set. Since C doesn’t have the Boolean data type, then substitute TRUE with 1 and FALSE with 0, or define 1 and 0 as TRUE and FALSE, respectively.For example, if the integer 3 is an element of the set, then the array element indexed by 3 is TRUE. On the other hand, if 3 is not an element, then the array element indexed by 3 is FALSE. For example, if the integer 3 is an element of the set, then the array element indexed by 3 is TRUE. On the other hand, if 3 is not an element, then the array element indexed by 3 is FALSE.For example: if s = {3,4,6,8}, the array looks like this:   Implement a programmer-defined data type called BitSet to represent a set as follows:typedef int BitSet[MAX];Implement the following functions:void initialize(BitSet s); - set all array elements to FALSEvoid add(int elem,BitSet s);- set the item indexed by elem to…

Given the following function, what happens if a[] contains just one element that doesn't match val? int binarySearch(int a[], int first, int last, int val){    if (first > last) return -1;  int middle = (first + last) / 2;  if (a[middle] == val) return middle;  if (a[middle] < val) return binarySearch(a, middle+1, last, val);  else return binarySearch(a, first, middle-1, val);} Group of answer choices binarySearch never calls itself again and terminates (recursion never happens) binarySearch calls itself once then terminates (recursion happens once) binarySearch calls itself twice then terminates (recursion happens twice) binarySearch calls itself 3 times then terminates (recursion happens 3 times)

Can you help with with the following questions, regarding population genetics and the Wright Fisher model in python? 1. Go through the given WFtrajectory function and give a short explanation of what each line of code does. Pay attention to the variables in the function and explain what they contain. 2. Make a new version of the WFtrajectory function which does exactly the same thing except that instead of appending to a list it initialises a numpy vector with zeroes and fills the vector with a for loop instead of a while loop. Make a plot of the output from a few example trajectories.