Complete the missing code at " " to implement the function with the variables GPIO_PORT_P1, GPIO_PIN0, GPIO_PIN1, INT_PORT1. Int main(void) { ...... GPIO_setAsOutputPin(GPIO_PORT_P1, ); GPIO_setAsInputPinWithPullUpResistor( , ); GPIO_clearInterruptFlag(GPIO_PORT_P1, GPIO_PIN1); GPIO_enableInterupt(GPIO_PORT_P1, ); Interrupt_enableInterrupt( ); ...... } Void PORT1_IRQHandler(void) { Unit32_t status; Status = GPIO_getEnabledInterruptStatus(GPIO_PORT_P1); GPIO_clearInterruptFlag(GPIO_PORT_P1, status); If (status & ) { GPIO_toggleOutputOnPin(GPIO_PORT_P1, ); } } please fill them all in if you can thank you. The picture is what its supposed too look like.

Problem 1: Given the API rand7 () that generates a uniform random integer in the range [1, 7], write a function rand10 () that generates a uniform random integer in the range [1, 10]. You can only call the API rand7 (), and you shouldn't call any other API. Please do not use a language's built-in random API.

Write a C++ program to declare an array A={3, -7, 12, -4, 5, -2} and pass it to a void-type function findMaxMinAvg (array) that prints out the maximum, minimum and average values in the array. Your answer

In electronics, a digital-to-analog converter (DAC, D/A, or D-to-A) is a system that converts a binary representation of that signal into an analog output. An 8 bit converter can represent a maximum of 2^8 different values, with each successive value differing by 1/256 of the full scale value, this becomes the system resolution. Create a function that takes a decimal number representation of a signal and returns the analog voltage level that would be created by a DAC if it were given the same number in binary. While value range is 0-1023, reference range is 0-5.00 volts.Value and reference is directly proportional. This DAC has 10 bits of resolution and the DAC reference is set at 5.00 volts. Examples V_DAC (0) V_DAC (1023) - 5 V_DAC (400) → 1.96

Please code in C.

4. Given the following recursive definitionseq(1) = seq(2) = 1seq(n) = 2 ∗ seq(n − 1) + 3 ∗ seq(n − 2)implement the corresponding program and use it to calculate seq(5).How many invocations are made to the function seq when calculating seq(5)?

Please help me implement this C++ function that is supposed to partition the array a into smaller than pivot and others. // f is the beginning of the section to be partitioned // r is the end of the section to be partitioned // return the first slot of the Large section int partition(int a[], int f, int r) { int pivot = a[f]; // pivot is the first element int small = f; // small pointer from the left int large = r; // large pointer from the right while (small <= large) //until they cross { // loop for finding out-of-place pairs and swap them // until the small and large cross // you will be checking a[small] and a[large] against pivot // if both are bad (and not crossed yet), swap and then move // if a[small] is OK, move small // if a[large] is OK, move large // TODO: ** } //end of while // return the partition point where // those smaller than pivot are before what is returned // there is a special cases (small is at the beginning) // and a regular case // TODO: }

//program developed by Ismail Mohamed - Date 9/14/24#include <stdio.h>#include <stdlib.h>#define SIZE 5 //Function prototype declarationsvoid udfDisplayArray(int intArr[], int size);//function prototype int main() { int intArray[SIZE] = {0};//initially all elements int i, n, randN, max, sum = 0; double average;//system("cls");//system call to the operating systemprintf("program enhanced by ismail Mohamed. Date: 9/14/24\n");printf("Enter random number maximum value > 0: "); //INPUTscanf("%d", &max);if (max >0) { //PROCESSING for(i=0; i < SIZE; ++i) { randN = rand() % (max+1); intArray[i] = randN; sum += intArray[i]; }//for //udfDisplayArray(intArray, SIZE); //Function call output average = (double) sum / SIZE;}//ifprintf("Average = %.21f", average); //OUTPUTprintf("\n End of program\n"); return 0;}//main add a while loop of 10>100>1000

In C++, Can you please look at the code below and revise/fix so it will work according to instructions and criteria. Instruction 1) Write a function that copies a 1D array to a 2D array. The function’s prototype is bool copy1DTo2D(int d1[], int size, int d2[][NCOLS], int nrows); where size > 0 NCOLS > 0 nrows > 0 NCOLS is a global constant size = NCOLS * nrows the function returns true if the parameters and constants satisfy these conditions and false otherwise. the relation between 1d array indices and 2d array indices is 2d row index = 1d array index / NCOLS 2d column index = 1d array index modulus operator NCOLS 2) Write a function that copies a 2D array to a 1D array. The function’s prototype is bool copy2DTo1D(int d2[][NCOLS, int nrows, int d1[], int size); where size > 0 NCOLS > 0 nrows > 0 NCOLS is a global constant the function return true if the parameters and constants satisfy these conditions and false otherwise. the relation between 1d array indices and...

Implement a function ingredients in Python that takes a recipe and returns a dictionary of the ingredients needed. Details: accepts one multiline str argument containing a recipe each line of the recipe is either an instruction line or an ingredient line. The ingredient lines contain the character ':' , the instruction lines do not. instruction lines should be ignored ingredient lines will be structured like 'active dry yeast: 10g' . This breaks down as: an ingredient, e.g., 'active dry yeast' (can be multiple words) the character ':' followed by a space the quantity, e.g., '10g' , which will always be an integer (number of digits can vary) followed always by the letter 'g' ( for grams) note- that a particular ingredient may appear on more than one line, see sourdoughStarter below The function ingredients should output a dictionary: keys are ingredients each value is an int specifying the number grams of that ingredient used in the recipe if an ingredient appears on more than...

Write a function lis_rec(arr) that outputs the length of the longest increasing sequence and the actual longest increasing sequence. This function should use divide and conquer strategy to the solve the problem, by using an auxiliary function that is recursive. For example, one possibility is to define a recursive function, lis_rec(arr, i, prev), that takes the array arr, an index i, and the previous element index prev of LIS (which is part of the array arr before index i), and returns the length of the LIS that can be obtained by considering the subarray arr[i:]. Write a dynamic programming version ofthe function, lis_dp(arr), that outputs the length of the longest increasing sequence and the actual longest increasing sequence by using a table to store the results of subproblems in a bottom-up manner. Test the performance of the two functions on arrays of length n = 100, 500, 1000, 5000, 10000. Compare the running times and memory usage of the two functions.

Write a program to solve quadratic equations for real roots. No need to use imaginary numbers. ax^2 +bx +c= 0 Requirements:-Define an array of type double with size 3 in main() to store the 3 coefficients.-Read the 3 coefficients from user input.-Create the function prototype and definition for the function getRootCount(discriminant, coefficients) Parameters: discriminant: output to be calculated by the function coefficients: input array of 3 coefficients Return: number of roots: 0, 1, or 2 -Create the function prototype and definition for a function to determine the numbers of roots: getRootCount(discriminant, coefficients); Parameters: discriminant: output value to be calculated by the function (reference parameter) coefficients: input array of 3 coefficients Return: number of roots: 0, 1, or 2 (int) -Create the function prototype and definition for a function to solve equations and get the root(s): solveEquation(discriminant,...

Write a function using Java Function Name: winInRowParameters: board: 2D integer array, row: integer, piece: integerReturn: booleanAssume board is valid 2D int array, row is valid index in the board, piece is X==1/O==2Look at indicated row at given index in board. If that row has at least 3 consecutive entries withgiven type of piece (X/O) (3 in a row XXX, OOO), then return true, otherwise false.