The Gateway to Computer Science Excellence
0 votes
274 views

it is very confusing in upper part,someone xplain in details

in Compiler Design by Loyal (6.4k points) | 274 views
0
Cycles in Acyclic graph ?? :o

1 Answer

+1 vote

50..

by Boss (17.1k points)
0
a+a = 20 and b+b = 10,then pls xplain,so many arrow from same node,pls xplain upper part..
0
@sonam.

do we always have to consider Bottom up approach ?
0
loop indicate we have to perform operation on same operand ..., upper part subtraction is performed between two addition results , so it is 20-10 =10 , now this node have value 10, now more upper part .. node contain addition with 4 edge , 2 from subtraction node (contain 10 value) other 2 from addition ( which have 20 and 10 ) .. at addtion node contain (10+10) (from subtraction node which have loop with addition node) + 20 (addition node which have value 20)+ 10(other addition)= 50

 

@parsanna , values are given in lower level ... and upper part contain operations so we have to this way ,
0
@sonam +1 upvote
0
Cycles in Directed Acyclic Graph ?
0
its some weird question asked in some test series. we should not waste our time on this question. I realized later DAG cannot have cycle.
0
yes thats true , but method which i said is correct ... (just avoid cycles :P) i mean edges on same vertex but not form cycle
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,366 answers
198,496 comments
105,265 users