#include int main() { int x,sum; sum=0; for(x=0;x<=500;x+=10){ } sum=sum+x; printf("%d",sum); return 0;

#include <stdio.h> struct Single {     int num; };   void printSingle(int f) {     int binaryNum[33];     int i = 0;     while(f>0)     {         binaryNum[i] = f % 2;         f = f/2;         i++;     }     for (int j=i-1; j>= 0; j--)     {         printf("%d",binaryNum[j]);     } }   int main() {     struct Single single;     single.num = 33;     printf("Number: %d\n",single.num);     printSingle(single.num);     return 0; }

void fun(int i) { do { if (i % 2 != 0) cout =1); cout << endl; } int main() { int i = 1; while (i <= 8) { fun(i); it; } cout <

int main(int argc, char **argv) { float *rainfall; float rain_today; // rainfall has been dynamically allocated space for a floating point number. // Both rainfall and rain today have been initialized in hidden code. // Assign the amount in rain_today to the space rainfall points to. return 0; }

c++complete and change #include <iostream>using namespace std; int sumbyrow(int* m, int ncol, int row){int total = 0;for (int i = 0 i < ncol; i++) {total += m[row * ncol + i];}return total; } int sumBCol(int* m, int nrow, int ncol, int col){int total = 0;for (int j = 0; < j nrow; j++) {total += m[j * ncol + col]; }return total;}int sumBYLeftDiag(int* m, int ncol){int total = 0;for (int i = 0, j = ncol - 1; i < ncol && j >= 0; i++, j--) {total += m[i * ncol + j];}return total;}bool hasDuplicates(int* m, int row) {int flatArray[row * row];int k = 0for (int i = 0; i < row; i++) {for (int j = 0; j < row; j++) {flatArray[k++] = m[i * row + j]; }}for (int i = 0; i < (row * row); i++) {for (int j = i + 1; j < (row * row); j++) {if (flatArray[i] == flatArray[j])return true; }}return flase;} bool isMagicMatrix(int* m, int nrow, int ncol) { if (hasDuplicate(m, nrow), int ncol{return false; }if (sumByleftDiag(m, nrow) != sumByRightDiag(m, nrow)) {return…

QUESTION 22 Multiple Choice: Which java statement correctly processes an array variable ? O while (x < arr.length){ int value = arr[x]; x++; } %3D for(int x = 0; x < arr.length; x++){ int value = arr[x]; } %3D process(arr); do { int value = arr[x]; x++; } %3D while (x < arr.length); QUESTION 23 True or False: An array is a basic data type. O True False

#include <stdio.h>#include <limits.h>  int findMissingUtil(int arr[], int low, int high, int diff){  if (high <= low)return INT_MAX;    int mid = low + (high - low)/2;    if (arr[mid+1] - arr[mid] != diff)return (arr[mid] + diff);  if (mid > 0 && arr[mid] - arr[mid-1] != diff)return (arr[mid-1] + diff);    if (arr[mid] == arr[0] + mid*diff)return findMissingUtil(arr, mid+1, high, diff);  return findMissingUtil(arr, low, mid-1, diff);}   int findMissing(int arr[], int n){int diff = (arr[n-1] - arr[0])/n;    return findMissingUtil(arr, 0, n-1,diff);}   int main(){int arr[] = {120001, 120013, 120025, 120037, 120049, 120061,120085,120097,120109,120121};int n = sizeof(arr)/sizeof(arr[0]);printf("The missing element is %d", findMissing(arr, n));return 0;} ______________________________________________________________________________ Convert the code above into Pseudocode