adplus-dvertising
frame-decoration

Question

What is the depth of the call graph?

a.

Length of the longest path from the root to some leaf node

b.

Maximum number of nodes at some level

c.

Number of edges

d.

Number of nodes

Posted under Software Engineering

Answer: (a).Length of the longest path from the root to some leaf node Explanation:The depth of the call graph is defined as the length of the longest path from the root to some leaf node in an acyclic directed graph.

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 depth of the call graph?

Similar Questions

Discover Related MCQs

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?

Q. What happens to the value of tree impurity if an edge is added to a connected graph?

Q. What is the purpose of the tree impurity measure?

Q. Is it always easy to strive for a neat hierarchical decomposition?

Q. What is the purpose of organizing clusters hierarchically in a design?

Q. Does tree-like call graph allow for reuse in the same program?

Q. What does the call graph allow us to assess in a design?

Q. What is the definition of local flow in the context of information flow between modules in a system?

Q. What is the definition of global flow in the context of information flow between modules in a system?

Q. Using notions of local and global data flow, Shepperd defines the ‘complexity’ of a module M as

Q. Who proposed the information flow measure?

Q. What is the purpose of the information flow metric?

Q. What is the relationship between information-flow metric and the abstract data type architectural style?

Q. How does the choice of measure affect the grouping of elements?

Q. What is WMC(Weighted Methods per Class) in the context of object-oriented metrics?

Q. What does DIT stand for in the context of object-oriented metrics?