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

View solution

Q. What is the depth of the call graph?

View solution

Q. What is the width of the call graph?

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

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

View solution

Q. Who proposed the information flow measure?

View solution

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

View solution

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

View solution

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

View solution