Walang anuman 😊 Ako rin ay napakasaya dahil kahit papaano ay nkakatulong ang mga content ko sa mga pag-aaral nyo. Kaya ko rin ginawa ang mga videos na ito dahil para sa aking mga estudyante rin 😊
Thank you so much for this nice tutorial ! Finally, now I can understand the concept so well ! Thanks again !! I hope there will be videos based on data structures and algorithms too ! That can be really helpful ! 😊
You're very much welcome! 🥰 I am really glad to hear that it helped you understand the Disk Scheduling Algorithms. Actually, I am planning to create videos about that, but for the meantime, I am creating videos that I currently teach. God Bless!
Hello, my explanation about this topic is based on the book "Operating Systems Concept" 10th edition by Silberschatz, Galvin, and Gagne. And this is a very reliable book, if I may say so.
According to u 0 is not to be included in SCAN but if it is then what is the difference between SCAN and LOOK? As per my knowledge SCAN include extreme values but LOOK doesn't.
Hello, sorry for the late reply. The reason as to why 0 is not included in the scan because it is not included in the queue of pending requests of the disk drive. 😊
@@BlancaflorArada After watching your video again, I realized I wasn't subtracting them in the correct order. All is good now. Thanks for the educational video!
Obviously, hindi kasama ang cylinder O sa request. Pero kung ang nakalagay sa problem ay "towards the lower value" sa halip na "towards the larger value", mapapasama ang cylinder 0 at hindi naman kasama ang cylinder 199 sa path. Isipin mo na sa SCAN, ang last cylinder (either lowest o highest value ng cylinder) depende sa binigay na direction ay yun ang lilikuan para bumalik pataas o pababa. 😊
Hello, seriously reporting yan? College student ka ba o graduate school student? Kung sa grad school ka, ok lang siguro, but sa college, dapat tinuturo yan, hindi reporting. Sorry not sorry pero parang negative ang impression ko sa prof mo 😅
C-SCAN should be faster, going to 0 - in your example - does not count as head movement. Also, the conditions you imposed on the algorithims undermine their efficiency, misleading video...
Thank you for the constructive criticism. 😊 But for C-SCAN, this is the method used in all the tutorials available in the internet, which includes "going to 0" as head movement. The conditions in the example are not personally imposed by yours truly, but it is available from the book "Operating System Concepts, 10th edition" by Abraham Silberschatz, Peter Baer Galvin, and Greg Gagne. And will you please enlighten me by providing additional explanation as to why the conditions impose on the algorithms undermine their efficiency? I hope to gain new knowledge about this matter. And for the record, I do not have any ill intention to mislead anyone with my content. I made sure that my content is accurate as much as I can and I stand corrected if ever I am in the wrong 😊. Thank you very much and God bless! 😊
Sorry to hear that, I was misleaded in my final year exam because of this example, sad to say. Not your fault but I asked all the tutors from my uni and they say it shouldn't count the 0-199 movement as the name c-scan means circular-scan so we don't count that in as our head movement
![[OPERATING SYSTEMS] 11 - Mass-Storage Systems](http://i.ytimg.com/vi/cGZuKCORpa8/mqdefault.jpg)
![[OPERATING SYSTEMS] 11 - Mass-Storage Systems](/img/tr.png)
i wish you were my professor, you explained this so beautifully
I am flattered. May I ask how your professor discusses these types of concepts?
thankyou po mam sa pag turo, sobrang linaw po ng pag tuturo nyo. laking tulong po lalo ngayon na online class at module lang ang nababasa
Walang anuman 😊 Ako rin ay napakasaya dahil kahit papaano ay nkakatulong ang mga content ko sa mga pag-aaral nyo. Kaya ko rin ginawa ang mga videos na ito dahil para sa aking mga estudyante rin 😊
Thanks mam
For helping 🙏🏻
Love you from 🇮🇳
Karnataka ❤️
You're welcome! 🥰
Thank you Ms. For Carrying My College Career
I am very glad that my material helped you understand the concepts of Disk Scheduling Algorithms. 😊
It's very helpful, and simple, you r really amazing ma'am, love from India 🤗🤗🤗🤗🤗🤗
Thank you very much! I am glad that my content helped you in learning disk scheduling algorithms. 😊
@@BlancaflorArada Of the six methods, including: FCFS, SSTF, SCAN, C-SCAN, LOOK, C-LOOK, which method does the Windows operating system use? Thank
Thank you Madam, natulungan mo ako sa quiz ko ang linaw po ng explanations nyo ☺.
Sorry for the late reply. Sana nakapasa ka sa quiz mo ng dahil sa content ko. God bless! 😇
Thank you so much madam, i got a much knowledge from your video. your explanation is very clear and perfect.. olease keep it up madam.
Thank you for your kind words. 🥰
Thank you Ms. Arada, this was a great help. God Bless you.
You're very much welcome! 🥰 I am really glad to hear that it helped you understand the Disk Scheduling Algorithms. God Bless you too!
i love no one is talking about the ant T_T 3:12 ! the confidence of this ant is on different lvl
I feel bad for that ant could have saved the little ant
Thank you so much for this nice tutorial ! Finally, now I can understand the concept so well ! Thanks again !! I hope there will be videos based on data structures and algorithms too ! That can be really helpful ! 😊
You're very much welcome! 🥰 I am really glad to hear that it helped you understand the Disk Scheduling Algorithms. Actually, I am planning to create videos about that, but for the meantime, I am creating videos that I currently teach. God Bless!
@@BlancaflorArada Thank yous so much again !! :)
Really helped just a few minutes before the exam!!!
Wow, I am really very glad to hear that my video helped you in your studies. 🥰
watching this 2 hours before a test
Thx ❤ for informative video about Disk scheduling algorithms. Explained with a good practical ex.
This is what I needed. Thank you so much
You're welcome! I am very glad that my material helped you 😊
I think i like your accent. It easy to understand😍
Thank you very much! 🥰 I hope that you learned something from this tutorial. God Bless!
great explanation and teaching. (appreciation from Sri Lanka)
In C-SCAN algorithm, I see someone on YT didn't count the head moving from 199 to 0, also he didn't count it for C-LOOK, which one is correct?
Hello, my explanation about this topic is based on the book "Operating Systems Concept" 10th edition by Silberschatz, Galvin, and Gagne. And this is a very reliable book, if I may say so.
quite encouraging, am loving this tutorial
Thank you very much for your kind words 😊
@@BlancaflorArada you're most welcome
so perfectly explained..
According to u 0 is not to be included in SCAN but if it is then what is the difference between SCAN and LOOK?
As per my knowledge SCAN include extreme values but LOOK doesn't.
salamat po! Laking tulong
You're very welcome! 🥰 I am really glad to hear that it helped you understand the Disk Scheduling Algorithms. God Bless!
Of the six methods, including: FCFS, SSTF, SCAN, C-SCAN, LOOK, C-LOOK, which method does the Windows operating system use? Thank
The most common in usage is SSTF.
Thank you so much, Well explained
You're welcome! 🥰
Love from india❤
Perfect tutorial doesn't ex.......
This ma'am " hold my disk"🤣
😅
thanks for the tutorial👍
You're welcome! I am hoping that my content helped you. 😊
Why you didn't include the 0 in scan?
Hello, sorry for the late reply. The reason as to why 0 is not included in the scan because it is not included in the queue of pending requests of the disk drive. 😊
What happens if you're getting a negative sum? I'm just leaning about FCFS, SCAN and SSTF.
Good day! Can you please illustrate how did you get a negative sum? Thank you!
@@BlancaflorArada After watching your video again, I realized I wasn't subtracting them in the correct order. All is good now. Thanks for the educational video!
Great explaination
Thank you very much! 🥰 I hope that it helped you learned the Disk Scheduling Algorithms. God Bless!
Can you make a video on N step scan ma'am please.
I can do your request, if time permits me 😉
hello, one question:if it's a disk...so in C scan going from 199 to 0 take just one step, no?
Yes, that's correct.
Thank you for the tutorial
You're very much welcome! 🥰 I am really glad to hear that it helped you understand the Disk Scheduling Algorithms. God Bless!
Thanks beautiful..
You’re welcome 😊
thank you!🥺
You’re welcome 😊
ಪಾಠ ಚೆನ್ನಾಗೇ ಮಾಡ್ತೀರಾ ಮೇಡಂ ನೀವು ಅರ್ಥ ಆಯ್ತು
Thank you for your kind words 🥰
very helpful thanks!
You're very welcome! 🥰 I hope that you learned something from this tutorial. God Bless!
Thanks so much.
Thank you very much! 🥰 I hope that you can learn something from my content. God Bless!
thank you!
You're welcome! Hope the material helped you. 😊
thank you so much !
Thank you very much! 🥰 I hope that you can learn something from my content. God Bless!
Very good
Thank you. Hope the material helped you. 😊
Nice mam
Thank you very much! 🥰 I hope that you can learn something from my content. God Bless!
🥰🥰 gotcha
Thankz
You're welcome! I am so glad to hear that my content helped you. 😊
thank u so much
wow wow now i understand
I am very glad my material helped you understand the concepts of Disk Scheduling Algorithms. 😊
yung sa SCAN po bat hindi po nag descend hanggang 0?
Obviously, hindi kasama ang cylinder O sa request. Pero kung ang nakalagay sa problem ay "towards the lower value" sa halip na "towards the larger value", mapapasama ang cylinder 0 at hindi naman kasama ang cylinder 199 sa path. Isipin mo na sa SCAN, ang last cylinder (either lowest o highest value ng cylinder) depende sa binigay na direction ay yun ang lilikuan para bumalik pataas o pababa. 😊
Students should have basic knowledge of algorithms & program design -- Er. Sunil Pedgaonkar, India, Consulting Engineer (IT), India
I do agree with this. But for this tutorial, I don't think these are necessary.
Wait, left-handed?
thanks
You're very welcome! 🥰 I hope that you learned about Disk Scheduling Algorithms. God Bless!
Enlighthen me with this video dahil mag reporting kami HUHU
Hello, seriously reporting yan? College student ka ba o graduate school student? Kung sa grad school ka, ok lang siguro, but sa college, dapat tinuturo yan, hindi reporting. Sorry not sorry pero parang negative ang impression ko sa prof mo 😅
@@BlancaflorArada undergrad palang, itong scheduling algorithms ako naka assign.
Thankyou
You're welcome! 🥰
great
Thank you very much! 🥰
thankyouuu
You're welcome! 🥰
HEPFUL
I am very glad that my content is helpful to you 😊
3:20 F for the little one
I am sorry for the extra participant 😅
are you from africa madam!??
I think she is from North East India
why u kill the ant lah so cruel
wow.
Thank you very much! 🥰 I hope that you can learn something from my content. God Bless!
看起来很容易其实也一点也不难
C-SCAN should be faster, going to 0 - in your example - does not count as head movement. Also, the conditions you imposed on the algorithims undermine their efficiency, misleading video...
Thank you for the constructive criticism. 😊 But for C-SCAN, this is the method used in all the tutorials available in the internet, which includes "going to 0" as head movement. The conditions in the example are not personally imposed by yours truly, but it is available from the book "Operating System Concepts, 10th edition" by Abraham Silberschatz, Peter Baer Galvin, and Greg Gagne.
And will you please enlighten me by providing additional explanation as to why the conditions impose on the algorithms undermine their efficiency? I hope to gain new knowledge about this matter.
And for the record, I do not have any ill intention to mislead anyone with my content. I made sure that my content is accurate as much as I can and I stand corrected if ever I am in the wrong 😊. Thank you very much and God bless! 😊
Sorry to hear that, I was misleaded in my final year exam because of this example, sad to say. Not your fault but I asked all the tutors from my uni and they say it shouldn't count the 0-199 movement as the name c-scan means circular-scan so we don't count that in as our head movement
ogey
kawawa po yung langgam
Aww, sorry about that 😅