There's something about the way you articulate concepts and break things down that just kept me hooked throughout. You deserve way more subs man!

Top notch content! Subbed 🎉

Hi! at 11:37 why are the last 12 bits in the physical address not the same as the virtual address (0x678)? edit: see answer that this is bug in the animation. Thanks again for the great video!

Great vid!

Great content, keep up pls

Godot > Unity

u hear me youtube i want this kinda recommendations

Shit got real at page tables section, i need to rewatch

Let's goo man, so happy to see more from this channel!! Loving the depth of these videos, so much value and the quality is amazing!

awesome

fantastic

WanTSSuPar0pen2imeBAtinueTRollEtERPuzoListSayEdEN2ryAdSyRTCirbaYescIR8kreQuiXTremeFaxITeq0SerVDazERosTruFALgazTorQwerNaNoserOboLurqizep0shaGuESTraw0pigsayHooLi0ffyUnsayz0v0THEfencesEXterior2anyAZpimpGasPEtrolluDoVic64qwirTyp0GsportyPonoRyDosBArNiQolTorPEdosIMpl/14rayMSorTieRuVSurFAcedMaTRix9plANsciTRiffidChuGauSWieRssoV0queeNutJobossayVerJeeSuseNovellisztEd0wwwooLizERPr0feeQTinTunTangoATlazDAnteHoyst4buisnessirCareerEST0baq2whirlyBuerueCRazeeREpeeteeGATEtuxedoCyClonicSWeePunDaPLundirKoMixNonDoArKidWuidCowTeaPolkohl4quadRuGoEnixPaygRossRyVenGyBayesunGizArkahnStairFRed9jarTapDarn4sport0pirtANOwn0LuRnunWhys??😅

I assume for 64-bit memory, it doesnt store page tables for the full address space, since that would be absurdly huge. I assume it just grows with memory requested and shrinks with frees. What I don’t understand there though is how it would shrink if you didn’t free the buffer at the end of your memory.

This channel is a gold mine

Great way of explaining, the visualisation is helpful. Thank you!

This is best video for comprehensive understanding how git work internally. Thank you so much…

🙏🏽🔝

Wait, in 19:15, if we're only using the first 10 bits then the "VPN Part 1" will in reality only use 0001001001, which is not quite 0x12345, correct?

I read it in some book that dynamic programming name came from literature which means to fill the table.

def binomial(n,k): k = min(k,n-k) product = 1 for i in range(1,k+1): product *= n-i+1 product //= i return product grid_paths = lambda x, y: binomial(x+y-2, y-1) Lol imagine not just doing this for the maze problem

Such a Beautiful Explanation. Thanks a lot Man. This is the Best explanation, it removed all the confusions I had for the last 6 years on this OS chapter

I fucking hate computer architecture

Ever since I have started to learn machine learning I can't help but relate eveything to ML concepts. I don't know if this will make sense or not. But DP is similar to LSTM. Next answer dependent on the previous one, but also a long term memory capability😅

Great video, brilliantly explaining the concept in details ! Thank you so much!

Dynamic programming dont have the base like tree or other algorithms, it is just technic that can be explained by examples, That's what I am seeing about this with two days of learning of DP

Thank you very much! I finally understand how virtual memory works. If only university professors could be structured like this...

you are a fantastic teacher sir. Don't know how i found you, but i love you

Robotics

I'm sorry, but these code samples don't work, first of all, and they are inefficient. The recursive approach breaks when None, None comes since we have to add None + 1. The iterative option isn't efficient either. Why the iteration from 1 to m, step 1? So if we have total of 5000, then we must count from 1 to 5k for each coin denomination we have? I don't think that's good. Also, for the recursive approach, the internal memory (memo) only returns a primitive value stored in the dictionary and not a dynamic one or even the name of the memo itself, hence for each recursive call, memo is set to blank and that means there is never a time when m is in memo - moreover, memo is garbage collected on return of each function call. The iterative approach attempts to save the values in the new memo for each function call but never tries to use a saved value. This means it's always calculating and repeating previous calculations. Even though the concept of dynamic programming was simplified as recursion + memoization, these solutions don't seem to work efficiently. Someone else could try executing them in their console and let me know if I am missing something important. @Nilola please review the solutions and my response and correct me where I'm wrong. Thank you.

At the start where you're defining the longest common subsequence, you miss the fact that 234 is actual the longest common subsequence. I think you should reupload the video with the correction, as the rest of the video can't really be trusted especially for the uninitiated.

Videos like these are the only reason I cannot stop using KZbin. You are such a great explainer, dude!

Thanks for the content. You really have a talent, keep this going.

Hey Nikola I really liked your video! I have a question though - how does a program know which virtual address to access? For example, how did the program know in your video to access address 0x12345678? You said a virtual page is assigned to each program, so how does it know what’s the virtual page that was assigned to it?

This has to be the best and most comprehensive video i can watch on RSA.Thank you

👍

Hey, really hoping to see more from your channel, your deep dive videos with amazing animations are like nothing else on youtube!

comment and downvote so all these git videos stop appearing in my feed

Where is the rest?

This is the single greatest explanation of virtual memory I've ever seen, thank you so much.

1:58 fibo prob ans: F n l n l If n<0 ... .r 1 .r nln-1l + nln-2l

This is a great video. It would be 1000x more useful if it illustrated each concept with corresponding git command - simple, e.g. commit, to advanced, e.g. rebase. Perhaps someone here could point me to a video where git concepts are matched to git commands, please?

this is gold, thank you so much

the zero represents other thibgs on the application layer ,the on off switch in the physical layer is physical ,still physical ,but the operating system is buikt spicifically for the hardware 100% ,if you count the pins its also 32 bits from each side ot 1 but no it has 2 faces in each slot

thats why 64 bit arrived ,for the games ,ut needs its own 32 bit not 64 ,all of them are 64,because 2^8 its 2 bits per second not i bit 2 bits ,and every 2 bits is 1 silo

Hi man.

thanks

Brat objasnio u 20 minuta content sa tri predavanja System Level Programiranja na faksu. Svaka cast!

what are you using for video editing ? please

One of the best videos in explaining git imo! Explains everything extremely clearly!!! No confusing language, and mixing of different terminology. The only thing that is't crystal clear is the very last example of "cherry picking" when rebasing the feature branch onto the main branch. It isn't very clear from this example between which commits the diffs are taken. In the example you want to rebase commit F onto commit D by applying the diff between F and it's parent commit E (which also happens to be the 1:st commit of feature branch since moving off from main) onto commit D along with the diff between D and E. But you never mention what would happen if there were more commits in the feature branch between E and F. Is the rebase operation going to take the diff between the last commit of feature and the 1:st commit of feature, or the immediate parent of the feature? In your example those two possibilities are the same since there are no commits between the 1:st and last commit of the feature branch. Anyway, that's the only thing I could find that didn't make sense. Maybe I missed something and just need to watch it again.

my rpoffessors explained this to me in 3 times the time and with half of the enthusiasm, I hate uni honestly