DRDO CSE 2022 Paper 2 | Question: 1

Question

What is the minimum number of nodes required in a DAG (Directed Acyclic Graph) for the following block?
\[
\begin{aligned}
U=Z & =V+W \\
X=Y & =U+1 \\
A & =X+Y
\end{aligned}
\]

Answer 1

The minimum no of nodes required in DAG for the given block: ​​​6

Answer 2

The minimum number of nodes required in a directed acyclic graph (DAG) for the given block is 5.

The block contains three equations:

U = Z= V + W X = Y = U + 1 A = X + Y

Each equation represents a node in the DAG, so the minimum number of nodes required is 3.

Additionally, the block includes three variables: U, X, and A. Each of these variables corresponds to a node in the DAG, so the minimum number of nodes required is 5.

This DAG would have the following structure:

• U, X, and A are output nodes, representing the variables that are being calculated.
• Z, V, W, Y are input nodes, representing the variables that are being used as inputs in the equations.
• The input nodes are connected to the output nodes by directed edges, indicating the flow of data from the inputs to the outputs.

 

Comments

Can you please show your DAG ?