Using the following program, how would you best code line 7 to prevent a buffer overflow? 1 int main(int argc, char *argv[]) { int valid = 0; char str1[8]; char str2[8]; next_tag(str1); 2 3 4 5 6 fgets(str2, sizeof(str2), stdin); if (strncmp(str1, str2, 8) == 0) valid = 1; printf("valid = %d", valid); 7 8 9 10 }

AHPA #11: Changing Grades *use c programming language  * Create a C function (switcher) that will receive a pointer to the finalExams array, using only pointers look for D scores and boost  them to C scores. (ouput should be same as picture) #include <stdio.h> void switcher() {  } int main(void) {    int finalExams[] = {90,82,65,79,67,82,94,64,88,78,92,61,96,83,74};    return 0;}

C++

#include<bits/stdc++.h> using namespace std; void bubbleSort(int arr[], int n) {     for (int i = 0; i < n - 1; i++) {         for (int j = 0; j < n - i - 1; j++) {             if (arr[j] > arr[j + 1]) {                 int temp = arr[j];                 arr[j] = arr[j + 1];                 arr[j + 1] = temp;             }         }     } } int binarySearch(int arr[], int l, int r, int x, int& comp) {     comp++;     if (r >= l) {         int mid = l + (r - l) / 2;         if (arr[mid] == x) {             return mid;         }         if (arr[mid] > x) {             return binarySearch(arr, l, mid - 1, x, comp);         }         return binarySearch(arr, mid + 1, r, x, comp);     }     return -1; } int main() {     int Num[8192];     srand(time(NULL));     for (int i = 0; i < 8192; i++) {         Num[i] = rand() % 10001;     }         clock_t starting_time = clock();     bubbleSort(Num, 8192);     clock_t ending_time = clock();     clock_t result =…

Suppose the following code: int a, b, c;char array[100];void f(int& val){char* arr = new char[100];for(int i = 0; i < val; ++i){arr[i]  = i*i;}}int main(){int myValue = 123;f(myValue);return 0;} Think about which section of process memory each part of this program would occupy during execution. Then, match items on the left with their storage locations on the right.

In C programming. How do I find the max and min values of the corressponding columns. #include <stdio.h>#include <math.h>#include <stdlib.h>#define NROWS 5#define NCOLS 5 int main(void){    int i,j, max, min, m, n;    float M[NROWS][NCOLS], Mt[NROWS][NCOLS];    char key_hit;        //Input the sizes    printf("ROW size(1-5) :   ");scanf("%d",&m);    printf("Column size(1-5): ");scanf("%d",&n);        //Size Check     while(m>NROWS || n>NCOLS)    {        printf("Please re-enter the sizes. \n");        printf("Row size(1-5)   :  ");scanf("%d", &m);        printf("Column size(1-5) : ");scanf("%d", &n);    }        //Input the Matrix Data     for(i=0; i<m; i++)        for(j=0; j<n; j++)        {           printf("M[%d][%d] = ", i,j);           scanf("%f", &M[i][j]);        }            //Print the Matrix Data     for(i=0; i<m; i++)    {        for(j=0; j<n; j++)        {            printf("%1.2f\t", M[i][j]);        }…