adplus-dvertising
frame-decoration

Question

What does Halstead's method, also known as 'software science', use to overcome the problems associated with metrics based on a direct count of lines of code?

a.

The number of unique operands in the program

b.

The number of unique operators and operands in the program

c.

The number of elements per module

d.

The number of lines of code

Posted under Software Engineering

Answer: (b).The number of unique operators and operands in the program Explanation:Halstead’s method, also known as ‘software science’, uses a refinement of counting lines of code. This refinement is meant to overcome the problems associated with metrics based on a direct count of lines of code. Halstead’s method uses the number of operators and operands in a piece of software.

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. What does Halstead's method, also known as 'software science', use to overcome the problems associated with metrics based on a direct count of lines of code?

Similar Questions

Discover Related MCQs

Q. Why is the number seven used as a limit for the number of elements per module?

Q. What is the main drawback of using the number of lines of code as a complexity metric?

Q. What is Halstead's work known for?

Q. What is the second class of intra-modular complexity metrics based on?

Q. What is the complexity metric based on the use of data structures concerned with?

Q. What is the best-known complexity metric from the class of structure-based complexity metrics?

Q. What does McCabe base his complexity metric on?

Q. What is the formula for McCabe's cyclomatic complexity?

Q. What does the cyclomatic complexity of a program depict?

Q. What is the suggested limit of cyclomatic complexity by McCabe?

Q. What is the purpose of McCabe's cyclomatic complexity metric during testing?

Q. What do complexity metrics like those of Halstead and McCabe measure?

Q. What is the purpose of complexity metrics like McCabe's, Halstead's and others?

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

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?