Відео

Wow, I was really surprised! I was just relaxing on UA-cam to fall asleep and came across your video. I thought it might be trash, but it turned out to be very good with excellent detail and explanation. Great job! Best video on youtube so fare 🎉🎉🎉

Thank you! I've been using git for over a decade and you've finally made it clear! If I ran the internet, this video would be shown at the top of any "how to" search about git.

Can you also call a programm a process with threads etc. or are those two seperat things?

How to make (edit ) this type of content? Can anybody share software name or any youtube playlist to learn

Great video! Sorry you weren't able to get it as trained as you would have liked. I have implemented neural networks and used the game Snake to train them as well so it's nice to see similar interests out there. I also ended up in a similar situation. The program ran well but I didn't get the results I was hoping for. It did "okay" but never really excelled at the game. I'm guessing it has to do with what information the network is being fed and how its fitness is being evaluated - which is frustrating because both of those feel like total shots in the dark at times. I've spent hours trying different combinations and strategies for both and nothing seems to help. Have you considered giving the network the ability to add / remove inputs and outputs? I've also dabbed in creating artificial life ecosystems with NEAT and in that setting, the agents have the ability to gain new senses over time. What often happens is that simple sensor inputs or simple locomotive outputs evolve first as those give the agents the means to at least eat food and navigate around their environment. Once those genes have propagated throughout the gene pool, competition usually starts driving the agents to evolve and utilize more complicated sensors / outputs, which they are able to do because they were given the opportunity to focus on locomotion and eating before being bogged down by extra stimuli (that often just gets interpreted as noise if the agent is not trained to make sense of it). Sorry if I am preaching to the choir but I believe its this uninterpreted noise that usually bottle necks the evolutionary process. One a different note: One interesting thing I did was add multiple snakes in one large 50 x 50 grid, to see them actively compete against each other and fight for a single apple. The game works essentially like Snake combined with Tron, as snakes evolved strategies to trap each other. By far the coolest thing I observed though was when one snake evolved to stick to the bottom-left corner. It would stick to that corner doing clockwise rotations and would only venture out towards an apple if it ever spawned near the bottom-left corner. After eating the apple, it would curl back up and stick to its corner again - all the while every other snake adapted a strategy of just darting towards the apple while dodging snakes. Last tidbit: Transformers and LLM's are cool and all but genetic algorithms mixed with neural architecture will always be my favorite. If anything, a mix of the two or the two working in tandem will certainly bring artificial life to the masses :) But for now, we evolve snakes, even though no asked us to.

You are using the right measure but are calling GiB a Gigabyte, don't fall for Microsofts misinformation, it's a GiBiByte, It's a Giga-Bi-Byte. Meaning it's the equivalent capacity in base 2 that being 2^30 instead of 10^9, 1 kiB has 1024 Bytes, 1kB has 1000Bytes. No computer works in kB, they work in kiB, but now you know the reason why even though you bought a 1TB drive, supposedly your PC registers it as ~930GB, because Microsoft are lying assholes.

Thank you for this amazing video! It's truly refreshing to encounter such well-scripted and nicely illustrated content. It makes really enjoyable trying to learn such complex concepts.

समझ गया गीता पढ़ कर अपने मन को तू मार डाला गीता पड़ता है अच्छी पशुओं को क्यों पड़ता है दोनों पक्ष पढ़कर सपना दोनों के बराबर फैसला कर पाएगा क्या सत्य है क्या गलत दोनों पक्ष पड़ेगा तब तेरे को समझ आएगा क्या धर्म है क्या धर्महै विदाई तो है यादों में फैलने वाला कलयुग का मरियमराज फैसला करना है तो दोनों पक्षों पर जाकर फैसला करके दिखाओ फिर तुम्हें तो साफ साफ कृष्णा भी तुम्हें गलत नजर आएंगे जो अपने फायदा के लिए करोड़ और वह आदमी का वध करवा दिया गुरु और केले का संबंध तोड़ दिया पिता और पुत्र का बीच में दरार डाल दिया गलतीकिसका था युधिष्ठिर का गलती था कि दुर्योधन कागलती था क्या युधिष्ठिर को पता नहीं था कि धर्मराज है दूसरे को पत्नी को जुआ में रखना क्या यही धर्म है रखना था तो अपना पांच भाई मैसेज को रखना अजूबा खेलने क्या धर्म में आता है तो फिर वह कैसे धर्मराज हुआ जो गलत धर्मराज ही नहीं था उसका साथ देने वाला तो गलत है ना सजा दो धर्मराज कोमिलना था सजा तो पांडव का बनता है किसने गलत फैसला किया शिवा तो दोनों दोनों खेले थे कछुआ खेलने वाले दोनों दोनों आधार में हुई कि नहीं जयपुर धर्म था तो उसको जुएं नहीं खेलना था अर्जुन ने जीता था अर्जुन ने विवाह किया था विवाह तो अर्जुन के साथ हुआ था इसलिए अर्जुन की पत्नी था दूसरे का पत्नी को रखने का किसने अधिकार दिया था युधिष्ठिर को

Those who can't remember the past are condemned to repeat it . - Dynamic Programming.

Me traga mais sugestões assim de canal algoritmo do UA-cam, very good

That was a well produced video. Of course he pointed out the important concept of dependencies. I am curious, why did you choose to have arrows pointing the opposite way to convention? To be clear, the conventional way is to point towards the dependencies.

Thank god I found this gem before my exam!

Commenting for the algorithm 😅

DMA

Quite good video. Just a minor comment. You use the word 'Security' in sections but I would call it 'Liability'. Thanks,.

Excellent description on how cpu/memory/os are working together! Well done!

"Programs used to crash in the 1950s or so"? Calm down, it hasn't been that long since Windows XP would ask you to "send an error report".

From Aritmetic concepts , the virtual memóry obeys bijective function (injective and surjective ) about Domain and Image . It is unbelievable !

@0:54 and before that there were 16 bit CPUs that could only address which was only 64 Kilobytes. In the early days it was more around the problem with memory collisions rather then accessing something that is out of range. In the 1960s you wouldn't find the kind of problem you're talking about because the processing power was too expensive to have that kind of problem. Paper Tape and Punch Cards don't have the same problems with accessing memory out of range.

Im just sitting here fascinated...and it makes sense.. knowing just the basics... nice work...a dumb thing to say but this is relaxing...straight to the point ..ask a question ...then answer it... terrific

I think to only get good a DP, is to start thinking about problems that you tend to solve without DP, from the angle of DP.

Is Page Table update and TLB update treated as 1 atomic operation? If yes, how do we maintain atomicity? If no, how do we handle scenarios where the TLB has stale entry?

Wonderful illustration of Virtual Memory. Good Job !

Hey man, can you make same video with gpu and cpu? Your explanation is so good

Great video ! I am preparing for my master degree and found this gold in UA-cam. I believe I can ace my upcoming OS class. I have liked your video and subscribed to your channel. Thanks a lot for the video. Greatly appreciate it.

10:39 All pages are 4096 long except Pages 2, is that a correct?

Watching your videos truly helped me better understand this for my final. Thanks brother, here’s hoping I can graduate

This video is really good, the way that you simplified Virtual Memory is amazing!

I'm already at about 10 minutes and have about 80% understanding. What do you recommend I look for? Or if you have some resource/s I would be grateful

I had a course back when i was in engineering school, the professor did a horrible job explaining memory and virtual memory, I ended up hating the class and i never really understood how it worked. until this day when I watched your video, you did an excellent job, I wish youtube had something like this before. Fast forward today, I work as a sysadmin/infra engineer and i really didn't have an idea how virtual memory works, again until I watched your video, thank you for the effort you put here, I am sure many will watch it and gain valuable informations.

Can u make a video for registers, What are they used for… in a way that we can understand the assembly language

Wow, good video. Good job and thanks for sharing.

I have to words! That video is amazing! You won yourself a new subscriber, my friend! ❤

Isn’t a word 16bits and a dword 32?

شكرا thanks 👍 it was helpful

Very good!

Truly amazing

/loch v'(xt'')~r'' tmp int= <h2''> wn D' eml [2'R : v(p''X'|n|)]/ /~vk2't frch td + pxl u txt bx < vd LN''(v loch sfr''4'fz D')/ /+ wn LN'' D''-214v < loch~r''tmp int abv cntr LN'/ /krch 4'vk wn D''-214v eml v'' eml v''<h2'> const frch td/

Br -- I have seizure! fors! He have -- Spanish -- Syrian nazi accent

al -- oriental identity! Ah ha -- we own - made - all the machines!

Only memory = solid connect f(xt' '')! 0 x -- dead clan member -- 1= clan member 2 = relayed 2x -- 3= drug drop mandatory + gay -- U used, their intel then!

Vir -- verified index - for raid - clan only! 1968 - Birth Ban till - 1990s -- "TAN SON NHUT -- or SAN BN CLAIBORNE -- i.e. Sheriff Dept! US ABN -- Attack the - pregnant woman!

/loch v'(xt'')~r'' tmp int= <h2''> wn D' eml [2'R : v(p''X'|n|)]/ /~vk2't frch td + pxl u txt bx < vd LN''(v loch sfr''4'fz D')/ /+ wn LN'' D''-214v < loch~r''tmp int abv cntr LN'/ /krch 4'vk wn D''-214v eml v'' eml v''<h2'> const frch td/

6:56 why the LCS would contain 5 or 9? B could have no 9 and A could have no 5

Very helpful ❤❤

At 8:37, the animation looks like a rebase, should't it be a new commit which contains all the changes, thanks for the clear explantion though, great vid!

where are you from? just for the accent. (English learner)

Well explained

I wanna thank the youtube algorithm for recommending this video. This is absolute gem for explaining the Virtual Memory concept.

This is amazing! More detail than most Operating System courses in 20 minutes. Awestruck!