Aspire Faculty ID #19104 · Topic: UGC NET Computer Science Dec 2019 (Paper II) · Just now
UGC NET Computer Science Dec 2019 (Paper II)


How many nodes are there in the longest independent path?

Solution

From the given flowgraph, one longest independent path can be written as:

$1\rightarrow(2,3)\rightarrow6\rightarrow7\rightarrow9\rightarrow10\rightarrow1\rightarrow11$

Now count the nodes in this path:

$1,\ (2,3),\ 6,\ 7,\ 9,\ 10,\ 1,\ 11$

Total nodes $=8$

Previous 10 Questions — UGC NET Computer Science Dec 2019 (Paper II)

Nearest first

Next 10 Questions — UGC NET Computer Science Dec 2019 (Paper II)

Ascending by ID
Ask Your Question or Put Your Review.

loading...