In-Lab Task 2: Testing if a mathematical expression is balanced or not. Write a function that checks whether parentheses in a mathematical expression are balanced or not. The input to the function will be a pointer to a null-terminated array of characters (string). Assume that all the operands in the expression are single-digit numbers. You should call this function from ‘main’ function to demonstrate that it works as intended. The function should return 0 if the expression is balanced, and the index of mismatch otherwise. The function prototype is given below: int isBalanced(char * ptr_array);
In-lab Task 1: Reversing an array of numbers. You have to write a function to reverse the order of integers in an array. Call this function from your main function to demonstrate that this function successfully reverses (in-place) the contents of the input array. You should declare and use a stack within this function. The functions for stack implementation are already given to you. The prototype for the function is given below; void reverse_num_array(int * num_array);
Write a function solution that given a three digit integer N and Integer K, returns the maximum possible three digit value that can be obtained by performing at most K increases by 1 of any digit in N
Write a C code of O(n) order to remove all the odd numbers from the array. Example: the
array contains 10, 2, 3, 7, 8, 6, 11. The output should be 10, 2, 8, and 6
Write a C code to add two polynomials having two numbers of unknown variables.
Write a C code to delete all prime numbers present in a doubly linked list. For example, if
input: 5->6->11->4->12->16, then output 6->4->12->16.