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

In file as c++ Using dynamic arrays, implement a polynomial class with polynomial addition,subtraction, and multiplication. Discussion: A variable in a polynomial does nothing but act as a placeholder forthe coefficients. Hence, the only interesting thing about polynomials is the arrayof coefficients and the corresponding exponent. Think about the polynomialx*x*x + x + 1Where is the term in x*x ? One simple way to implement the polynomial class is touse an array of doubles to store the coefficients. The index of the array is theexponent of the corresponding term. If a term is missing, then it simply has a zerocoefficient.There are techniques for representing polynomials of high degree with many missingterms. These use so-called sparse matrix techniques. Unless you already knowthese techniques, or learn very quickly, do not use these techniques.Provide a default constructor, a copy constructor, and a parameterized constructorthat enables an arbitrary polynomial to be constructed.Supply…

Suppose that an array is passed as a parameter. How does this differ from the usual use of a value parameter? When an array is passed as a parameter, it is like passed by reference. A new array will be created in the called function and any changes to the new array will pass back to the original array. When an array is passed as a parameter, it is passed by value. So any changes to the parameter do not affect the actual argument. When an array is passed as a parameter, changes to the array affect the actual argument. This is because the parameter is treated as a pointer that points to the first component of the array. This is different from a value parameter (where changes to the parameter do not affect the actual argument). When an array is passed as a value, changes to the array affect the actual argument. This is because the parameter is treated as a pointer that points to the first component of the array. This is different from a parameter (where changes to the parameter do not…

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…

in c++

use c++ by Using dynamic arrays, implement a polynomial class with polynomial addition,subtraction, and multiplication. Discussion: A variable in a polynomial does nothing but act as a placeholder forthe coefficients. Hence, the only interesting thing about polynomials is the arrayof coefficients and the corresponding exponent. Think about the polynomialx*x*x + x + 1Where is the term in x*x ? One simple way to implement the polynomial class is touse an array of doubles to store the coefficients. The index of the array is theexponent of the corresponding term. If a term is missing, then it simply has a zerocoefficient.There are techniques for representing polynomials of high degree with many missingterms. These use so-called sparse matrix techniques. Unless you already knowthese techniques, or learn very quickly, do not use these techniques.Provide a default constructor, a copy constructor, and a parameterized constructorthat enables an arbitrary polynomial to be constructed.Supply an…

in c++, use parallel arrays , and srand(time(NULL)) to randomize the two cards dealt at the start   Create a Blackjack (21) game. Your version of the game will imagine only a SINGLE suit of cards, so 13 unique cards, {2,3,4,5,6,7,8,9,10,J,Q,K,A}. Upon starting, you will be given two cards from the set, non-repeating. Your program MUST then tell you the odds of receiving a beneficial card (that would put your value at 21 or less), and the odds of receiving a detrimental card (that would put your value over 21). Recall that the J, Q, and K cards are worth ‘10’ points, the A card can be worth either ‘1’ or ‘11’ points, and the other cards are worth their numerical values.

Write a C++ program that declares and initializes an integer array of size 100 with randomintegers between 1 and 10 inclusive using initializeArray (from question 1) and counts the occurrence of eachnumber in the array and graphs the information in the form of a bar chart or histogram—each number isprinted, then a bar consisting of that many asterisks is printed beside the number.Here is a sample run of the program:Number       Value          Histogram1                  12                ************2                  5                  *****3                  3                   ***4                 16                 ****************5                 7                   *******6                 6                   ******7                 9                    ********8                 1                    *9                 15                  *************** 10                 10                **********

Analyze the ChatGPT output by answering the following questions. Data types Which data types would be accepted by the function count_crossings_and_nestings for the argument arcs? Would a set work? What does the function return? What data type is it? Run the example suggested by ChatGPT. Is the function count_crossings_and_nestings working as expected? Try computing nestings and crossings with the smallest examples {}, {(0,1)}, {(0,1),(2,3)}, {(0,3),(1,2)} and {(0,2),(1,3}. Does the output work?

Write a function mode (numlist) that takes a single argument numlist (a non-empty list of numbers), and returns the sorted list of numbers which appear with the highest frequency in numlist (i.e. the mode, except that we want to be able to deal with the possibility of there being multiple mode values, and hence use a list ... and sort the mode values while we are at it ... obviously). For example: >>> mode ([2, 0, 1, 0, 2]) [0, 2] >>> mode([5, 1, 1, 5, 1]) [1] >>> mode ([4.0]) [4.0]