วีดีโอ

Good one. Thanks from Pakistan :)

thank you sir

sir, thank you so much for these videos, these are golden

🙏🙏🙏

Please don't use colour chock it's not clearly visible

Very well explained , thank you Sir !

Yahoo

Great video , deserves millions of views , keep it up sir

thank u sir

Sir we want to see you live on the blackboard again really appreciate the personal touch

1st Comment 👉🏻👈🏻👀

Clear and to the point 👌🙏

Starting this series to prepare for my exam. So far the best compiler theory on YT. Will see how it goes to the end of the series.

thanks :)

Sir, I do not understand how we can do the last optimization because the value of a is going to be different in both computations. Suppose at start a=2 and b=5 a=2+5=7 f=7+5=12 But if we change to f=a a=2+5=7 f=7 Do let me know if I am missing anything sir

16:32 Could you please clarify, that in the second iteration of live variable analysis, while computation of node 3 the OUT[B] should be IN[2], which will be the value from iteration 1 i.e., {i,j,k,p} instead of {p,i}?

Thank you very much for this excellent explanation! It was clear and easy to follow. I have a small suggestion - it might be helpful to include the definitions of the closure function and the GOTO function for added clarity. Regardless, I truly appreciate the effort you put into this content. Thanks again!

thanks :)

3?

thanks sir :)

Sir, I had watched your qc Playlist for past 2 days and learnt a lot. I'm writing my comment today and tomm is my qc sem exam. Just a few days before, I had failed the qc formative assessment and my sir called me for a quiz so that I can pass it, unfortunately I couldn't answer even the basic questions. But, now, I seem confident, I have a love for qc now and it's all because of you. I never usually comment on yt videos but I commented here coz you have actually helped me a lot. I hope that I'll be able to pass tomm's exam and show my sir that I am also capable and let this be a reply to all the humiliation he gave me. I take it all in a positive note. Thank you once again.

Hey man, do you need to know "classical computing" in order to understand the lectures? And if you do, where can a learn it?

ANLAT HOCAAA ELK336E vizesi var

GREAT EXLPANATION THANK YOU SO MUCH

Thank you! Great explanation

overall good method of teaching . Node tree ki samajh nahi ay just .....

Best explanation on the internet

Is it possible to communicate with you through mail Sir?

Sir, where is the y input at the Rf circuit at 5.49 in this video

i hate this video couldnt even understand a single line worstttttttt

how did eigen value become -i??? cos(2*pi)+i*sin(2*pi)=-1 right????

amazing! very well explained!!

The best video I've found to explain LR(1) items

Thanks, but the Pauli-Z gate in the thumbnail is flipped .. not the same as shown in the video I think

in my exam there was a question of deriving dirac notation of cnot gate ? how to do it ?

0:37 It is simple, but useless 🤣🤣

I have a doubt while decoding, how will bob know what bits to apply, still the probability of getting right answer remain 0.25

Thankyou sir 🙏

The best explanation of the Bernstein-Vazirani algorithm so far I have watched. Thank you Sir.🙏

Nigbal

thanks :)

thanks :)

there's a mistakes, in last row, id terminal should be in the id column, instead of * column

Just to add i gusss alpha should be less than N for it to be in multiplicative group modulo 1

Excellent video

thank you so much sir. I am a very visual learner so I appreciate you drawing out all parts of the circuit/showing us what it looks like at all steps. If I ever win the Nobel Prize, I will be sure to cite you

Just want to tell you sir you are doing amazing job i want to learn about phase for so long but i cound not do it but your video helpd me very much keep doing this

Finally a video, where its intuitively clear what is happening, i love your clear understanding of the algorithm and also that you explain it flawlessly. You definitely have got a fan here!

Learning about compilers opens the world of underlying infrastructures of programming languages. Hence, it gives one the ability to deconstruct all the modern frameworks in a way that high-level developer can never do. I have always seen that those who evolve from low-level concepts to the high-level concepts are far better engineers than those who stick with the high-level concepts from the start.