Directions (Q91–95): A flow graph F with entry node 1 and exit node 11 is shown (figure with Q91). Its nodes are 1, (2,3), (4,5), 6, 7, 8, 9, 10 and 11, with edges 1→(2,3), (2,3)→6, (2,3)→(4,5), 6→7, 6→8, 7→9, 8→9, 9→10, (4,5)→10, 10→1 and 1→11.
How many nodes are there in the longest independent path?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: C. 8
Explanation
The longest basis path, 1 → (2,3) → 6 → 7 → 9 → 10 → 1 → 11, has 8 nodes.
More Software Engineering questions
- How many predicate nodes are there and what are their names?
- The M components in MVC are responsible for
- Software reuse is
- Which of the following terms best describes Git?
- A Web application and its support environment has not been fully fortified against attack. Web engineers estimate that the likelihood of re…
- Match List I (process models) with List II (systems). List I: (a) Waterfall model, (b) Incremental development, (c) Prototyping, (d) RAD. L…