If a Graph Structured Stack contains {1,2,3,4} {1,6,3,9} {1,5,3,4} and {2,9,7,8}, what would be the source and sink vertices of the DAC?Answer( Please choose a correct answer ) CLEARSource – 1, 8 Sink – 7,4Source – 1 Sink – 8,4Source – 3, 8 Sink – 4Source – 4, Sink – 1,8
Question
If a Graph Structured Stack contains {1,2,3,4} {1,6,3,9} {1,5,3,4} and {2,9,7,8}, what would be the source and sink vertices of the DAC?Answer( Please choose a correct answer ) CLEARSource – 1, 8 Sink – 7,4Source – 1 Sink – 8,4Source – 3, 8 Sink – 4Source – 4, Sink – 1,8
Solution
The correct answer would be Source – 1, Sink – 8,4. This is because in a Directed Acyclic Graph (DAC), the source vertex is the one from which all vertices can be reached and the sink vertices are the ones that cannot be reached from any other vertex. In the given Graph Structured Stack, 1 is the common number in all stacks and hence it is the source. 8 and 4 are the numbers that do not appear in the beginning of any stack and hence they are the sink vertices.
Similar Questions
If in a DAG N sink vertices and M source vertices exists, then the number of possible stacks in the Graph Structured Stack representation would come out to be N*M.Group of answer choicesFalseTrue
A Graph Structured Stack is a _____________?Group of answer choicesDirected Acyclic GraphUndirected GraphDirected GraphRegular Graph
What is a sink? A node with no incoming edges. A node with maximum incoming edges. A node with maximum outgoing edges. A node with no outgoing edges.
In linked representation of stack the null pointer of the last node in the list signals ........a.Middle value of stackb.In between some valuec.Bottom of the stackd.Beginning of the stackClear my choice
What is the technical term for a node in a directed acyclic graph (DAG)?Select one:a.Cycleb.Vertexc.Graphd.Edge
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.