search
Log In

Recent questions tagged dag

0 votes
1 answer
1
0 votes
0 answers
2
1 vote
1 answer
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?
asked Apr 28, 2019 in Graph Theory gmrishikumar 176 views
0 votes
0 answers
5
A directed acyclic graph has no connected components. TRUE OR FALSE???
asked Mar 30, 2019 in Programming Doraemon 39 views
0 votes
0 answers
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
asked Jan 27, 2019 in Compiler Design balraj_allam 238 views
–1 vote
1 answer
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:
asked Jan 12, 2019 in Compiler Design newdreamz a1-z0 140 views
0 votes
0 answers
8
Is DAG from compiler design is in the syllabus?
asked Dec 26, 2018 in Compiler Design Shamim Ahmed 203 views
0 votes
0 answers
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
asked Jun 8, 2018 in Compiler Design Na462 304 views
2 votes
0 answers
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:
asked Jan 16, 2018 in Compiler Design VS 584 views
5 votes
0 answers
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?
asked Jan 4, 2018 in Compiler Design srestha 455 views
1 vote
2 answers
12
Consider the following code segment. x = u – t; y = x * v; x = y + w; y = t – z; y = x * y;
asked Nov 11, 2017 in Compiler Design techbrk3 590 views
1 vote
1 answer
13
((x+y)-((x+y)*(x-y)))+((x+y)*(x-y)) Is this correct DAG for given expression ?
asked Nov 2, 2017 in Compiler Design Pawan Kumar 2 1.6k views
3 votes
1 answer
14
What is the method to find no of topological ordering of a Directed Acyclic Graph? For an instance, i found two graphs on internet, whose no of topological ordering is given but how to quickly calculate the total no of ordering? Graph 1 For graph 1, no of topological ordering is 13. ... is 48. If I try to solve it by brute force method, then it's taking lot's of time. Is there any faster way?
asked Oct 21, 2017 in DS stanchion 423 views
6 votes
1 answer
15
A) 2 B)3 C) 4 D) 5
asked Sep 28, 2017 in Compiler Design set2018 832 views
4 votes
1 answer
16
How to find unnecessary production while optimising DAG. for ex- a = b * c d = b e = d * c b = e f = b + c g = f + d How many production need to be removed and how to find them . ?
asked Dec 21, 2016 in Compiler Design Tendua 1.1k views
To see more, click for the full list of questions or popular tags.
...