Register

UGC NET CSE | December 2013 | Part 3 | Question: 4

• recategorized by
10,834 views
3 votes
3 votes

Given a flow graph with 10 nodes, 13 edges and one connected components, the number of regions and the number of predicate (decision) nodes in the flow graph will be

  1. 4, 5
  2. 5, 4
  3. 3, 1
  4. 13, 8
• recategorized by
User Avatar

1 Answer

5 votes
5 votes

Predicate (decision) nodes are those nodes which has out degree atleast 2.

Region =13-10+2 = 5  [i.e. edges - vertex  + (p+1)] since p= 1]

predicate nodes(P)= 

= region = P+1 = 5

 P = 4

so (B) is ans.

User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
1 answer
1
go_editor asked Jul 27, 2016
2,234 views
UGC NET CSE | December 2013 | Part 3 | Question: 17
The compiler converts all operands upto the type of the largest operand is called Type Promotion Type Evaluation Type Conversion Type Declaration
The compiler converts all operands upto the type of the largest operand is calledType PromotionType EvaluationType ConversionType Declaration
User Avatar
3 votes
3 votes
2 answers
2
go_editor asked Jul 29, 2016
2,047 views
UGC NET CSE | December 2013 | Part 3 | Question: 75
Possible thread states in Windows 2000 operating system include: Ready, running and waiting Ready, standby, running, waiting, transition and terminated Ready, running, waiting, transition and terminated Standby, running, waiting, transition and terminated
Possible thread states in Windows 2000 operating system include:Ready, running and waitingReady, standby, running, waiting, transition and terminatedReady, running, waiti...
User Avatar
Link Copied!