Q2. Consider some possible complexity metrics for MM-Paths: ◾ V(G) = e – n ◾ V(G) = 0.5e – n + 2 ◾ sum of the outdegrees
Posted: Wed Apr 27, 2022 3:35 pm
Q2. Consider some possible complexity metrics for MM-Paths:
V(G) = e – n
V(G) = 0.5e – n + 2
sum of the outdegrees of the nodes
sum of the nodes plus the sum of the edges
Software Engineering
Q5. Consider the process of writing an important paper (e.g. a
formal paper or a proposal). In the (dark) days before word
processors, students were encouraged to develop detailed outlines,
then a draft that might be reviewed, make final changes, and TYPE a
final version (ouch!). Discuss how technology has changed this
process, then relate it to the life cycle models we have studied.
Can you think of other situations where moving from a
Waterfall-like approach to a different life cycle has improved the
process?
V(G) = e – n V(G) = 0.5e – n + 2 sum of the outdegrees of the nodes sum of the nodes plus the sum of the edges Software EngineeringQ5. Consider the process of writing an important paper (e.g. a
formal paper or a proposal). In the (dark) days before word
processors, students were encouraged to develop detailed outlines,
then a draft that might be reviewed, make final changes, and TYPE a
final version (ouch!). Discuss how technology has changed this
process, then relate it to the life cycle models we have studied.
Can you think of other situations where moving from a
Waterfall-like approach to a different life cycle has improved the
process?