- 4
- 232 822
Computer Science
United States
เข้าร่วมเมื่อ 2 ต.ค. 2011
Hi,
I explain concepts in computing for Computer Science majors and technology enthusiasts. Such as algorithms, and I may expand into explaining other concepts in programming and system architecting as we go along.
I explain concepts in computing for Computer Science majors and technology enthusiasts. Such as algorithms, and I may expand into explaining other concepts in programming and system architecting as we go along.
First and Follow Sets Explained
Computer Science - Language Translators - " Compilers " - Syntax Analysis
LL1 Parsing table construction, FIRST and FOLLOW Sets help us formalize the task of picking a production rule using two functions. We pick a rule when we have a choice between two or more r.h.s. by predicting the first symbol that each r.h.s. can derive. This task is generally encountered senior year for Computer Science & Software Engineering Students while taking the Compilers course. I derive the first and follow set during this presentation and attempt to clarify parts that generally cause confusion for students.
r.h.s - right hand side
LL1 Parsing table construction, FIRST and FOLLOW Sets help us formalize the task of picking a production rule using two functions. We pick a rule when we have a choice between two or more r.h.s. by predicting the first symbol that each r.h.s. can derive. This task is generally encountered senior year for Computer Science & Software Engineering Students while taking the Compilers course. I derive the first and follow set during this presentation and attempt to clarify parts that generally cause confusion for students.
r.h.s - right hand side
มุมมอง: 18 027
วีดีโอ
Optimal Page Replacement Algorithm
มุมมอง 13K7 ปีที่แล้ว
Computer Science -Operating Systems OS Algorithm for paging when virtual memory management is required. The optimal page replacement algorithm is a best case scenario used to evaluate the efficiency of other page replacement algorithms. You might also want to check out: Banker's Algorithm explained th-cam.com/video/T0FXvTHcYi4/w-d-xo.html First-in First-out Page Replacement th-cam.com/video/nkV...
Banker's Algorithm explained
มุมมอง 157K7 ปีที่แล้ว
Computer Science - Operating systems - Banker's Algorithm Resource allocation and deadlock avoidance algorithm developed by Edsger Dijkstra that tests for safety by simulating the allocation of predetermined maximum possible amounts of all resources. I explain in a very precise and detailed way exactly how you go about getting the need matrix and then working through the banker's algorithm in o...
(FIFO) First-in, First-out page replacement
มุมมอง 45K7 ปีที่แล้ว
Computer Science -Operating systems Algorithm for paging when virtual memory management is required. This is an inefficient algorithm that would not be used in practice but is presented at university for proof of concept. You might also want to check out: Banker's Algorithm explained th-cam.com/video/T0FXvTHcYi4/w-d-xo.html Optimal Page Replacement th-cam.com/video/LvBpXzqKWDE/w-d-xo.html
thank you so much, I study BSc computer science and this helped
thank you jesus a guy with good accent here
11:35
Hey, good video! Is this a queueing data structure?
Thankkk youu alot my Guy. Fcking Savoir right there!
i have no clue how my professor made it seem so complicated when in reality its that fucking simple wow. thank you very much!
Hey, why we skip Allocation p1 (1000) in 6:14 ?
So i didnt have to recalculate P1, after P4🤔
After 7 years as i give os , very helpful video surely recommend!
SOOOOOOOOOOOOU
Thank you so much for giving extra attention to the difference between LRU and FIFO.
Bro I have operating system exam tomorrow and this video really saved me 😭 thanks and i would appreciate if you can share more knowledge about os. Love the way you explain
ba7bk ya fanaaaaaaaaaaan ye5rebetak hamoooooott mn gamal 4ar7ak ye5rebet omak wla agda3ha doctooooor
i love you man you have saved me you sexy devil
facts 🥰😍😘😻💝💖💘🙉
ti meriti un bacino
I swear i been on this for 3h now and you explained it with 1 minute FUCKING FINALLY!
Thank you mr computer
THANKS!
Great explanation
Thank you for this video ❤
good question
when we doing step 2, must we do the P0 firstly? Can I start with with other, say, like P3 first?
hard
No it was easy
it's the end of 2023 and this video is the best, big thumbs up!
Well explained thank you
Thanks 🙏
Sry but how did 1520 come from i mean is it a dynamic number it is concluded ? in one word how did available come from "? thank you
sat before an exam watching this thinking this guy is a god lmao
thanks
You are a savior. Thanks
this was terrible
This was so helpful and well explained. Thank you!
Clear and simple, thank you for explaining very clearly and well.
At 3:17 why did you skip 3 and 2? At that point 2 was the longest standing so it should be replaced with 3. so it's 0|3|3 -> 0|3|2 -> ...
He skip them because 3 and 2 don't produce page fault
@dvoraklovelace2801 can you pliz explain
@@Astronomy.532lifenspace hi, i understand it as, the page frame 3:17 currently holds [0|3|2]. once you encounter 3 and 2 in the reference string, it counts as a "page hit" since those are in the page table. since they "hit", they do not page fault. part of the reference string will only page fault when it is not contained in the page frame. hence, at 3:22, when he encounters 1 in the reference string, he inserts it into the page frame, as it is new and was NOT in the page frame before the specified timestamp. i think that is correct - hope that helps! EDIT: corrected some terminology that wasnt consistent
Finally I found an English video
racist.
Very good video!
Good job! Thanks!
Where do those original numbers in the matrix come from? At 3:06
Those will generally be provided.
will there be more videos?
Yes, coming soon
I usually don't comment on videos, but this was well explained and simplified the steps nicely. I was struggling to find out what to do with my available and need and it ended up helping me understand it well. Thank you.
You’re welcome
thanks
you're welcome
thx for nice accent
Excellent top notch video, very easy to understand in simple language, thanks a lot. Thanks🙏🙏🙏🙏 made me easy to understand bankers algorithm
Thank you so much !!
You are welcome
During the steps in 3:06 where you caclulated the need, is is possible for any values in the max matrix for any process be smaller than the values in the allocation matrix for the same process?
Kindly revise; Isn't the correct Safe state = [P0, P2, P1, P3, P4]?
Kindly rewatch. No, it isn’t.
THANK YOU!!
Thx so much for the explanation in detail!
What about the unsafe sequence? Do we just reverse the condition when comparing with the need and the available from true to false?
Thanks for the video.