# Recent questions tagged dag

1
The graph that shows basic blocks and their successor relationship is called: DAG Control graph Flow graph Hamiltonian graph
2
Construct the DAG and identify the value numbers for the subexpressions of the following expressions, assuming $+$ associates from the left. $a+b+(a+b)$ $a+b+a+b$ $a+a+((a+a+a+(a+a+a+a))$
1 vote
3
Construct the DAG for the expression $((x + y)-((x + y)\ast(x -y))) + ((x+y)\ast(x-y))$
1 vote
4
I have trouble understanding the difference between DAG and Multi-stage graph. I know what each of them is But I think that a multi-stage graph is also a DAG. Are multi-stage graphs a special kind of DAG?
5
A directed acyclic graph has no connected components. TRUE OR FALSE???
6
b = b + c d = b + d b = b – d e = d + b The minimum number of nodes and edges present in the DAG representation of above basic block respectively are ? 4 and 5 5 and 4 6 and 6 6 and 7
–1 vote
7
Consider the basic block given below: u=u+v v=v+w x=v-w y=v-x z=u+v The minimum number of nodes and edges present in the DAG representations of the above basic block respectively are:
8
Is DAG from compiler design is in the syllabus?
9
How to solve Questions of DAG like :- https://gateoverflow.in/2068/gate2014-3-34 My Solution:- (Please Point out what i am doing wrong) and please also do tell the proper way to do such question
10
Consider the basic block given below: b=b+c d=b+d b=b-d e=d+b The minimum number of nodes and edges present in the DAG representation of the above basic block respectively are:
11
Consider C program given below main() { a=a+b; c=a*c; d=c-d; a=c/d; printf("%d",a); } What will the minimum number of nodes and edge present in the DAG representation of the output of above C program?
1 vote
12
Consider the following code segment. x = u – t; y = x * v; x = y + w; y = t – z; y = x * y;
1 vote
13
((x+y)-((x+y)*(x-y)))+((x+y)*(x-y)) Is this correct DAG for given expression ?