Draw the CALLS graph for your sample program, and check whether the graph is a DAG or not.
1. Define some useful relations among modules other than the relations discussed in this chapter. 2. Classify the changes discussed in as either perfective, adaptive, or corrective maintenance. 3. Consider a program you have written in the past in a programming language like Ada, Modula-2, C, or Pascal. (Here we employ Ada, but the exercise […]


