UGC NET CSE | December 2019 | Part 2 | Question: 95

Question

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

How many predicate nodes are there and what are their names?

• A. Three: $(1,(2,3),6)$
• B. Three: $(1,4,6)$
• C. Four: $((2,3), 6, 10, 11)$
• D. Four: $((2,3), 6, 9, 10)$

Answer 1

In the flow graph predicate (decision) node, those nodes that have out-degree are $\geq$ 2.

Note: Out degree of vertex = number of outgoing edges.

In given flow graph $F$  three predicate node present:$(1,(2,3),6)$

Option $(A)$ is correct.

Answer 2

Concept
Predicate node is a node that contains a condition. This node has 2 or more outgoing edges from it.
Explanation
In the given graph, the nodes with a condition or with 2 or more outgoing edges are – 1, (2.3), 6.
Hence, there are 3 predicate nodes.