Find the Cyclomatic Complexity of the following code segment:int average (int[ ] value, int min, int max, int N) {int i, totalValid, sum, mean;i = totalValid = sum = 0;if (value[i] >= min && value[i] <= max){totalValid += 1; sum += value[i];if (totalValid > 0)mean = sum / totalValid;elsemean = -999;}i += 1;}return mean;N.B.N=2466, min = 6, max = 15124

Find the Cyclomatic Complexity of the following code segment: int average (int[ ] value, int min, int max, int N) { int i, totalValid, sum, mean; i = totalValid = sum = 0; while ( i < N || value[i] != -999 ) { if (value[i] >= min && value[i] <= max){ totalValid += 1; sum += value[i]; if (totalValid > 0) mean = sum / totalValid; else mean = -999; } i += 1; return mean; N.B. N=2466, min = 6, max = 15124 %3!

Find the Cyclomatic Complexity of the following code segment: int average (int[ ] value, int min, int max, int N) { int i, totalValid, sum, mean; i = totalValid = sum = 0; while ( i < N || value[i] != -999 ) { if (value[i] >= min && value[i] <= max){ totalValid += 1; sum += value[i]; if (totalValid > 0) mean = sum / totalValid; else mean = -999; } i += 1; return mean; N.B. N=2466, min = 6, max = 15124 %3!

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

11 - The code segment below has time complexity? for (int i=0; i
CFG: Example 1 • Draw the CFG for the following code: int f(int n){ } int m = n* n; if (n < 0) else return 0; return m;
int sum = 0; for (int i 0; i < 5; i++){ sum += i; } cout << sum;
in c programming
#include <bits/stdc++.h>using namespace std;#define numVl 3 struct thNde { thNde* parent; int mat[numVl][numVl]; int x, y; int cost; int level;}; int thPrntMtrx(int mat[numVl][numVl]) { for (int q = 0; q < numVl; q++) { for (int j = 0; j < numVl; j++) printf("%d ", mat[q][j]); printf("\n"); }} thNde* newNode(int mat[numVl][numVl], int x, int y, int newX, int newY, int level, thNde* parent) { thNde* node = new thNde; node->parent = parent; memcpy(node->mat, mat, sizeof node->mat); swap(node->mat[x][y], node->mat[newX][newY]); node->cost = INT_MAX; node->level = level; node->x = newX; node->y = newY; return node;} int row[] = { 1, 0, -1, 0 };int col[] = { 0, -1, 0, 1 }; int calculateCost(int starting[numVl][numVl], int resltng[numVl][numVl]) { int count = 0; for (int q = 0; q < numVl; q++) for (int j = 0; j < numVl; j++) if (starting[q][j] && starting[q][j] != resltng[q][j]) count++; return count;} int isSafe(int x, int y) {…
I need the answer quickly
correct this program for generating random number #include<iostream>using namespace std;int *generateRandom(int num);int main(){ int numb; int* number; cout<<"Enter the size of array"; cin>>number; cout<< time(0); number=generateRandom(numb); system("pause"); return 0;}int *generateRandom(int num){ // pointer dynamic array int *array = new int(number); for(int i=0; i<number; i++){ array[i]=rand()%100; } srand(time(0)); cout<<rand();}
Code: #include <bits/stdc++.h> using namespace std; void BUBBLE(int A[],int N){ for(int k=0;k<N-1;++k){ for(int ptr=0;ptr<N-k-1;++ptr){ if(A[ptr]>A[ptr+1]){ int temp = A[ptr]; A[ptr] = A[ptr+1]; A[ptr+1]=temp; } } }} //function to print the arrayvoid printArray(int arr[],int n){ int i; for(i=0;i<n;i++) cout<<arr[i]<<" "; cout<<endl;} //driver function to test the modulesint main(){ int arr[] ={15,17,5,3,25,66,14,7,59,100}; int n=sizeof(arr)/sizeof(arr[0]); cout<<"\nOriginal array: "; printArray(arr,n); cout<<"\n\nOutput of Bubble sort are shown below:\n"; BUBBLE(arr,n); printArray(arr, n); return 0;} Q: Remove the Function from the above code
Explain this c code in details. #include <stdio.h> int main() { int max_weight_truck, n; scanf("%d", &max_weight_truck); scanf("%d", &n); int weight_item[n]; int priority[n]; int p_sort[n]; int w_sort[n]; int a[n]; for(int i=0; i<n; i++) scanf("%d", &weight_item[i]); for(int i=0; i<n; i++) scanf("%d", &priority[i]); //sorting priority array for(int i=0; i<n; i++) p_sort[i]= priority[i]; int temp=0; for (int i = 0; i < n; i++) { for (int j = i+1; j < n; j++) { if(p_sort[i] < p_sort[j]) { temp = p_sort[i]; p_sort[i] = p_sort[j]; p_sort[j] = temp; } } } for(int i=0; i<n; i++) a[i]= 0; for(int i=0; i<n; i++) { int index; for(int j=0; i<n; j++) { if(p_sort[i]== priority[j] && a[j]==0) { index= j; break; } } w_sort[i]= weight_item[index]; a[index]=1; } int s=0, i=0,j=0,truck=5, l=0; int o_item[truck], unused_space[truck]; // initializing arrays for(i=0; i<truck; i++) { o_item[i]= 0; unused_space[i]= 0; } i=0; while(truck>0)…
refer to the statment below:
İN C LANGUAGE Typedef struct Complex { Double a; Double b; } COMP_t, *COMP; write a function which finds and returns the position of the complex number whose absolute value is maximum in a two dimensional array of complex numbers.Absolute value of z=a+bi is |z|=(a^2+b^2)^1/2
Question 5: 2.1 Sum Problem View Past Answers Given a positive number n, the sum of all digits is obtained by adding the digit one-by-one. For example, the sum of 52634 is 5+ 2 +6 +3 + 4 = 20. Write a recursive and iterative function sum (n) to compute the sum of all the digits in n. You may assume that n > 0. template.py 1 def sum R(n): if len(str(n)) == 1: 2- return n else: return 20 7. def sum_I(n): add = 0 8 while n: 10 add += n % 10 n //= 10 return add 11 12