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!

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: Problem 4 Assuming that each tour can be generated in constant time, what will be the efficiency…

A: Θ(n!)

Q: Problem 11 Write an algorithm in pseudo code that, for a given graph, outputs vertices of each…

A: Algorithm for pseudo graph: 1. First initialize all vertices are unvisited. 2. a. If vertex v is…

Q: I need these codes to be sorted in descending order instead of ascending order. Program #1 – Bubble…

A: Program 1: import java.util.*;import java.lang.*;import java.io.*; class BubbleSort{ void…

Q: Look at the following C++ pseudo code: Binary_search(int a[], int size) { ……….// binary search…

A: Given: A pseudocode in C++ including two procedures like the selection sort and the binary-search.…

Q: typedef struct { short data[4];} MatrixElement; void copy_matrix(MatrixElement m1[],…

A: To solve these problems, we need to understand how the data is laid out in memory and how the cache…

Q: { if(used capacity) { resize((1.5*capacity) + 1); } if(current index >= used) current_index = 0; { }

A: we must declare sequence variables them before using them . Below program is a similar example:

Q: Write a program that sorts a given array by using Bubble Sort. Then, find out the index of the input…

A: A function bubble_sort(int*) is used for sorting the array using bubble sort. A function…

Q: ) Consider the following C code snippet. void swap(int *xp, int *yp) { int temp = *xp;…

A: In this RISC-V assembly language implementation, converted a given C code snippet into assembly…

Q: 1. Trace each of the above algorithm using specific values for a and b. 2. Compare both algorithms.

A: 1. Trace each of the above algorithms using specific values of a and b. Take a=20, b=5. GCD of…

Q: Algorithms in pseudo code MUST be placed in code blocks/fences, and use either the cpp or java…

A: The answer is given in the below step

Q: #include using namespace std; char* duplicateWithoutBlanks(char *word) { int len = sizeof(word);…

A: Program changes: Make the method duplicateWithoutBlanks() void. char* str and counter k is suffice.…

Q: #include #include "Sequence.h" #include using namespace std; namespace CS3358_FA2022 { //…

A: Coded using C++.

Q: Given the following pseudocode: function fun(n) { var outer_count=0; var inner_count=0; var sum = 0;…

A: Source Code of "Javascript Program" function fun(n){ var outer_count = 0; var inner_count = 0;…

Q: 37 public static int example5(int[] first, int[] second) { // assume equal-length array 38 -…

A: public static int example5(int[] first, int[] second){ int n=first.length, count=0;//runs in…

Concept explainers

Computational Systems

The computation systems can be defined as the systems that are capable of solving a problem that includes calculations either mathematical or logical, and are able to produce the result as an output. For example, a simple calculator that is given a set of numbers and operators as input and produces the result as an output can be defined as a computational system. The above example is a simple illustration only, the computational systems range from simple devices to complex devices such as the systems that control the SpaceX companies, Starlink satellites which are being quite recently seen in the skies at many places globally.

Question

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;
else
mean = -999;
}
i += 1;
}
return mean;
N.B.
N=2466, min = 6, max = 15124

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Java Programming language Please help me with this question
Format Requirement Algorithms in pseudo code MUST be placed in code blocks/fences, and use either the cpp or java syntax highlighter. Algorithms should follow the pseudo code standard described in handout 1. Your pseudo code should be placed in a code block, for example Algorithm alg_name(a, b) { // A description of the algorithm // input: a - a positive decimal integer; b - an integer // ouput: the sum of a and b c = a + b // or, c <- a + b return c } Do NOT change the template except the answer portion. Formulas and equations should be in math mode using Latex math symbols. Markdown math tutorial: http://tug.ctan.org/info/undergradmath/undergradmath.pdf Ways enter into the math mode in Notion: https://www.notion.so/help/math-equations
Find error #include<bits/stdc++.h> using namespace std; class Solution{ public: bool isPossible(vector<int>ank,int n,int mid) { int count=0; for(int i=0;i<rank.size()) { int val= (-1 + sqrt(1+(8*mid)/rank[i]))/2; count+=val; } return count>=n; } int findMinTime(int N, vector<int>&A, int L){ int low=*min_element(A.end()),high=1000000; int ans=high; while(low<=high) { int mid=low+(high)/2; if(isPossible(A,mid)) { ans=mid; high=mid; } else low=mid; } return ans; } }; int main() { int t; cin>>t; while(t--) { int l; cin >> l; vector<int>arr(l); for(int i = 0; i < l; i++){ cin >> arr[i]; } Solution ob; int ans = ob.findMin(n, *arr, l); cout…
Format Requirement Algorithms in pseudo code MUST be placed in code blocks/fences, and use either the cpp or java syntax highlighter. Algorithms should follow the pseudo code standard described in handout 1. Your pseudo code should be placed in a code block, for example Algorithm alg_name(a, b) { // A description of the algorithm // input: a - a positive decimal integer; b - an integer // ouput: the sum of a and b c = a + b // or, c <- a + b return c } Do NOT change the template except the answer portion. Formulas and equations should be in math mode using Latex math symbols. Markdown math tutorial: http://tug.ctan.org/info/undergradmath/undergradmath.pdf Ways enter into the math mode in Notion: https://www.notion.so/help/math-equations
JAVA Programming Write a function that returns true if you can partition an array into one element and the rest, such that this element is equal to the product of all other elements excluding itself. Examples canPartition ([2, 8, 4, 1]) → true // 8 = 2 x 4 x 1 canPartition ([-1, -10, 1, -2, 20]) → false canPartition ([-1, -20, 5, -1, -2, 2]) true
C++ programming language.