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

PYQ UGC NET 2019

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

How many nodes are there in the longest independent path?

  1. A.

    6

  2. B.

    7

  3. C.

    8

  4. D.

    9

Attempted by 195 students.

Sign up free to check your answer

Sign up free

Explore the full course: Nta Ugc Net Paper 2

Loading lesson…