How to evaluate given DAG ?

Question

In this one I am unable to follow in the above node marked as "-" ,it has two edges one upward and one downward for "+" node so then how to proceed with this ?

Comments

Cycles in Acyclic graph ?? :o

Answer 1

This is not DAG. Remember defination of DAG ?

In mathematics and computer science, a directed acyclic graph (DAG)  is a directed graph with no directed cycles.

Ref ->

https://en.wikipedia.org/wiki/Directed_acyclic_graph

This is some weird test series question, I think you should not, & Nobody should spent time on this !

Comments

YES ,FIRST OF ALL THE DIAGRAM IS NOT A DAG

FROM (ROOT)'+' NODE TO '-' NODE ,CYCLE IS FORMED

DAG CONTAINS NO CYCLE

Answer 2

50..

Comments

Cycles in Directed Acyclic Graph ?

---

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.

---

yes thats true , but method which i said is correct ... (just avoid cycles :P) i mean edges on same vertex but not form cycle

Answer 3

((a+a)+(b+b))-((a+a)-(b-b))+((a+a)+(b+b))

=30-10+30=50

Comments

@srestha goelin your answer how you determined sequence of highlighted signs.?

 ((a+a)+(b+b))-((a+a)-(b-b))+((a+a)+(b+b))