What is the output of the following code ? #include void foo(int *ptr, int a[]){ *ptr=*ptr a[0]; } int main() { } int arr[]={1,3,5,7,9); int *q, *p; q=arr; p=&arr[2]; foo (p,&arr [3]); printf("%d %d %d", *q+1, *(p+1), *(q+2));

What does the below do? #include <stdio.h>#include <string.h>int main(void) {   char fnameArray[50] [50];    int i;   for (i = 0; i <=5; i++)   {                scanf("%s", fnameArray[i] );   }      for (i = 0; i <=5; i++)   {                printf("\n%s\n", fnameArray[i] );   }   return 0;}

What does the following code output? tinclude void pointerUpd (double* upt); int main() { double* pp; double b[6] = { 1.01, 2.02, 3.03, 4.04, 5.05 }; PP = 6 (b[4]); double *dp = pp; dp++; std::cout <« *dp < std::endl; std::cout « *pPp « std::endl; pointerUpd (pp) ; std::cout « *dp « std::endl; std::cout <« *pp << std::endl; void pointerUpd (double* upt) { * (++upt) = 6.06; upt = new double; *upt = 1.01;

Kindly fix the code:

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]);        }…

C programming fill in the following code  #include "graph.h" #include <stdio.h>#include <stdlib.h> /* initialise an empty graph *//* return pointer to initialised graph */Graph *init_graph(void){} /* release memory for graph */void free_graph(Graph *graph){} /* initialise a vertex *//* return pointer to initialised vertex */Vertex *init_vertex(int id){} /* release memory for initialised vertex */void free_vertex(Vertex *vertex){} /* initialise an edge. *//* return pointer to initialised edge. */Edge *init_edge(void){} /* release memory for initialised edge. */void free_edge(Edge *edge){} /* remove all edges from vertex with id from to vertex with id to from graph. */void remove_edge(Graph *graph, int from, int to){} /* remove all edges from vertex with specified id. */void remove_edges(Graph *graph, int id){} /* output all vertices and edges in graph. *//* each vertex in the graphs should be printed on a new line *//* each vertex should be printed in the following format:…