adplus-dvertising
frame-decoration

Question

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

a.

Nodes of the graph correspond to modules and the edges denote the information flow between modules

b.

Nodes of the graph correspond to modules and the edges denote the type of dependencies between modules

c.

Nodes of the graph correspond to modules and the edges denote the amount of knowledge between modules

d.

Nodes of the graph correspond to modules and the edges denote the complexity of the relations between modules

Posted under Software Engineering

Answer: (b).Nodes of the graph correspond to modules and the edges denote the type of dependencies between modules Explanation:The nodes of the graph correspond to modules and the edges denote the type of dependencies between modules, such as module A contains module B, module A follows module B, etc.

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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?

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?