Cycles in Acyclic graph ?? :o

The Gateway to Computer Science Excellence

+1 vote

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 ,

@parsanna , values are given in lower level ... and upper part contain operations so we have to this way ,

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,366 answers

198,496 comments

105,265 users