INTRODUCTION TO COMPILER DESIGN
OVERVIEW OF COMPILERS
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
With V (greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?
|
|
(V*(V-1))/2
|
|
|
(V*(V+1))/2
|
|
|
(V+1)C2
|
|
|
(V-1)C2
|
Explanation:
Detailed explanation-1: -3. With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess? Explanation: The first edge would have an outgoing degree of atmost V-1, the next edge would have V-2 and so on, hence V-1 + V-2…. +1 equals (V*(V-1))/2.
Detailed explanation-2: -Each circle is known as a “vertex” and each line is known as an “edge.” “Directed” means that each edge has a defined direction, so each edge necessarily represents a single directional flow from one vertex to another.
There is 1 question to complete.