UGC NET Computer Science December 2019 | Question 144

Question 144

---

A flow graph F with entry node (1) and exit node (11) is shown below:

How many nodes are there in the longest independent path?

1. 1. 6
2. 2. 7
3. 3. 8
4. 4. 9

Answer : 3. 8

Explanation Question 144

The longest independent path nodes are 8 but it have 2 possibilities
Path 1: 1 → (2,3) → 6 → 7 → 9 → 10 → 1 → 11
(or)
Path 2: 1 → (2,3) → 6 → 8 → 9 → 10 → 1 → 11

So, option 3 is correct answer

Previous	Next
UGC NET CS December 2019 - Question 143	UGC NET CS December 2019 - Question 145