CD | Directed Acyclic Graph | Directed Acyclic Graph with Examples | Ravindrababu Ravula | Free GATE

For Full Compiler Design Playlist: • Compiler Design - GATE... Click for free access to Educator's best classes: : unacademy.com/...
For regular updates follow : unacademy.com/...
To purchase please click : unacademy.onel...

[@satishchandramedi9729]

What is the software and hardware requirements for his board? I'm curious to know

[@hrvora98]

Was waiting for this video for a long time.....Finally got it. Thank you sirji

[@nvsabhishek7356]

In example 4...a -d can be reused... No need to make extra vertices...

[@alaymehta2449]

Yes true

[@nishanthadda8824]

d=a-d here d's value changes so u have to number the variable.Even after numbering it is being reused where it was needed.

[@tusharkadam1583]

On 26:51 how are b1 and d1 different? If we are creating a dag and the value is already computed once(b1) then why are we calculating it again as (d1)? Someone PLEASE explain me this

[@alaymehta2449]

Yes that's a mistake

[@jeettewatia1018]

Yeah, you are right. I think sir didn't notice that.

[@nishanthadda8824]

Watch again there is no issue.b's value changed in between so did d's.

[@shobhitgoel2160]

27:49 Sir has mistakenly made it separate,he has corrected in the immediate example after that

[@varadkulkarni774]

It is supposed to be the same node, you can see it in the solution image in that b1 and d1 are the same node

[@vivekkumargupta8394]

At 26:55 , is there a need to make a new vertex for a0 - d0 ? The node b1 can be resued as d1 right ?

[@letstechify7208]

What will we do if they repeat such type of question in future which one we should consider for final answer?? simplified or the another one ?

[@AshutoshPandey-se8vt]

at 35:11 the DAG can be modified as e0=a0=b0+c0 so no need to calculate e0 again. cause if ques asks for min no of nodes and edges we should simplify and same thing gate did in 2014

[@avirup_01]

Check again. The values of b and c have changed. Therefore it is e0=b1+c1.

[@_AK_24.]

42.20 if they ask in future this type of question find the minimum nodes . What should we do either we want to simplify it or directly use DAG

[@pragatiagrawal3599]

This video helped me a lot! Thank you sir:)

[@AMANDEEP-d7o]

Sir, is this playlist completed for GATE CSE 2023?

[@ravindrababu_ravula]

Yes, its complete

[@AMANDEEP-d7o]

Thanks you sir for providing such a world class educational content for free @@ravindrababu_ravula ♥

[@wonder_life0549]

all these DAGs seem to have cycles...is that right ? for ex the one at 23:00

[@beingmonk1942]

You skipped many topics in all subject sometimes you overloaded information...

[@vyankateshsahu3696]

Thank you sirji 🙏

[@Usurperhk]

At 2x, It's Awesome!!!!!

[@tusharnagpal5269]

Sir I wish it was uploaded earlier. Now, how can I manage 45 minutes😰😞

[@nishanthadda8824]

There are 5 days remaining.Watch the video in 2x speed.

[@ajan7644]

use 2x

[@hrvora98]

watch it in 2x. will take only 25 mins.

[@arpitbagri5010]

1.25x

[@bakshiowaisofficial]

First view