adplus-dvertising
frame-decoration

Question

What is the problem with the known complexity metrics?

a.

They are not context-sensitive

b.

They only measure a few facets

c.

Both a and b

d.

Neither a nor b

Posted under Software Engineering

Answer: (c).Both a and b Explanation:The known complexity metrics are not very context-sensitive and only measure a few facets, which makes them insufficient.

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What is the problem with the known complexity metrics?

Similar Questions

Discover Related MCQs

Q. What is the 'representation condition' In terms of measurement theory?

Q. Can a higher value of complexity metric necessarily mean that a program is more complex?

Q. What is the recommendation for the use of complexity metrics?

Q. What do validations of software science and cyclomatic complexity indicate?

Q. Why is the length of a program (number of lines of code) often used as an indicator of complexity?

Q. What does the graph depict in the design process of a set of modules and their mutual dependencies?

Q. What is the purpose of knowing the intermodule relations in a design process?

Q. What is the information flow between modules restricted to in a proper design?

Q. What is the purpose of the graph in the design process of a system?

Q. What is the amount of knowledge between modules supposed to be kept to a minimum?

Q. What is the graph depicting the uses-relation often referred to as?

Q. What is the most general form of the call graph?

Q. What is the uses-relation called if the graph is acyclic?

Q. What is the size of the call graph measured in terms of?

Q. What is the depth of the call graph?

Q. What is the width of the call graph?

Q. What is the relationship between a good design and the call graph?

Q. What is tree impurity in the context of a call graph?

Q. What is the formula for calculating the tree impurity of a connected graph?

Q. What is the range of the value of tree impurity of a connected graph?