adplus-dvertising
frame-decoration

Question

What is the difference between the complexity of a problem and the complexity of the computation performed?

a.

The complexity of a problem refers to behavior while the complexity of the computation performed refers to the amount of resources required for its solution

b.

The complexity of the computation performed refers to time or memory needed while the complexity of a problem refers to the behavior of the problem

c.

The complexity of the computation performed is a well-established field while the complexity of a problem is still a rather elusive notion

d.

The complexity of a problem refers to the amount of resources required for its solution while the complexity of the computation performed refers to time or memory needed

Posted under Software Engineering

Answer: (b).The complexity of the computation performed refers to time or memory needed while the complexity of a problem refers to the behavior of the problem Explanation:The complexity of the computation performed refers to time or memory needed while the complexity of a problem refers to the behavior of the problem.

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 difference between the complexity of a problem and the complexity of the computation performed?

Similar Questions

Discover Related MCQs

Q. What are the two classes of software attributes considered in measuring software complexity?

Q. What is the purpose of measuring software complexity in quantitative terms?

Q. What is a size-based complexity metric?

Q. What is a structure-based complexity metric?

Q. What is the easiest way to measure software size?

Q. What is the ideal size of a module according to (Weinberg, 1971)?

Q. Why is a module suggested to contain at most 7 elements?

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

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?

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?